Provisioning Protection and Restoration (P&R) capability is a necessity in Generalized Multi-Protocol Label Switching (GMPLS) networks. Label Switched Path (LSP) segment-based recovery is an important P&R type. In this paper, three novel overlapped LSP segment selection schemes are proposed. The near-optimal set of overlapped LSP segments can be obtained by the proposed schemes, which have polynomial time complexity. Differences among the proposed schemes are discussed and compared. Performance comparisons between LSP segment recovery with the proposed schemes and end-to-end LSP recovery are conducted. The results show that the proposed schemes perform very well in LSP segment recovery. With the proposed schemes, the complexity of LSP segment recovery design is decreased considerably. Moreover, the proposed schemes provide flexible choices for GMPLS-based P&R techniques in terms of different failure recovery time and resource utilization constraints.

Date Published: 25 October 2004
PDF: 8 pages
Proc. SPIE 5598, Performance, Quality of Service, and Control of Next-Generation Communication Networks II, (25 October 2004); doi: 10.1117/12.571177

Published in SPIE Proceedings Vol. 5598:
Performance, Quality of Service, and Control of Next-Generation Communication Networks II
Frank Huebner; Robert D. van der Mei, Editor(s)