Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
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
Proceedings ArticleDOI
Joint working and spare capacity design of node-inclusive span-restorable optical networks
TL;DR: In this paper, a joint working and spare capacity network design model for node-inclusive span restoration is developed, which provides node-failure restorability and capacity efficiency close to that of path restoration.
Proceedings Article
Virtual topology design for flexible periodic traffic demands
TL;DR: In this paper, an integer linear program (ILP) formulation is presented for designing an optimal, stable virtual topology for time-varying traffic demands, where the exact start and end times of the demands are not known beforehand but can slide within a larger time window.
Proceedings ArticleDOI
The design, implementation and performance analysis of transport-MPLS network
TL;DR: This paper first design the functional architecture and interface of T-MPLS network, then a novel simulation test bed based on 11-node topology of European Cost239 model is implemented and most of protocols are realized and the characteristics of packet transport network are verified via numerical simulation.
Book ChapterDOI
An optimization algorithm of spare capacity allocation by dynamic survivable routing
TL;DR: A dynamic survivable routing (DSR) algorithm using the chaotic optimization theory is proposed to solve the spare capacity allocation problem of MPLS networks and numerical results show that DSR has the satisfying QoS performances.
Posted Content
Self-healing systems and virtual structures
TL;DR: This paper discusses the self-healing model for dynamic reconfigurable systems, in which an omniscient adversary inserts or deletes nodes from a network and the algorithm responds by adding a limited number of edges in order to maintain invariants of the network.
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.