KOPS - The Institutional Repository of the University of Konstanz

Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks

Aufgrund von Vorbereitungen auf eine neue Version von KOPS, können derzeit keine Publikationen eingereicht werden. (Due to preparations for a new version of KOPS, no publications can be submitted currently.)

Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks

Cite This

Files in this item

Checksum: MD5:2fb005e29dd43931c33ca49f55a450b6

NORDEN, Samphel, Milind M. BUDDHIKOT, Marcel WALDVOGEL, Subhash SURI, 2004. Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks. In: Computer Networks. 46(2), pp. 197-218. Available under: doi: 10.1016/j.comnet.2004.02.015

@article{Norden2004Routi-6009, title={Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks}, year={2004}, doi={10.1016/j.comnet.2004.02.015}, number={2}, volume={46}, journal={Computer Networks}, pages={197--218}, author={Norden, Samphel and Buddhikot, Milind M. and Waldvogel, Marcel and Suri, Subhash} }

Waldvogel, Marcel eng Suri, Subhash Buddhikot, Milind M. 2004 Norden, Samphel terms-of-use 2011-03-24T16:08:43Z application/pdf Routing Bandwidth-Guaranteed Paths with Restoration in Label-Switched Networks A Network Service Provider (NSP) operating a label-switched networks such as ATM or Multi-Protocol Label Switching (MPLS) networks, sets up end-to-end bandwidth-guaranteed Label-Switched Paths (LSPs) to satisfy the connectivity requirements of its client networks. To make such a service highly available, the NSP may set up one or more backup LSPs for every active LSP. The backup LSPs are activated when the corresponding active LSP fails. Accordingly, the problem of LSP routing with and without restoration backup has received some attention in the recent past.<br /><br />In this paper, we investigate distributed algorithms for routing of end-to-end LSPs with backup restoration in the context of label-switched networks. Specifically, we propose a new concept of the Backup Load Distribution (BLD) matrix that captures partial network state and eliminates the problems of bandwidth wastage, pessimistic link selection, and bandwidth release ambiguity. We describe two new, distributed routing algorithms that utilize the BLD matrix and require a bounded amount of run time. We can realize these algorithms in the current Internet architecture using the OSPF extensions for Quality-of-Service (QoS) routing to exchange the proposed BLD matrix among peer routers/switches. Our simulation results for realistic sample topologies show an excellent (30-50%) improvement in terms of rejected requests and 30-40% savings in the total bandwidth used for backup connections. We also show that, although the performance of our routing scheme is sensitive to the frequency of BLD matrix updates, the performance degradation resulting due to stale state information is insignificant for typical update periods. First publ. in: Computer Networks, 7 Oct. 2004, 46(2):197-218 Suri, Subhash Norden, Samphel Buddhikot, Milind M. Waldvogel, Marcel 2011-03-24T16:08:43Z

Downloads since Oct 1, 2014 (Information about access statistics)

norden04routing.pdf 602

This item appears in the following Collection(s)

Search KOPS


My Account