Proceedings ArticleDOI
Extending the p-cycle concept to path-segment protection
Wayne D. Grover,Gangxiang Shen +1 more
- Vol. 2, pp 1314-1319
TLDR
This work introduces a significant extension to the p-cycle technique to include path protection or protection of any flow segment along a path as well as the original span protection use of p-cycles, and shows that path-segment-protecting p- cycles have capacity efficiency near that of a path-restorable network.Abstract:
This work introduces a significant extension to the method p-cycles for network protection. The main advance is the generalization of the p-cycle concept to protect multi-span segments of contiguous working flow, not only spans that lie on the cycle or directly straddle the p-cycle. This effectively extends the p-cycle technique to include path protection or protection of any flow segment along a path as well as the original span protection use of p-cycles. It also gives an inherent means of transit flow protection against node loss. We develop a capacity optimization model for the new scheme and compare it to prior p-cycle designs and other types of efficient mesh-survivable networks. Results show that path-segment-protecting p-cycles have capacity efficiency near that of a path-restorable network is to suggest the use of flow p-cycles to protect transparent optical express flows through a regional network.read more
Citations
More filters
Journal ArticleDOI
Novel algorithms for shared segment protection
TL;DR: A fast heuristic algorithm based on dynamic programming to obtain a near-optimal set of segments to protect a given active path and can achieve a bandwidth efficiency as high as some best-performing shared path Protection schemes and, at the same time, much faster recovery than these shared path protection schemes.
Patent
Segment protection scheme for a network
TL;DR: In this article, the authors proposed a segment protection scheme called PROMISE (Protection using MultIple Segments), which combines the best of existing link and path protection schemes (e.g., bandwidth efficiency and fast recovery).
Journal ArticleDOI
Distributed Protocol for Removal of Loop Backs with Asymmetric Digraph Using GMPLS in P-Cycle Based Optical Networks
TL;DR: A novel removal of loop back approach with standard protocol extension to solve the resource inefficiency issue due to long restored paths for symmetric dynamic networks and the basic idea of traffic splitting strategy in the unidirectional resource distribution is described.
Journal ArticleDOI
Automatic protection switching for p-cycles in WDM networks
TL;DR: This work proposes and evaluates a protocol enhancement to provide means for node failure protection and describes an integer linear program, which is applied to network design case studies, and formulate availability models for p-cycles.
Proceedings ArticleDOI
A new approach to node-failure protection with span-protecting p-cycles
TL;DR: A generalization of how nodes in a BLSR-ring or p-cycle derive survivability through loop-back at the nearest two neighbour-nodes on the same ring shows that the transiting path affected by the node failure is inherently restorable by ordinary p- cycle switching actions whether the respective two-hop segment is on-cycle, straddling, or partially on- cycle and partially straddle.
References
More filters
Proceedings ArticleDOI
Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration
TL;DR: It is shown that through a strategy of pre-failure cross-connection between the spare links of a mesh network, it is possible to achieve 100% restoration with little, if any, additional spare capacity than in aMesh network.
Journal ArticleDOI
A Wavelength-Convertible Optical Network
Kuo-chun Lee,Victor O. K. Li +1 more
TL;DR: In this paper, a heuristic algorithm for dynamic routing is used to reduce the number of converters in a share-per-node or the shareper-link wavelength-convertible switch.
Journal ArticleDOI
Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks
TL;DR: 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.
Journal ArticleDOI
Protection cycles in mesh WDM networks
TL;DR: This paper proposes a methodology for performing automatic protection switching (APS) in optical networks with arbitrary mesh topologies in order to protect the network from fiber link failures.
Proceedings ArticleDOI
Optimal configuration of p-cycles in WDM networks
TL;DR: This work develops optimization models for the configuration of the cycles and applies them on a case study for a pan-European network, showing that p-cycles achieve high efficiency.
Related Papers (5)
Extending the p-cycle concept to path segment protection for span and node failure recovery
Gangxiang Shen,Wayne D. Grover +1 more