Abstract
We consider the problem of designing a network of optical cross-connects (OXCs) which provides end-to-end lightpath services to large numbers of client nodes, under the requirement that the network will survive any single-link failure. Our main objective is to quantify the additional resource requirements of implementing path protection schemes over a network with no survivability properties. To this end, we present heuristic routing and wavelength assignment algorithms for dedicated path protection and two variants of shared path protection, and integrate them into the physical and logical topology design framework we developed in an earlier study. We apply our heuristics to networks with up to 1000 client nodes, with a number of lightpaths that is an order of magnitude greater than the number of clients, and for a wide range of values for system parameters such as the number of wavelengths per fiber, the number of optical transceivers per client node, and the number of ports per OXC. Our results provide insight into the relative resource requirements of dedicated and shared path protection schemes. We also find that, using shared path protection schemes, it is possible to build cost-effective survivable networks that provide rich connectivity among client nodes with only a modest additional amount of resources over a network with no survivability properties.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. F. Fonseca, Pan-European multi-wavelength transport network network design, architecture, survivability and SDH networking, in: DRCN'98, (1998) p. P3.
D. Zhou, S. Subramaniam, Survivability in optical networks, IEEE Network, vol. 14, no. 6, (November/December 2000), pp. 16–23.
G. Mohan, C. Siva Ram Murthy, Ligthpath restoration in WDM optical networks, IEEE Network, vol. 14, no. 6, (November/December 2000), pp. 24–32.
G. Ellinas, R. G. Hailemarian, T. E. Stern, Protection cycles in mesh WDM networks, IEEE Journal on Selected Areas in Communications, vol. 18, (October 2000), pp. 1924–1937.
W. D. Grover, D. Stamatelakis, Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network reconfiguration, in IEEE ICC'98, (1998) pp. 537–543.
M. Medard, R. A. Barry, S. G. Finn, W. He, S. S. Lumetta, Generalized loop-back recovery in optical mesh networks, IEEE/ACM Transactions on Networking, vol. 10, no. 1, (February 2002) pp. 153–164.
O. Gerstel, R. Ramaswami, Optical layer survivability—an implementation perspective, IEEE Journal on Selected Areas in Communications, vol. 18, no. 10, (October 2000), pp. 1885–1899.
O. Crochat, J. L. Boudec, O. Gerstel, Protection interoperability for WDM optical networks, IEEE/ACM Transactions on Networking, vol. 8, no. 3, (June 2000), pp. 384–395.
A. Fumagalli, L. Valcarenghi, IP restoration vs. WDM protection: Is there an optimal choice, IEEE Network Magazine, (November/December 2000), pp. 34–41.
L. Sahasrabuddhe, S. Ramamurthy, B. Mukherjee, Fault management in IP-over-WDM networks: WDM protection vs. IP restoration, IEEE Journal on Selected Areas in Communications, vol. 20, no. 1, (January 2002), pp. 21–33.
J. Doucette, W. D. Grover, Comparison of mesh protection and restoration schemes and the dependency on graph connectivity, in: DRCN'2001, (2001), pp. 1–9.
V. Anand, C. Qiao, Static versus dynamic establishment of protection paths in WDM networks, Journal of High Speed Networks, vol. 10, no. 4, (2001), pp. 317–327.
M. Lee, J. Yu, Y. Kim, Jinwoo Park, A restoration method independent of failure location in all-optical networks, Computer Communications, vol. 25, no. 10, (June 2002), pp. 915–921.
S. Ramamurthy, L. Sahasrabuddhe, B. Mukherjee, Survivable WDM mesh networks, Journal of Lightwave Technology, vol. 21, no. 4, (April 2003), pp. 870–883.
K. Zhu, L. Sahasrabuddhe, B. Mukherjee, Topology design and upgrade of an optical network by bottleneck-cut identification, Journal of High Speed Networks, vol. 10, no. 4, (2001), pp. 293–301.
B. T. Doshi, S. Dravida, P. Harshavardhana, O. Hauser, Y. Wang, Optical network design and restoration, Bell Labs Technical Journal, (January–March 1999), pp. 58–84.
R. Bhandari, Survivable networks: Algorithms for diverse routing, (Kluwer, USA, 1999).
T. Eilam-Tzoreff, The disjoint shortest paths problem, Discrete Applied Mathematics, vol. 85, (October 1998), pp. 113–138.
F. Guerriero, R. Musmanno, Label correction methods to solve multicriteria shortest path problems, Journal of Optimization Theory and Applications, vol. 111, no. 3, (December 2001), pp. 589–613.
J. Vygen, NP-completeness of some edge-disjoint paths problems, Discrete Applied Mathematics, vol. 61, (1995), pp. 83–90.
Y. Xin, G. N. Rouskas, H. G. Perros, Physical and logical topology design of large-scale optical networks, IEEE/OSA Journal of Lightwave Technology, vol. 21, no. 4, (April 2003), pp. 904–915.
Z. Zhang, A. Acampora, A heuristic wavelength assignment algorithm for multihop WDM networks with wavelength routing and wavelength reuse, IEEE/ACM Transactions on Networking, vol. 3, no. 3, (June 1995), pp. 281–288.
Y. Xin, Topology Design of Large-Scale Optical Networks, Ph.D. thesis, North Carolina State University, Raleigh, NC (August 2002).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Xin, Y., Rouskas, G.N. A Study of Path Protection in Large-Scale Optical Networks. Photonic Network Communications 7, 267–278 (2004). https://doi.org/10.1023/B:PNET.0000026891.50610.48
Issue Date:
DOI: https://doi.org/10.1023/B:PNET.0000026891.50610.48