Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
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 Article
Modeling and simulation of mesh networks with path protection and restoration
Hassan Naser,Hussein T. Mouftah +1 more
TL;DR: In this paper, the authors present a modeling and simulation methodology to analyze the availability performance of demands when carried over mesh-based transport networks with path (end-to-end) protection and restoration schemes.
Layered optical networks : implications to switching and transmission
TL;DR: With the aim of supporting and enhancing high-capacitycommunication networks, such as telephony, Internet and others, this work has investigated:· transmission gains with time-slotted optical communication networks.
Proceedings ArticleDOI
Comparing restoration concepts using optimal network configurations with integrated hardware and routing decisions
TL;DR: In this paper, the authors investigated the impact of link and path restoration on the cost of telecommunication networks and showed that the cost for an optimal network configuration is almost independent of the restoration concept if (i) the installation of network elements (ADMs, DXCs, or routers) and interface cards, (ii) link capacities, and (iii) working and restoration routings are simultaneously optimized.
Proceedings ArticleDOI
Compact routing messages in self-healing trees
TL;DR: The first self-healing compact routing scheme for low memory nodes was proposed in this paper, where nodes need only O(log 2n) memory and can recover from each attack in O(1) time and Δ messages.
Proceedings ArticleDOI
On-line routing of MPLS tunnels with time-varying bandwidth profiles
Fabio Ricciato,Ugo Monaco +1 more
TL;DR: The paper shows that the a priori knowledge of the per-demand traffic profiles, still within a fixed routing framework, can be exploited to achieve a sensible bandwidth saving, and/or to differentiate bandwidth provisioning on a per-hour basis.
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.