Skip to main content

A Multi-path Routing Algorithm for IP Networks Based on Flow Optimisation

  • Conference paper
  • First Online:
From QoS Provisioning to QoS Charging (QofIS 2002, ICQT 2002)

Abstract

Intra-domain routing in the Internet normally uses a single shortest path to forward packets towards a specific destination with no knowledge of traffic demand. We present an intra-domain routing algorithm based on multi-commodity flow optimisation which enable load sensitive forwarding over multiple paths. It is neither constrained by weight-tuning of legacy routing protocols, such as OSPF, nor requires a totally new forwarding mechanism, such as MPLS. These characteristics are accomplished by aggregating the traffic flows destined for the same egress into one commodity in the optimisation and using a hash based forwarding mechanism. The aggregation also results in a reduction of computational complexity which makes the algorithm feasible for on-line load balancing. Another contribution is the optimisation objective function which allows precise tuning of the tradeoff between load balancing and total network efficiency.

Supported in part by Telia Research AB.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows. Prentice-Hall, 1993.

    Google Scholar 

  2. J. Alonso, H. Abrahamsson, B. Ahlgren, A. Andersson, and P. Kreuger. Objective functions for balance in traffic engineering. Technical Report T2002:05, SICS-Swedish Institute of Computer Science, May 2002.

    Google Scholar 

  3. D. Awduche, A. Chiu, A. Elwalid, I. Widjaja, and X. Xiao. Overview and principles of Internet traffic engineering. Internet RFC 3272, May 2002.

    Google Scholar 

  4. D. Awduche, J. Malcolm, J. Agogbua, M. O’Dell, and J. McManus. Requirements for traffic engineering over MPLS. Internet RFC 2702, September 1999.

    Google Scholar 

  5. S. Bhattacharyya, C. Diot, J. Jetcheva, and N. Taft. Pop-level and access-link-level traffic dynamics in a tier-1 pop. In ACM SIGCOMM Internet Measurement Workshop, San Francisco, USA, November 2001.

    Google Scholar 

  6. Z. Cao, Z. Wang, and E. Zegura. Performance of hashing-based schemes for internet load balancing. In Proc. of IEEE INFOCOM 2000, Israel, March 2000.

    Google Scholar 

  7. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving traffic demands for operational IP networks: Methodology and experience. In Proceedings of ACM SIGCOMM’00, Stockholm, Sweden, August 2000.

    Google Scholar 

  8. B. Fortz and M. Thorup. Internet traffic engineering by optimizing OSPF weights. In Proceedings IEEE INFOCOM 2000, pages 519–528, Israel, March 2000.

    Google Scholar 

  9. B. Fortz and M. Thorup. Optimizing OSPF/IS-IS weights in a changing world. IEEE Journal on Selected Areas in Communications, 20(4):756–767, May 2002.

    Google Scholar 

  10. D. Mitra and K. G. Ramakrishnan. A case study of multiservice, multipriority traffic engineering design for data networks. In Proc. of Globecom’ 99, Brazil, 1999.

    Google Scholar 

  11. F. Poppe, S. van den Bosch, P. de la Vallée-Poussin, H. van Hove, H. de Neve, and G. Petit. Choosing the objectives for traffic engineering in IP backbone networks based on Quality-of-Service requirements. In Proceedings of First COST 263 International Workshop, QofIS, pages 129–140, Berlin, Germany, Sept. 2000.

    Google Scholar 

  12. D. Yuan. Optimization Models and Methods for Communication Network Design and Routing. PhD thesis, Linköpings Universitet, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abrahamsson, H., Ahlgren, B., Alonso, J., Andersson, A., Kreuger, P. (2002). A Multi-path Routing Algorithm for IP Networks Based on Flow Optimisation. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds) From QoS Provisioning to QoS Charging. QofIS ICQT 2002 2002. Lecture Notes in Computer Science, vol 2511. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45859-X_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45859-X_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44356-8

  • Online ISBN: 978-3-540-45859-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics