Abstract
Traffic engineering capabilities defined in MPLS enables QoS online routing of LSPs. In this paper we address issues of network survivability in online routing. We define a new link weight LFL (Lost Flow in Link) that can be applied for dynamic routing of LSPs in survivable MPLS network. We propose to use the LFL metric as a “scaling factor” for existing dynamic routing algorithms that make use of additive metrics. Results of simulations show that the new metric can substantially improve the network survivability defined as the lost flow function after KSP local rerouting. However, the application of LFL metric slightly increases the number of rejected calls.
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
Bagula, B., Botha, M., Krzesinski, A.: Online Traffic Engineering: The Least Interference Optimization Algorithm. To appear in the IEEE ICC 2004, Paris, France (June 20-24, 2004)
Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Storeand- Forward Communication Network Design. Networks, 97–133 (1973)
Grover, W.: Mesh-based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice-Hall, Upper Saddle River (2004)
Kar, K., Kodialam, M., Lakshman, T.: Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications. IEEE JSAC 12, 2566–2579 (2000)
Kar, K., Kodialam, M., Lakshman, T.: Routing restorable bandwidth guaranteed connections using maximum 2-route flows. IEEE/ACM Trans. on Networking 5, 772–781 (2003)
Katz, D., Kompella, K., Yeung, D.: Traffic Engineering (TE) Extensions to OSPF Version 2. RFC 3630 (2003)
Kodialam, M., Lakshman, T.: Minimum Interference Routing with Applications to MPLS Traffic Engineering. In: Proceedings of INFOCOM 2000, pp. 884–893 (2000)
Kodialam, M., Lakshman, T.: Restorable Dynamic Quality of Service Routing. IEEE Comm. Mag. 6, 72–80 (2002)
Kodialam, M., Lakshman, T.V.: Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information. IEEE/ACM Trans. on Networking 3, 399–410 (2003)
Murakami, K., Kim, H.: Virtual Path Routing for Survivable ATM Networks. IEEE/ACM Trans. on Networking 2, 22–39 (1996)
Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. RFC 3031 (2001)
Sharma, V., Hellstrand, F. (eds.): Framework for MPLS-based Recovery. RFC 3469 (2003)
Smit, H., Li, T.: ISIS Extensions for Traffic Engineering. Internet Draft <draft-ietf-isistraffic- 05.txt> (2003)
Szeto, W., Boutaba, R., Iraqi, Y.: Dynamic Online Routing Algorithm for MPLS Traffic Engineering. In: Gregori, E., Conti, M., Campbell, A.T., Omidyar, G., Zukerman, M. (eds.) NETWORKING 2002. LNCS, vol. 2345, pp. 936–946. Springer, Heidelberg (2002)
Walkowiak, K.: A New Method of Primary Routes Selection for Local Restoration. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1024–1035. Springer, Heidelberg (2004)
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
Walkowiak, K. (2004). Survivable Online Routing for MPLS Traffic Engineering. In: Solé-Pareta, J., et al. Quality of Service in the Emerging Networking Panorama. WQoSR QofIS ICQT 2004 2004 2004. Lecture Notes in Computer Science, vol 3266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30193-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-30193-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23238-4
Online ISBN: 978-3-540-30193-6
eBook Packages: Springer Book Archive