Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
MPLS: technology and applications
MPLS: technology and applications
Fiber Network Service Survivability
Fiber Network Service Survivability
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Profile-based routing and traffic engineering
Computer Communications
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
A partial-protection approach using multipath provisioning
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
An efficient backup path selection algorithm in MPLS networks
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
| Hi-index | 0.00 |
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 setup 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. 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 Intenet 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 excellent (30-50%) improvement in the number 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, performance degradation resulting from stale state information is insignificant for typical update periods.