Abstract
p-Cycles are a recently discovered and promising new paradigm for surviv-able networking. p-Cycles simultaneously provide the switching speed and simplicity of rings with the much greater capacity-efficiency and flexibility for reconfiguration of a mesh network. p-Cycles also permit shortest-path routing of working paths (as opposed to ring-constrained working path routing), which adds further to network capacity efficiency. Operationally p-cycles are similar to BLSRs in that, upon failure, switching actions are required at only two nodes and both those nodes are fully pre-planned as to the actions that are required for any failure detected at their sites. With the optimization models in this chapter, entire survivable transport networks can be easily designed with essentially the same spare to working capacity (redundancy) ratios as optimized span-restorable mesh networks. p-Cycles thus bridge the ring versus mesh debate that dominated work in survivable networks through the 1990s and provide the best of both worlds: the efficiency of mesh with the speed of rings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
D. Arci, G. Maier, A. Pattavina, D. Petecchi, and M. Tornatore. Availability models for protection techniques in WDM networks. In Proceedings of the 4th International Workshop on Design of Reliable Communication Networks (DRCN 2003), pages 158–166, Banff, AB, October 2003.
A.Sack and http://netsys.edm.trlabs.cap-cycles W.D. Grover. Trlabs network systems group p-cycles website., June 2005. Online Reference.
P. Batchelor et al. Ultra high capacity optical transmission networks, Final report of action COST 239. Faculty of Electrical Engineering and Computing, Zagreb, Croatia, 1999.
V. Chvátal. Linear Programming. W. H. Freeman and Company, New York, NY, 1983.
M. Clouqueur and W. D. Grover. Availability analysis or span-restorable mesh networks. IEEE Journal on Selected Areas in Communications, 20(4):810–821, May 2002.
M. Clouqueur, W. D. Grover, D. Leung, and O. Shai. Mining the rings: Strategies for ring-to-mesh evolution. In Proceedings 3rd International Workshop on the Design of Reliable Communication Networks (DRCN 2001), pages 113–120, Budapest, Hungary, October 2001.
J. Doucette. Advances on design and analysis of mesh-restorable networks. Master’s thesis, University of Alberta, 2004.
J. Doucette, P. Giese, and W. D. Grover. Investigation of node protection strategies with node-encircling p-cycles. In Design of Reliable Communication Net-works (DRCN 2005), Ischia, Italy, October 2005.
J. Doucette and W. D. Grover. Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks. IEEE Journal on Selected Areas in Communications, 18(10):1912–1923, October 2000.
J. Doucette and W. D. Grover. Comparison of mesh protection and restoration schemes and the dependency on graph connectivity. In Proceedings of 3rd International Workshop on Design of Reliable Communication Networks (DRCN 2001), pages 121–128, Budapest, Hungary, October 2001.
J. Doucette and W. D. Grover. Capacity design studies of span-restorable mesh networks with shared-risk link group (SRLG) effects. In Optical Networking and Communications Conference (OptiComm 2002), pages 25–38, Boston, MA, July/August 2002.
J. Doucette, D. He, W. D. Grover, and O. Yang. Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design. In Proceedings of the 4th International Workshop on Design of Reliable Communication Networks (DRCN 2003), pages 212–220, October 2003.
W. D. Grover. Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking. W. H. Freeman and Company, Upper Saddle River, NJ, 2003.
W. D. Grover. The protected working capacity envelope concept: An alternative paradigm for automated service provisioning. IEEE Communications Magazine, 42(1):62–69, January 2004.
W. D. Grover and J. Doucette. Advances in optical network design with p-cycles: Joint optimization and pre-selection of candidate p-cycles. In Proceedings of the IEEE-LEOS Summer Topical Meeting on All Optical Networking, pages 49–50, Mont Tremblant, QC, July 2002.
W. D. Grover and D. Stamatelakis. Cycle-oriented distributed preconfiguration: Ringlike speed with mesh-like capacity for self-planning network restoration. In Proceedings of IEEE International Conference on Communications (ICC 1998), pages 537–543, Atlanta, GA, June 1998.
W. D. Grover, B. D. Venables, M. H. MacGregor, and J. H. Sandham. Development and performance verification of a distributed asynchronous protocol for real-time network restoration. IEEE Journal on Selected Areas in Communications, 9(1): 112–125, January 1991.
R. R. Iraschko, M. H. MacGregor, and W. D. Grover. Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks. IEEE/ACM Transactions on Networking, 6(3):325–336, June 1998.
J. Kennington, E. Olinick, K. Lewis, A. Ortynski, and G. Spiride. Robust solutions for the DWDM routing and provisioning problem: Models and algorithms. Optical Networks Magazine, 4(2):74–84, March/April 2003.
A. Kodian and W. D. Grover. Failure independent path protecting p-cycles: Efficient and simple fully pre-connected optical path protection, 2005. in press.
A. Kodian, W. D. Grover, J. Slevinsky, and D. Moore. Ring-mining to p-cycles as a target architecture: Riding demand growth into network efficiency. In Proceedings of the 19th Annual National Fiber Optics Engineers Conference (NFOEC 2003), pages 1543–1552, Orlando, FL, September 2003.
D. Leung and W. D. Grover. Capacity planning of survivable mesh-based transport networks under demand uncertainty. Journal of Photonic Network Communications, June 2004a. Submitted.
D. Leung and W. D. Grover. Restorable mesh network design under demand uncertainty: Toward “future proof” transport investments. In Optical Fiber Communication Conference (OFC 2004), Los Angeles, CA, February 2004b.
D. Rajan and A. Atamturk. Survivable network design: Routing of flows and slacks. In G. Anandalingam and S. Raghavan, editors, Telecommunications Network Design and Management, pages 65–82. Kluwer, 2002.
A. Sack. New techniques for p-cycle network design. Master’s thesis, University of Alberta, 2004.
A. Sack and W. D. Grover. Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks. IEEE Network, Special Issue on Protection, Restoration, and Disaster Recovery, 18(2):49–56, March/April 2004.
D. A. Schupke. An ILP for optimal p-cycle selection without cycle enumeration. In Proceedings of the 8th IF1P Working Conference on Optical Network Design and Modelling (ONDM), pages 2761–2765, Ghent, Belgium, February 2004.
D. A. Schupke, W. D. Grover, and M. Clouqueur. Strategies for enhanced dual-failure restorability with static or reconfigurable p-cycle networks. In Proceedings of IEEE International Conference on Communications (ICC 2004), Paris, France, June 2004.
D. A. Schupke, C. G. Gruber, and A. Autenrieth. Optimal configuration of p-cycles in WDM networks. In Proceedings of IEEE International Conference on Communications (ICC 2002), pages 2761–2765, New York, NY, April/May 2002.
G. Shen and W. D. Grover. Exploiting forcer structure to serve uncertain demands and minimize redundancy of p-cycle networks. In Proceedings of 4th SPIE Optical Networking and Communications Conference (OptiComm 2003), pages 59–70, Dallas, TX, October 2003a.
G. Shen and W. D. Grover. Extending the p-cycle concept to path segment protection for span and node failure recovery. IEEE Journal on Selected Areas in Communications, Optical Communications and Networking Series, 21(8): 1306–1319, October 2003b.
G. Shen and W.D. Grover. Design of protected working capacity envelopes based on p-cycles: An alternative framework for survivable automated lightpath provisioning. In A. Girard, B. Sanso, and F. Vazquez-Abad, editors, Performance Evaluation and Planning Methods for the Next Generation Internet, pages 65–82. Kluwer Academic Publishers, 2004.
D. Stamatelakis and W. D. Grover. IP layer restoration and network planning based on virtual protection cycles. IEEE Journal on Selected Areas in Communications, 18(10): 1938–1949, October 2000a.
D. Stamatelakis and W. D. Grover. Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles (“p-cycles”). IEEE Transactions on Communications, 48(8): 1262–1265, August 2000b.
T. Stidsen and T. Thomadsen. Joint optimization of working and p-cycle protection capacity. Technical Report IMM Technical Report 2004-8, Informatics and Mathematics Modelling, Technical University of Denmark, May 2004.
W. L. Winston. Operations research applications and algorithms. Duxbury Press, Belmont, CA, 3rd edition, 1994.
H. Zhang and O. Yang. Finding protection cycles in DWDM networks. In Proceedings of IEEE International Conference on Communications (ICC 2002), volume 5, pages 2756–2760, New York City, NY, April/May 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Grover, W.D. et al. (2006). Design of Survivable Networks Based on p-Cycles. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_16
Download citation
DOI: https://doi.org/10.1007/978-0-387-30165-5_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-30662-9
Online ISBN: 978-0-387-30165-5
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)