On line routing of guaranteed bandwidth with restoration

• Autorzy: Olszewski I.
• Języki publikacji: EN

Abstrakty

EN

In this paper the problem of finding a pair of link (node) disjoint active Label Switched Path (LSP) and backup LSP in Multi Protocol Label Switching (MPLS) networks is considered. It was assumed that capacity on the links of the backup Label Switched Paths can be shared. We focus on online algorithms for routing of guaranteed bandwidth of active LSPs and backup LSPs under partial information model in order to optimize the total amount of bandwidth consumed in the MPLS network. We consider only the case of protection against single link (node) failure. In this paper the comparison of two known routing algorithms was carried out. The first of them is based on Integer Linear Programming [3, 4] The second one is based on active-path-first heuristics [8]. In order to avoid the trap-problem the concept of Conflicting Link Set is used. Moreover, new algorithm based on active-path-first heuristics was proposed too. In this paper special attention has been paid to bandwidth consumed in the network, number of rejected connection set-up requests and running time of considered algorithms. The obtained results have proved that the proposed algorithm is comparable to the other algorithms but it has shorter running time then the existing ones.

Słowa kluczowe

EN

protection; routing; bandwidth sharing; multi-protocol label switching; MPLS

PL

zabezpieczenia; ruting; szerokość pasmowa; protokół MPLS

• Wydawca: Polish Academy of Sciences, Committee of Electronics and Telecommunication
• Czasopismo: Electronics and Telecommunications Quarterly
• Rocznik: 2007
• Tom: Vol. 53, No 1
• Strony: 23--38
• Opis fizyczny: Bibliogr. 8 poz., tab., wykr.

Twórcy

autor

Olszewski I.

• Wydział Telekomunikacji i Elektrotechniki, Uniwersytet Technologiczno-Przyrodniczy Al. Prof. S. Kaliskiego 7, 85-796 Bydgoszcz,

Bibliografia

• 1. A. Autenrieth, A. Kirstädter: Engineering End-to-End IP Resilience Using Resilience-Differentiated QoS, IEEE Communications Magazine, January 2002.
• 2. E. Ca11e, T. Jové, J.L. Marzo, A. Urra: A Protection Performance Components in MPLS network. Computer Communications Journal, Vol. 27, Issue 12, pp. 1220-1228, July 2004.
• 3. M. Kodialam, T.V. Lakshman: Dynamic Routing of Bandwidth Tunnels with Restoration, IEEE INFOCOM 2000 Mar. 2000, pp. 902-911.
• 4. M. Kodialam, T.V. Lakshman: Restorable Dynamic QoS Routing, IEEE Communications Magazine, June 2002.
• 5. J.L. Marzo, E. Calle: QoS Online Routing and MPLS Multilevel Protection: A Survey, IEEE Communications Magazine, October 2003.
• 6. J.L. Marzo, E. Calle, C. Scoglio, T. Anjali: Adding QoS Protection in Order to Enhance MPLS QoS Routing, Proc. ICC'03, Anchorage, AK, May 2003.
• 7. S. Norden, M.M. Buddhikot, M. Waldvogel, S. Suri: Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks, Computer Networks, October 2004, 46(2): 197-218.
• 8. D. Xu, Y. Chen, Y. Xiong, Ch. Qiao, X. He: On Finding Disjoint in Single and Dual Link Cost Networks, IEEE INFOCOM 2004.