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
Book
Routing, Flow, And Capacity Design In Communication And Computer Networks
Michal Pioro,Deepankar Medhi +1 more
TL;DR: Throughout, the authors focus on the traffic demands encountered in the real world of network design, and their generic approach allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network.
Journal ArticleDOI
Approximating optimal spare capacity allocation by successive survivable routing
TL;DR: Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.
Journal ArticleDOI
Optical layer survivability-an implementation perspective
Ori Gerstel,Rajiv Ramaswami +1 more
TL;DR: The factors that affect the complexity of optical protection schemes, such as supporting mesh instead of ring protection, handling low-priority traffic, and dealing with multiple types of failures are discussed.
Journal ArticleDOI
Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints
TL;DR: This study addresses the routing and wavelength-assignment problem in a network with path protection under duct-layer constraints in a wavelength-division multiplexing (WDM) network in which failures occur due to fiber cuts.
Proceedings ArticleDOI
Approximating optimal spare capacity allocation by successive survivable routing
TL;DR: Numerical results comparing several SCA algorithms show that SSR has the best trade-off between solution optimality and computation speed.
References
More filters
Proceedings ArticleDOI
FITNESS-failure immunization technology for network services survivability
C.H. Yang,S. Hasegawa +1 more
TL;DR: Failure immunization technology for network service survivability (FITNESS) is proposed method to restore fiber networks in a distributed fashion using broadband digital cross-connect systems (B-DCS) in a synchronous optical network (SONET).
Journal ArticleDOI
Using distributed topology update and preplanned configurations to achieve trunk network survivability
TL;DR: The authors present a new approach for trunk network survivability intended for a telephone trunk network consisting of high-bandwidth fiber-optic links connected through reconfigurable digital cross-connect nodes that works for both node and link failures.
Proceedings ArticleDOI
An optimal spare-capacity assignment model for survivable networks with hop limits
M. Herzberg,S.J. Bye +1 more
TL;DR: A new algorithm for spare-capacity assignment in survivable networks which use cross-connect systems as transmission hubs is presented, aimed at tightening the rounded-up assignment to a practical optimal solution which also supplies optimal restoration routes and capacities.
Proceedings ArticleDOI
Optimal capacity placement for path restoration in mesh survivable networks
TL;DR: A method for capacity optimization of path restorable networks and the capacity benefits of path over span restoration are provided and the further benefits of jointly optimizing working path routing and spare capacity placement in path Restorable networks are quantified by extending the capacity optimization method presented.
Journal ArticleDOI
Comparison of capacity efficiency of DCS network restoration routing techniques
Robert Doverspike,Brian Wilson +1 more
TL;DR: It is found that the efficiency advantage of point-to-point methods over patch methods is greater for link failure than for node failure, and the difference was not statistically significant in low levels of network congestion and became more significant as network congestion increased.