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

Recovery in multilayer optical networks

TL;DR: In this paper, the concepts of recovery mechanisms used in today's multilayer networks where a.o. IP, MPLS and optical technologies are combined are explained. But the focus is on the recovery mechanism.

Spare Capacity Allocation for Non-Linear Link Cost and Failure-Dependent Path Restoration

TL;DR: This paper presents a matrix based model for the NP-complete SCA problem on directed networks and develops an approximation algorithm, termed successive survivable routing (SSR) to include non-linear capacity cost and failure-dependent path restoration.
Journal ArticleDOI

On signaling-free failure dependent restoration in all-optical mesh networks

TL;DR: A new restoration framework that enables all-optical fault management and device configuration via state-of-the-art failure localization techniques, such as the FDP restoration process, can be implemented without relying on any control plane signaling.
Journal ArticleDOI

Quality of service based resource allocation for scheduled lightpath demands

TL;DR: This paper presents a new ILP formulation for routing and wavelength allocation, under the scheduled traffic model that minimizes the congestion of the network, and proposes two levels of service, where idle backup resources can be used to carry low-priority traffic, under fault-free conditions.
Proceedings ArticleDOI

A protocol and simulation for distributed communicating firewalls

TL;DR: A protocol of command and information packets used to take the offensive in the Internet war against hackers and crackers is presented, placed in routers or switches acting as gateways throughout the Internet.
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)