Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
Reads0
Chats0
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
Exploiting Forcer Structure to Serve Uncertain Demands and Minimize Redundancy of p-Cycle Networks
Gangxiang Shen,Wayne D. Grover +1 more
TL;DR: In this paper, a simple but efficient forcer analysis method is proposed specifically for span-restorable networks in general, and the method is also capable of exploiting extra servable working channels given an initial network spare capacity budget designed for pre-existing working capacities.
Proceedings ArticleDOI
Xheal: localized self-healing using expanders
Gopal Pandurangan,Amitabh Trehan +1 more
TL;DR: Xheal as discussed by the authors is a distributed self-healing algorithm that maintains good expansion and spectral properties of the network, while allowing only low stretch and degree increase per node, without increasing node degrees by too much.
Proceedings ArticleDOI
Wavelength usage efficiency versus recovery time in path-protected DWDM mesh networks
TL;DR: Novel lightpath routing and protection schemes are described and an inverse relationship between efficiency of wavelength usage and restoration time and the methodology used in the selection of grade of protection in all-optical networks is demonstrated.
DissertationDOI
Optimal Design of Survivable Multi-layer Telecommunication Networks
TL;DR: This thesis provides mathematical models and algorithmic techniques for the integrated optimization of two network layers with survivability constraints and uses the developed techniques to design large survivable two-layer networks by means of linear and integer programming methods.
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.