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
Posted Content
The Forgiving Tree: A Self-Healing Distributed Data Structure
TL;DR: In this article, the authors consider the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary and present a distributed data structure that ensures two key properties.
Proceedings ArticleDOI
CFP: Cooperative Fast Protection
TL;DR: Cooperative fast protection significantly outperforms p-cycle based schemes by achieving faster optical recovery speed with much higher capacity efficiency, but at the expense of higher computation complexity, but without involving any additional signaling mechanism in the optical domain.
Journal IssueDOI
On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem
TL;DR: A preprocessing technique, Guided Design Search, is presented for the fixed-charge multicommodity capacitated network design (FCMD) problem, which applies design of experiment (DOE) principles in order to identify the critical edges in FCMD by analyzing the observed effects of tests using strictly generated sets of edge inclusion-exclusion decisions.
Designing capacitated survivable networks: polyhedral analysis and algorithms
Deepak Rajan,Alper Atamtürk +1 more
TL;DR: It is shown that it is possible to solve much larger problem instances using directed cycles (than shared protection), without significant loss in capacity efficiency, as well as pricing out directed cycle variables and separating the valid inequalities in a branch-and-cut framework.
Book ChapterDOI
Dynamic Routing with Partial Information in Mesh-Restorable Optical Networks
TL;DR: Changing trends in backbone transport networks towards dynamic path provi sioning and evolving optical technologies have motivated the study of dynamic routing algorithms in the context of Multi Protocol Label Switching (MPLS) based networks.
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.