Failure-oriented path restoration algorithm for survivable networks
Authors:
- 13 August 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 205-218 Vol.1
Abstract
A new polynomial-time approximation algorithm called service path local optimization (SPLO) is presented. SPLO is shown to perform competitively with existing non-polynomial approximations based on the failure-oriented approach. SPLO is designed for online computation where only one request is computed at a time, and the decision making does not depend on future requests. The polynomial-time and online nature of the algorithm makes SPLO suitable for use in real-time on-demand path request applications. In addition, a non-polynomial approximation algorithm based on SPLO called nSPLO is proposed. Result shows that spare capacity is reduced significantly but at the cost of substantially higher computation run-time. The paper also introduces a new concept called path intermix where the service path's allocated bandwidth can be used by the backup paths protecting that particular service path. The result shows that path intermix can reduce spare capacity by up to 5% for single node failure.Keywords
This publication has 17 references indexed in Scilit:
- Framework for Multi-Protocol Label Switching (MPLS)-based Recovery2003
- Algorithms for computing QoS paths with restoration2003
- Optimal capacity placement for path restoration in mesh survivable networks2002
- A self-healing network with an economical spare-channel assignment2002
- Restoration strategies and spare capacity requirements in self-healing ATM networks2002
- Joint optimization of capacity and flow assignment for self-healing ATM networks2002
- Dynamic routing of bandwidth guaranteed tunnels with restoration2002
- Multiprotocol Label Switching Architecture2001
- Requirements for Traffic Engineering Over MPLS1999
- MPLS advantages for traffic engineeringIEEE Communications Magazine, 1999