Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
TLDR
A method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfermode (ATM) virtual path (VP)-based restoration and jointly optimizing working path routing and spare capacity placement.Abstract:
The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. Previously, the spare capacity of a network with a given set of working span sizes has been optimized to facilitate span restoration. Path restorable networks can, however, be even more efficient by defining the restoration problem from an end to end rerouting viewpoint. We provide a method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM) virtual path (VP)-based restoration. Lower bounds on spare capacity requirements in span and path restorable networks are first compared, followed by an integer program formulation based on flow constraints which solves the spare and/or working capacity placement problem in either span or path restorable networks. The benefits of path and span restoration, and of jointly optimizing working path routing and spare capacity placement, are then analyzed.read more
Citations
More filters
Proceedings ArticleDOI
Recovery strategies in multilayer networks
Didier Colle,Bart Puype,Adelbert Groebbens,L Depré,Dimitri Staessens,Ilse Lievens,Mario Pickavet,Piet Demeester +7 more
TL;DR: This paper aims at discussing the different techniques that can be applied to deal with the impact of a single failure in the context of enormous amounts of traffic aggregated onto a single fiber.
Selfishness and Malice in Distributed Systems
TL;DR: This dissertation presents a mediator that implements the best correlated equilibrium for an extended El Farol game, and studies the degree to which this type of mediator can decrease the social cost.
Journal Article
The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks
TL;DR: In this article, a new problem of Backup Virtual Path Routing is presented for the local-destination rerouting strategy, where the function of the flow lost due to a failure of a single link is chosen as the performance index.
DissertationDOI
Self-repairing hierarchical tree-based link restoration scheme for mesh networks
TL;DR: A self-repairing tree-based pre-planned link protection scheme for backbone mesh survivable networks and provides a comprehensive scheme that covers the signalling, message formats, algorithms and recovery mechanisms for construction of a hierarchical tree in a distributed manner.
Hop Limits in Network Design: What is the Impact on Optimal Network Cost?
TL;DR: In this article, the authors investigate the impact of hop-limited routing paths on the total cost of a telecommunication network and show that hop limits may lead to an unpredictable increase in total network cost, even with large hop limits.
References
More filters
Book
Integer Programming and Network Flows
TL;DR: Interestingly, integer programming and network flows that you really wait for now is coming, it's significant to wait for the representative and beneficial books to read.
Journal ArticleDOI
Self-healing ATM networks based on virtual path concept
TL;DR: Self-healing network techniques suitable for ATM networks in order to realize a high-reliablity B-ISDN are proposed and high-speed restoration technique which exploits the benefits of the VP is proposed and described.
Journal ArticleDOI
Comparison of k-shortest paths and maximum flow routing for network facility restoration
TL;DR: A comparative study of the effectiveness of KSP versus Max Flow as an alternative rerouting criteria in the context of transport network span restoration, and the hypothesis is made that a generalized "trap" topology is responsible for all KSP-Max Flow capacity differences.
Proceedings ArticleDOI
A self-healing network with an economical spare-channel assignment
TL;DR: In order to achieve fast restoration, a distributed control mechanism that is applicable to both line and path restoration is proposed, and the shared use of spare channels for various failure scenarios, including multiple failure cases, are allowed.