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

Traffic engineering with OSPF-TE and RSVP-TE: Flooding reduction techniques and evaluation of processing cost

TL;DR: This paper considers two important aspects related to the control plane of Traffic Engineered IP/MPLS networks: the ''flooding reduction'' mechanisms and the evaluation of processing cost for signaling and routing protocols.
Proceedings ArticleDOI

Resource Requirements for Reliable Service Function Chaining

TL;DR: This work studies the problem of deploying reliable Service Function Chains over a virtualized network function architecture, and investigates two different protection mechanisms and develops a scalable exact mathematical model using column generation.
Journal ArticleDOI

Distributed restoration in optical networks using feed-forward neural networks

TL;DR: A new method is proposed for determining protection paths in an optical network where users have different characteristics in terms of reliability needs and security restrictions, and extracts protection routes and optimum flow values from a previously trained feed-forward neural network distributed over the optical data communications network.
Journal ArticleDOI

Virtual Infrastructure Design for Surviving Physical Link Failures

TL;DR: A novel VI node migration protection-based algorithm (MP-SVIMA) to minimize the computing and communication resource costs and takes advantage of the flexibility in where VI nodes are mapped in the substrate by migrating a VI node from the originally mapped physical location to a different location after a physical link fails.
Proceedings ArticleDOI

OPN09-02: Lightpath Scheduling and Allocation Under a Flexible Scheduled Traffic Model

TL;DR: In this article, an ILP formulation for the more general flexible window scheduled traffic model, where the setup and teardown times may vary within a specified range, is presented, which jointly optimizes the problem of scheduling the demands and allocating resources for the primary and backup lightpaths.
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)