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
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

Routing, Flow, And Capacity Design In Communication And Computer Networks

TL;DR: Throughout, the authors focus on the traffic demands encountered in the real world of network design, and their generic approach allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network.
Journal ArticleDOI

Approximating optimal spare capacity allocation by successive survivable routing

TL;DR: Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.
Journal ArticleDOI

Optical layer survivability-an implementation perspective

TL;DR: The factors that affect the complexity of optical protection schemes, such as supporting mesh instead of ring protection, handling low-priority traffic, and dealing with multiple types of failures are discussed.
Journal ArticleDOI

Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints

TL;DR: This study addresses the routing and wavelength-assignment problem in a network with path protection under duct-layer constraints in a wavelength-division multiplexing (WDM) network in which failures occur due to fiber cuts.
Proceedings ArticleDOI

Approximating optimal spare capacity allocation by successive survivable routing

TL;DR: Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.
References
More filters
Journal ArticleDOI

A passive protected self-healing mesh network architecture and applications

TL;DR: The authors propose a passive protected DCS self-healing network (PPDSHN) architecture using a passive protection cross-connect network for network protection that may apply to not only the centralized and distributed control DCS network architectures, but also asynchronous, SONET and ATM DCS networks.
Book ChapterDOI

Distributed Restoration of the Transport Network

TL;DR: This chapter contains sections titled: Introduction Restoration Speed and Network Capacity Theory and Concepts Alternative Routing Criteria Performance Measures for Distributed Restoration performance measures fordistributed Restoration.
Proceedings ArticleDOI

Joint optimization of capacity and flow assignment for self-healing ATM networks

TL;DR: The basis matrix can be readily factorized into an LU form by taking advantage of its special structure, which results in a great reduction on the computation time of the revised simplex method.
Proceedings ArticleDOI

Two strategies for spare capacity placement in mesh restorable networks

TL;DR: The spare link placement algorithm (SLPA) is based on the principle of iterative link addition to produce the greatest incremental change in network restorability and is shown theoretically and experimentally to have polynomial time complexity.
Proceedings ArticleDOI

A distributed link restoration algorithm with robust preplanning

TL;DR: A technique that combines benefits of fast, distributed heuristics and of centralized optimal algorithms is proposed, whenever the topology of the network is deliberately changed, for each possible total cable failure.
Related Papers (5)