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
Book ChapterDOI
Survivable Network Design: Routing of Flows and Slacks
Deepak Rajan,Alper Atamtürk +1 more
TL;DR: A new mixed—integer programming model and a column generation method for the survivable design of telecommunication networks that has almost the same number of constraints as the regular network design problem, which makes it effective for large instances.
Journal ArticleDOI
Segment-based approaches to survivable translucent network design under various ultra-long-haul system reach capabilities (Invited)
Gangxiang Shen,Wayne D. Grover +1 more
TL;DR: A fast, nearly optimal, algorithm is proposed that can determine the placement of opaque nodes so that the fewest possible number is needed that ensures complete translucent reachability and single-failure survivability on the basis of the corresponding transparent path segments.
Proceedings ArticleDOI
Comparison of Protection Mechanisms: Capacity Efficiency and Recovery Time
Wensheng He,Arun K. Somani +1 more
TL;DR: The effect of network connectivity on the performance of capacity utilization of the methods by experimenting on topologies with different average nodal degrees and integer programming optimization problems for three protection methods in static traffic scenario, considering wavelength continuity constraint are investigated.
Proceedings ArticleDOI
Demand allocation without wavelength conversion under a sliding scheduled traffic model
Arunita Jaekel,Ying Chen +1 more
TL;DR: This paper presents a new and complete ILP formulation for both fixed window model, and the more general sliding scheduled traffic model, where the setup and teardown times may vary within a specified range.
Computational and Design Studies on the Unavailability of Mesh-restorable Networks
TL;DR: Computer emulation of the detailed routing behavior of three progressively more adaptive restoration protocols is used to find the dual-failure restorability (R2) under modular and non- modular capacity assumptions.
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.