A primal-dual approximation algorithm for generalized Steiner network problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science - Special issue on dynamic and on-line algorithms
An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for network design problems
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
MPLS: technology and applications
MPLS: technology and applications
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Restoration by path concatenation: fast recovery of MPLS paths
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Reserving Resilient Capacity in a Network
SIAM Journal on Discrete Mathematics
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems
INFORMS Journal on Computing
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Survivability in optical networks
IEEE Network: The Magazine of Global Internetworking
IP restoration vs. WDM protection: is there an optimal choice?
IEEE Network: The Magazine of Global Internetworking
The k-traveling repairman problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Simple pre-provisioning scheme to enable fast restoration
IEEE/ACM Transactions on Networking (TON)
The k-traveling repairmen problem
ACM Transactions on Algorithms (TALG)
Maximizing restorable throughput in MPLS networks
IEEE/ACM Transactions on Networking (TON)
Restoration of virtual private networks with qos guarantees in the pipe model
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Efficient algorithms for shared backup allocation in networks with partial information
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
We consider the design of resilient networks that are fault tolerant against single link failures. Resilience against single link failures can be built into the network by providing backup paths, which are used when an edge failure occurs on a primary path. We consider several network design problems in this context: the goal is to provision primary and backup bandwidth while minimizing cost. Our models are motivated by current high speed optical networks and we provide approximation algorithms for the problems below.The main problem we consider is that of backup allocation. In this problem, we are given an already provisioned (primary) network, and we want to reserve backup capacity on the edges of the underlying network so that all the demand can be routed even in the case of a single edge failure. We also consider a variant where the primary network has a tree topology and it is required that the restored network retains the tree topology. We then address the problem of simultaneous primary and backup allocation, in which we are given specifications of the traffic to be handled, and we want to both provision the primary as well as the backup network. We also investigate the online model where the primary network is not known in advance. Demands between source-sink pairs arrive online and the goal is to provide a primary path and set of backup edges that can be used for restoring a failure of any of the primary edges.