Designing low-capacity backup networks for fast restoration

Authors:
Ron Banner;Ariel Orda
Affiliations:
HP - Labs, Haifa, Israel;Dept. of Electrical Engineering, Technion Haifa, Israel
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 9
Cited 1

A new polynomial-time algorithm for linear programming

Combinatorica
The hop-limit approach for spare-capacity assignment in survivable networks

IEEE/ACM Transactions on Networking (TON)
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Design of logical topologies: a linear formulation for wavelength-routed optical networks with no wavelength changers

IEEE/ACM Transactions on Networking (TON)
On Selection of Paths for Multipath Routing

IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Routing, Flow, and Capacity Design in Communication and Computer Networks

Routing, Flow, and Capacity Design in Communication and Computer Networks
Approximating optimal spare capacity allocation by successive survivable routing

IEEE/ACM Transactions on Networking (TON)
Comparing Restoration Concepts Using Optimal Network Configurations with Integrated Hardware and Routing Decisions

Journal of Network and Systems Management
Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking

An overview of algorithms for network survivability

ISRN Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are two basic approaches to allocate protection resources for fast restoration. The first allocates resources upon the arrival of each connection request; yet, it incurs significant setup time and is often capacity-inefficient. The second approach allocates protection resources during the network configuration phase; therefore, it needs to accommodate any possible arrival pattern of connection requests, hence potentially calling for a substantial over-provisioning of resources. However, in this study we establish the feasibility of this approach. Specifically, we consider a scheme that, during the network configuration phase, constructs an (additional) low-capacity backup network. Upon a failure, traffic is rerouted through a bypass in the backup network. We establish that, with proper design, backup networks induce feasible capacity overhead. We further impose several design requirements (e.g., hop-count limits) on backup networks and their induced bypasses, and prove that, commonly, they also incur minor overhead. Motivated by these findings, we design efficient algorithms for the construction of backup networks.