Abstract
This paper presents a fast and non-greedy interference minimizing routing algorithm (IMRA) for dynamic routing of bandwidth guaranteed flows (label switched paths – LSPs). IMRA operates on-line by handling requests that arrive one at a time without exploiting a priori knowledge of traffic characteristics except the information on ingress-egress pairs. The main objective of IMRA is to place LSPs with guaranteed bandwidth evenly across the network in order to allow more future LSPs to be accommodated and to balance the traffic load. Moreover, IMRA supports the requirements for next-generation routing algorithms (i.e., high-speed and QoS-capable).
Experiments under dynamic (short-lived) LSP requests show better performance than existing non-greedy routing algorithms, while providing lower computation complexity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Wang, Z., Crowcroft, J.: Quality-of-Service Routing for Supporting Multimedia Applications. IEEE Journal on Selected Areas in Communications (JSAC) 14, 1228–1234 (1996)
Kodialam, M., Lakshman, T.V.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In: Proceedings of IEEE Computer and Communications Societies 2000 (INFOCOM 2000), vol. 2, pp. 884–893 (2000)
Kar, K., Kodialam, M., Lakshman, T.V.: Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications. IEEE Journal on Selected Areas in Communications 18, 2566–2579 (2000)
Wang, B., Su, X., Chen, C.L.P.: A New Bandwidth Guaranteed Routing Algorithm for MPLS Traffic Engineering. In: Proceedings of IEEE International Conference on Communications 2002 (ICC 2002), vol. 2, pp. 1001–1005 (2002)
Wang, J., Nahrstedt, K.: Hop-by-Hop Routing Algorithms For Premium-class Traffic In DiffServ Networks. In: Proceedings of IEEE Computer and Communications Societies 2002 (INFOCOM 2002), vol. 2, pp. 705–715 (2002)
Suri, S., Waldvogel, M., Warkhede, P.R.: Profile-Based Routing: A New Framework for MPLS Traffic Engineering. In: Smirnov, M., Crowcroft, J., Roberts, J., Boavida, F. (eds.) QofIS 2001. LNCS, vol. 2156, pp. 138–157. Springer, Heidelberg (2001)
Suri, S., Waldvogel, M., Bauer, D., Warkhede, P.R.: Profile-Based Routing and Traffic Engineering. Computer Communications 26, 351–365 (2003)
Wang, B., Su, X., Chen, C.L.P.: A Bandwidth Guaranteed Integrated Routing Algorithm in IP over WDM Optical Networks. Photonic Network Communications 5, 227–245 (2003)
Hendling, K., Franzl, G., Statovci-Halimi, B., Halimi, A.: Residual Network and Link Capacity Weighting for Efficient Traffic Engineering in MPLS Networks. In: Proceedings of 18th International Teletraffic Congress 2003 (ITC 2003), vol. 5, pp. 51–60 (2003)
Hendling, K., Statovci-Halimi, B., Franzl, G., Halimi, A.: A New Bandwidth Guaranteed Routing Approach for Online Calculation of LSPs for MPLS Traffic Engineering. In: Marshall, A., Agoulmine, N. (eds.) MMNS 2003. LNCS, vol. 2839, pp. 220–232. Springer, Heidelberg (2003)
Guerin, R., Ahmadi, H., Naghshineh, M.: Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks. IEEE Journal on Selected Areas in Communications (JSAC) 9, 968–981 (1991)
Goldberg, A.V., Tarjan, R.E.: A New Approach to the Maximum-Flow Problem. Journal of the Association for Computing Machinery (JACM) 35, 921–940 (1988)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Networks Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River (1993)
Fredman, M.L., Tarjan, R.E.: Fibonacci Heaps and Their Use in Improved Network Optimization Algorithms. Journal of the Association for Computing Machinery (JACM) 34, 596–615 (1987)
Apostolopoulos, G., Guerin, R., Kamat, S., Tripathi, S.K.: Quality of Service Based Routing: A Performance Perspective. In: Proceedings of Association for Computing Machinery’s Special Interest Group on Data Communication 1998 (ACM SIGCOMM 1998), vol. 28, pp. 17–28 (1998)
Apostolopoulos, G., Tripathi, S.K.: On Reducing the Processing Cost of On- Demand QoS Path Computation. In: Proceedings of Sixth International Conference on Network Protocols 1998 (ICNP 1998), pp. 80–89 (1998)
Shaikh, A., Rexford, J., Shin, K.G.: Evaluating the Overheads of Source-Directed Quality-of-Service Routing. In: Proceedings of Sixth International Conference on Network Protocols 1998 (ICNP 1998), pp. 42–51 (1998)
Guerin, R., Orda, A., Williams, D.: QoS Routing Mechanisms and OSPF Extensions. In: Proceedings of IEEE Global Communications Conference 1997 (GLOBECOM 1997), pp. 1903–1908 (1997)
Efron, B., Tibshirani, R.J.: An Introduction to the Bootstrap. Monographs on Statistics and Applied Probability 57. Chapman & Hall, Boca Raton (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hendling, K., Franzl, G., Statovci-Halimi, B., Halimi, A. (2004). IMRA – A Fast and Non-greedy Interference Minimizing On-Line Routing Algorithm for Bandwidth Guaranteed Flows. In: Mammeri, Z., Lorenz, P. (eds) High Speed Networks and Multimedia Communications. HSNMC 2004. Lecture Notes in Computer Science, vol 3079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25969-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-25969-5_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22262-0
Online ISBN: 978-3-540-25969-5
eBook Packages: Springer Book Archive