Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The hop-limit approach for spare-capacity assignment in survivable networks
IEEE/ACM Transactions on Networking (TON)
A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Resource aggregation for fault tolerance in integrated services networks
ACM SIGCOMM Computer Communication Review
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
IEEE/ACM Transactions on Networking (TON)
Restoration strategies and spare capacity requirements in self-healing ATM networks
IEEE/ACM Transactions on Networking (TON)
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Applying tabu search to spare capacity planning for network restoration
Computers and Operations Research
Protection interoperability for WDM optical networks
IEEE/ACM Transactions on Networking (TON)
Survivable Networks: Algorithms for Diverse Routing
Survivable Networks: Algorithms for Diverse Routing
Fiber Network Service Survivability
Fiber Network Service Survivability
Discrete Mathematical Structures
Discrete Mathematical Structures
Comparison of two path restoration schemes in self-healing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal Spare Capacity Preconfiguration for FasterRestoration of Mesh Networks
Journal of Network and Systems Management
Journal of Network and Systems Management
The Forcer Concept and Express Route Planning inMesh-Survivable Networks
Journal of Network and Systems Management
An Ultra-fast Shared Path Protection Scheme - Distributed Partial Information Management, Part II
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
IEEE/ACM Transactions on Networking (TON)
Spare capacity allocation: model, analysis and algorithm
Spare capacity allocation: model, analysis and algorithm
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking
Prioritized traffic restoration in connection oriented QoS based networks
Computer Communications
Resilience in multilayer networks
IEEE Communications Magazine
Challenges for MPLS in optical network restoration
IEEE Communications Magazine
Emerging technologies for fiber network survivability
IEEE Communications Magazine
End-to-end survivable broadband networks
IEEE Communications Magazine
Dimensioning of survivable WDM networks
IEEE Journal on Selected Areas in Communications
An adaptive survivability admission control algorithm using backup path for high-speed networks
International Journal of Network Management
A distributed scheme for bandwidth reallocation between working and recovery paths
SAICSIT '06 Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries
Generalized survivable network
IEEE/ACM Transactions on Networking (TON)
Information Assurance: Dependability and Security in Networked Systems
Information Assurance: Dependability and Security in Networked Systems
Efficient path protection in bi-directional WDM systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Loop-free path restoration with QoS and label constraints in MPLS networks
Journal of High Speed Networks
Loop-free traffic engineering with path protection in MPLS VPNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel path protection scheme for MPLS networks using multi-path routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Heuristic algorithms for designing self-repairing protection trees in mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Spare capacity reprovisioning for high availability shared backup path protection connections
Computer Communications
Availability-aware multiple working-paths capacity provisioning in GMPLS networks
IPOM'07 Proceedings of the 7th IEEE international conference on IP operations and management
Efficacy of Fiedler value versus nodal degree in spare capacity allocation
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Maximizing restorable throughput in MPLS networks
IEEE/ACM Transactions on Networking (TON)
Designing low-capacity backup networks for fast restoration
INFOCOM'10 Proceedings of the 29th conference on Information communications
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Algebraic connectivity metric for spare capacity allocation problem in survivable networks
Computer Communications
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
Local restoration with multiple spanning trees in metro ethernet networks
IEEE/ACM Transactions on Networking (TON)
Overlay protection against link failures using network coding
IEEE/ACM Transactions on Networking (TON)
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
An optimization algorithm of spare capacity allocation by dynamic survivable routing
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Survivable scheduled service provisioning in WDM optical networks with iterative routing
Optical Switching and Networking
Network-aware impact determination algorithms for service workflow deployment in hybrid clouds
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi-constraint optimization problem, called the spare capacity allocation (SCA) problem. This paper unravels the SCA problem structure using a matrix-based model, and develops a fast and efficient approximation algorithm, termed successive survivable routing (SSR). First, per-flow spare capacity sharing is captured by a spare provision matrix (SPM) method. The SPM matrix has a dimension the number of failure scenarios by the number of links. It is used by each demand to route the backup path and share spare capacity with other backup paths. Next, based on a special link metric calculated from SPM, SSR iteratively routes/updates backup paths in order to minimize the cost of total spare capacity. A backup path can be further updated as long as it is not carrying any traffic. Furthermore, the SPM method and SSR algorithm are generalized from protecting all single link failures to any arbitrary link failures such as those generated by Shared Risk Link Groups or all single node failures. Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.