Abstract
This paper focuses on the selection of bandwidth-guaranteed channels for communication sessions that require it. The basic idea comes from Minimum Interference Routing: select a feasible path that puts the least possible restriction on the transmission capacity offered by the network for other communicating parties. This is achieved by circumventing some critical bottleneck links. The main contribution of the paper is a method to assess the degree of link criticality facilitating efficient route precomputation even in the case, when up to date resource availability information is not immediately available.
Chapter PDF
Similar content being viewed by others
References
Guerin, R., Orda, A., Williams, D.: QoS routing mechanisms and OSPF extensions. IETF RFC 2676 (1999)
Orda, A., Sprintson, A.: QoS routing: the precomputation perspective. INFOCOM (1), 128–136 (2000)
Apostolopoulos, G., Guerin, R., Kamat, S.: Implementation and performance measurements of QoS routing extensions to OSPF. INFOCOM (2), 680–688 (1999)
Kar, K., Kodialam, M., Lakshman, T.: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE Journal on Selected Areas in Communications 18 (December 2000)
Kar, K., Kodialam, M., Lakshman, T.V.: MPLS traffic engineering using enhanced minimum interference routing: An approach based on lexicographic max-flow. In: Proceedings of Eighth International Workshop on Quality of Service (IWQoS), Pittsburgh, USA (June 2000)
Iliadis, I., Bauer, D.: A new class of online minimum-interference routing algorithms. In: Networking 2002, Proceedings of Second the International IFIP-TC6 Networking Conference, May 19-24, p. 959 (2002)
Suri, S., Waldvogel, M., Bauer, D., Warkhede, P.R.: Profile-based routing and traffic engineering. Computer Communications 26, 351–365 (2003)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
Bazaraa, M.S., Jarvis, J.J., Sherali, H.D.: Linear Programming and Network Flows. John Wiley & Sons, Chichester (1990)
Apostolopoulos, G., Guerin, R., Kamat, S., Tripathi, S.K.: Quality of service based routing: A performance perspective. In: SIGCOMM, pp. 17–28 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 IFIP International Federation for Information Processing
About this paper
Cite this paper
Rétvari, G. (2003). Minimum Interference Routing: The Precomputation Perspective. In: Marshall, A., Agoulmine, N. (eds) Management of Multimedia Networks and Services. MMNS 2003. Lecture Notes in Computer Science, vol 2839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39404-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-39404-4_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20050-5
Online ISBN: 978-3-540-39404-4
eBook Packages: Springer Book Archive