The hop-limit approach for spare-capacity assignment in survivable networks
IEEE/ACM Transactions on Networking (TON)
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)
Applying tabu search to spare capacity planning for network restoration
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reserving Resilient Capacity in a Network
SIAM Journal on Discrete Mathematics
Comparison of two path restoration schemes in self-healing networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Inferring link weights using end-to-end measurements
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Analysis of link failures in an IP backbone
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Routing Bandwidth Guaranteed Paths with Local Restoration in Label Switched Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Building Edge-Failure Resilient Networks
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
QoS aware path protection schemes for MPLS networks
ICCC '02 Proceedings of the 15th international conference on Computer communication
Robust Path Design Algorithms for Traffic Engineering with Restoration in MPLS Networks
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Journal of Computer and System Sciences
Approximating optimal spare capacity allocation by successive survivable routing
IEEE/ACM Transactions on Networking (TON)
Simple pre-provisioning scheme to enable fast restoration
IEEE/ACM Transactions on Networking (TON)
Comparison of recovery schemes to maximize restorable throughput in multicast networks
Journal of Network and Computer Applications
| Hi-index | 0.00 |
MPLS recovery mechanisms are increasing in popularity because they can guarantee fast restoration and high QoS assurance. Their main advantage is that their backup paths are established in advance, before a failure event takes place. Most research on the establishment of primary and backup paths has focused on minimizing the added capacity required by the backup paths in the network. However, this so-called Spare Capacity Allocation (SCA) metric is less practical for network operators who have a fixed capacitated network and want to maximize their revenues. In this paper, we present a comprehensive study on restorable throughput maximization in MPLS networks.We present the first polynomial-time algorithms for the splittable version of the problem. For the unsplittable version, we provide a lower bound for the approximation ratio and propose an approximation algorithm with an almost identical bound. We present an efficient heuristic which is shown to have excellent performance. One of our most important conclusions is that when one seeks to maximize revenue, local recovery should be the recovery scheme of choice.