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
Lightpath routing and capacity assignment for survivable IP-over-WDM networks
TL;DR: It is shown that poor routings can lead to significant increase in spare capacity requirements and new metrics for assessing the survivability of different lightpath routings are developed to develop joint lightpath routing and capacity assignment algorithms.
Proceedings ArticleDOI
The forgiving tree: a self-healing distributed data structure
TL;DR: This work considers the problem of self-healing in peer-to-peer networks that are under repeated attack by an omniscient adversary, and presents a distributed data structure that ensures two key properties.
Journal ArticleDOI
Capacity Planning of Survivable Mesh-based Transport Networks under Demand Uncertainty
Dion Leung,Wayne D. Grover +1 more
TL;DR: This approach considers both the cost of initial design construction and the expected cost of possible augmentations or “recourse” actions required in the future, adapting the network to accommodate different actual future demands.
Local and global restoration of node and link failures in telecommunication networks
TL;DR: A Mixed Integer Programming model is presented which takes into account restoration requirements as well as hardware constraints and which abstracts from a particular restoration protocol and failure situation, which provides new insight into the structure of the network restoration problem and shows that from a mathematical point of view, the commonly used restoration techniques Link Restoration, Path Restoration and Reservation are not as different as they seem to be from a practical point of sight.
Proceedings ArticleDOI
Successive survivable routing for node failures
Yu Liu,David Tipper +1 more
TL;DR: A novel matrix formulation of the arc-flow SCA node failure model, where working paths are given before pre-planned backup paths are routed and reserved, and successive survivable routing is extended to solve the above SCA model.
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.