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
Mesh-restorable networks with complete dual failure restorability and with selectively enhanced dual-failure restorability properties
TL;DR: This work shows how to economically support an added service class in the upward quality direction: assured dual failure survivability, which lets a network operator tailor the investment in capacity to provide ultra-high availability on a selective basis, while avoiding the very high investment required for complete dual-failure restorability for all.
Journal ArticleDOI
A Survey on the p-Cycle Protection Method
TL;DR: This survey paper is the first attempt to present a rapid overview of this interesting subject and provide and agile reference of the broad p-cycle topic.
Proceedings ArticleDOI
Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures
TL;DR: It is shown that less information is sufficient to determine the shareability of protection channels with remarkable accuracy, and that this approach yields faster computation times with no significant penalty in terms of capacity usage.
Proceedings ArticleDOI
Capacity efficient distributed routing of mesh-restored lightpaths in optical networks
S. Sengupta,R. Ramamurthy +1 more
TL;DR: Distributed routing techniques to decrease the capacity efficiency gap between centralized routing and 1+1 routing of mesh-restored lightpaths are proposed and a retry scheme facilitated by crankback routing extensions to CR-LDP/RSVP-TE to reduce lightpath blocking is proposed.
Journal ArticleDOI
Near-shortest and K-shortest simple paths
W. Matthew Carlyle,R. Kevin Wood +1 more
TL;DR: This work presents a new algorithm for enumerating all near-shortest simple (loopless) s-t paths in a graph G = (V, E) with nonnegative edge lengths, and devise a simpler algorithm, with exponential worst-case complexity, that is several orders of magnitude faster yet on those test problems.
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.