A rerouting scheme with dynamic control of restoration scope for survivable MPLS network

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a rerouting scheme that can be applied to the restoration of working Label Switched Paths (LSPs) and pre-provisioned backup LSPs, which consists of two subsequent algorithms. The first algorithm for the dynamic deterimination of the restoration scope (RS) increases the restoration speed by minimizing the complexity of the network topology and by maximizing the reusability of the existing working LSP. The second newly proposed concept of RS extension minimizes the probability of restoration failure by dynamically widening the restoration scope until the RS is equal to the whole network topology. Through simulation, we evaluate the performance of our restoration scheme and the existing protection schemes in terms of the restoration speed, packet loss, network resource utilization, and resource reusability of the existing working LSP. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Hong, D. W. K., & Hong, C. S. (2005). A rerouting scheme with dynamic control of restoration scope for survivable MPLS network. In Lecture Notes in Computer Science (Vol. 3391, pp. 233–243). Springer Verlag. https://doi.org/10.1007/978-3-540-30582-8_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free