scispace - formally typeset
Open AccessJournal ArticleDOI

Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

Rainer R. Iraschko, +2 more
- 01 Jun 1998 - 
- Vol. 6, Iss: 3, pp 325-336
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
Journal ArticleDOI

Coded Path Protection: Efficient Conversion of Sharing to Coding

TL;DR: This paper presents an optimal and simple capacity placement and coding group formation algorithm that converts the sharing structure of any solution of a Shared Path Protection (SPP) technique into a coding structure with minimum extra capacity.
Journal ArticleDOI

Idle Protection Capacity Reuse in Multiclass Optical Networks

TL;DR: The proposed idle protection capacity reuse (IR) framework generalizes the practice of reutilizing idle spare resources to both failure-free and failure conditions and shows that the utilization of R-IR in dynamic restoration results in an improved low-class lightpath survivability with respect to the utilizationof stub release.
Journal ArticleDOI

Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding

TL;DR: Simulation results indicate that diversity coding has significantly higher restoration speed than Shared Path Protection and p-cycle techniques from the literature as well as Synchronous Optical Network (SONET) rings, which are commonly deployed by service providers today.
Proceedings Article

Restorable mesh network design under demand uncertainty: toward "future proofed transport investments

TL;DR: This work considers the span-restorable mesh capacity design problem where demand uncertainty is represented by a set of possible future scenarios and an integer program is formulated to study the tradeoff between initial network cost and robustness to uncertainty.
References
More filters
Book

Integer Programming and Network Flows

S. Vajda
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.
Related Papers (5)