Share Email Print

Proceedings Paper

Reliability-guaranteed path protection under multiple constraints
Author(s): Yang Liu; Zheng Zheng; Xingchun Liu
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The path protection with reliability guarantee is investigated under multiple constraints. The key challenge of providing ample multi-constrained loop-less paths to the detouring as candidates is addressed by a modified relaxation principle of dominated path. The loops in the new extended sub-paths are explored with an elastic depth, and additive criterions derived from the path information are adopted to obtain more accurate identification of feasible paths. Our hybrid detouring gives priority to the end to end disjoint backup paths and uses the residual space of inter-media nodes to store the potential local disjoint subpaths. The obtained candidate backup paths are selected by appropriate cost functions according to the combined reliability and the consumed resources. Simulation results demonstrate its superiority in restoration path-finding capability leads to a significant improvement in the success rate of the QoS path protection.

Paper Details

Date Published: 19 November 2009
PDF: 7 pages
Proc. SPIE 7633, Network Architectures, Management, and Applications VII, 763313 (19 November 2009); doi: 10.1117/12.852163
Show Author Affiliations
Yang Liu, Beihang Univ. (China)
Zheng Zheng, Beihang Univ. (China)
Xingchun Liu, Beihang Univ. (China)

Published in SPIE Proceedings Vol. 7633:
Network Architectures, Management, and Applications VII
Ken-ichi Sato; Lena Wosinska; Jing Wu; Yuefeng Ji, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?