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
Heuristic p-Cycle Selection Design in Survivable WDM Mesh Networks
TL;DR: A heuristic approach for finding optimal protection cycles in wavelength-division multiplexing (WDM) mesh networks and guarantees optimality, all cycles are considered as candidates in this study.
Book ChapterDOI
Bandwidth Reallocation Techniques for Admitting High Priority Real-Time Calls in ATM Networks
TL;DR: Bandwidth reallocation and dynamic active channel re-routing are techniques that can be used to admit high priority real-time connections where traditional CAC techniques would deny admission.
Proceedings ArticleDOI
A Shared-Path-Protection Based Heuristic Algorithm for the Capacity Placement Problem in Mesh Networks
Wei Xu,Xing-ming Li +1 more
TL;DR: A heuristic algorithm MSC-JOCP is presented, which is based on shared-path protection, to address the problem of reducing the required total capacity and enhancing the network resource utilization.
Journal ArticleDOI
A decomposition approach for spare capacity assignment for path restorable mesh networks
TL;DR: The numerical results indicate that the combination of additional constraints and the decomposition algorithm improves solution times when compared to solving the original mixed-integer program.
Proceedings Article
A Genetic Algorithm for joint optimization of spare capacity and delay in self-healing network
H. W. Chong,Sam Kwong +1 more
TL;DR: In this article, a multi-objective GA approach is proposed to solve the capacity and routing assignment problem arising in the design of self-healing networks using the Virtual Path (VP) concept.
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.