Routing Bandwidth Guaranteed Paths with Restoration in Label Switched NetworksSamphel Norden, Milind M. Buddhikot, Marcel Waldvogel, and Subhash Suri:Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks, 9th International Conference on Network Protocols (ICNP 2001), pp. 71-79, Riverside, CA, USA, November 2001. AbstractLabel switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks are known for their routing flexibility, predictable bandwidth usage, and quality-of-service (QoS) provisioning. This flexibility in routing enables fault-persistent QoS reservations, where connectivity and allotted bandwidth remains available, even if some links or network nodes fail. The automatic switch-over from a now-defunct path to a new, working path is known as restoration. Restoring bandwidth-guaranteed paths requires allocation of resources to be used in presence of faults, so-called backup paths. In this paper, we investigate distributed algorithms for routing with backup restoration. Specifically, we propose a new concept of Backup Load Distribution Matrix, that captures partial network state, greatly reducing the amount of routing information maintained and transmitted while achieving efficient bandwidth usage. We present and simulate two new distributed routing algorithms, which provide significant improvements in rejection rates and provide substantial savings in call setup time compared to existing algorithms.Documents
BibTeX entry@InProceedings{norden01routing, Author = {Samphel Norden and Milind M. Buddhikot and Marcel Waldvogel and Subhash Suri}, Title = {Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks}, Booktitle = {9th International Conference on Network Protocols (ICNP 2001)}, Pages = {71--79}, Year = 2001, Address = {Riverside, CA, USA}, Month = nov } |
The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.