JOURNAL ARTICLE

Backup Path Multiplexing over Survivable GMPLS Networks

Abstract

This paper proposes a backup path multiplexing scheme for survivable generalized multiprotocol label switching (GMPLS) networks. The shared risk link group (SRLG)-disjoint label switched paths (LSPs) share common backup resources as many as possible to achieve higher efficiency. Based on the problem formulation, the analysis on the expected recovery failure probability, the expected recovery time, and the expected signal loss reveals the upper bound of the backup path length. The simulation results demonstrate that the proposed scheme provides higher multiplexing gain.

Keywords:
Backup Multiprotocol Label Switching Computer network Multiplexing Computer science Path (computing) Label switching Survivability Distributed computing Scheme (mathematics) Routing (electronic design automation) Quality of service Telecommunications Mathematics

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
16
Refs
0.07
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Advanced Optical Network Technologies
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Interconnection Networks and Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Software-Defined Networks and 5G
Physical Sciences →  Computer Science →  Computer Networks and Communications

Related Documents

JOURNAL ARTICLE

Survivable GMPLS networks with QoS guarantees

Yunxiao LuoNirwan Ansari

Journal:   IEE Proceedings - Communications Year: 2005 Vol: 152 (4)Pages: 427-427
JOURNAL ARTICLE

Efficient mapping algorithms for survivable GMPLS networks

Péter Laborczi

Journal:   Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE Year: 2003 Vol: 5285 Pages: 174-174
© 2026 ScienceGate Book Chapters — All rights reserved.