Skip to main content
SpringerLink
Log in

Failure Restoration Approaches

  • Chapter
  • First Online:
Internet Optical Infrastructure

Abstract

This chapter is on enumerating dynamic survivable routing schemes in mesh optical networks. By taking dynamic connection requests that arrive one after the other without any knowledge of future arrivals, the survivable routing schemes are required to allocate a disjoint working and protection path-pair for each connection request according to the current link-state. Without loss of generality, a working or a protection path is taken as a lightpath, either with a single wavelength if it is in a WDM network, or with some bandwidth allocated if it is in a spectrum-sliced elastic optical network supported by the optical orthogonal frequency division multiplexed technology.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ahlswede R, Cai N, Li S, Yeung R (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204–1216

    Article  MATH  MathSciNet  Google Scholar 

  2. Andersen R, Chung F, Sen A, Xue G (2004) On disjoint path pairs with wavelength continuity constraint in wdm networks. In: Proceedings of the twenty-third annual joint conference of the IEEE computer and communications societies (INFOCOM), vol 1. IEEE, Hong Kong, China

    Google Scholar 

  3. Babarczi P, Tapolcai J, Ho PH, Médard M (2012) Optimal dedicated protection approach to shared risk link group failures using network coding. In: Proceedings of the IEEE international conference on communications (ICC), pp 3051–3055

    Google Scholar 

  4. Babarczi P, Biczók G, Overby H, Tapolcai J, Soproni P (2013) Realization strategies of dedicated path protection: a bandwidth cost perspective. Elsevier Comput Netw 57(9):1974–1990

    Article  Google Scholar 

  5. Belzner M, Haunstein H (2009) Performance of network coding in transport networks with traffic protection. In: Proceedings of the ITG symposium on photonic networks. VDE, Vienna, Austria, pp 1–7

    Google Scholar 

  6. Bouillet E, Labourdette JF, Ellinas G, Ramamurthy R, Chaudhuri S (2002) Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures. In: Proceedings of the twenty-first annual joint conference of the IEEE computer and communications societies (INFOCOM), vol 2. IEEE, New York, USA, pp 801–807

    Google Scholar 

  7. Choi H, Subramaniam S, Choi H (2004) Loopback recovery from double-link failures in optical mesh networks. IEEE/ACM Trans Netw 12(6):1119–1130

    Article  Google Scholar 

  8. Doucette J, He D, Grover WD, Yang O (2003) Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design. In: Proceedings of the fourth international workshop on design of reliable communication networks (DRCN). IEEE, Banff, Alberta, Canada, pp 212–220

    Google Scholar 

  9. Ellinas G, Stern TE (1996) Automatic protection switching for link failures in optical networks with bi-directional links. In: Proceedings of the global telecommunications conference (GLOBECOM), communications: the key to global prosperity, vol 1. IEEE, London, UK, pp 152–156

    Google Scholar 

  10. Ellinas G, Hailemariam AG, Stern TE (2000) Protection cycles in mesh wdm networks. IEEE J Sel Areas Commun 18(10):1924–1937

    Article  Google Scholar 

  11. Ellinas G, Bouillet E, Ramamurthy R, Labourdette JF, Chaudhuri S, Bala K (2003) Routing and restoration architectures in mesh optical networks. Opt Netw Mag 4(1):91–106

    Google Scholar 

  12. Frederick M, Datta P, Somani A (2006) Sub-graph routing: a generalized fault-tolerant strategy for link failures in wdm optical networks. Elsevier Comput Netw 50(2):181–199

    Article  MATH  Google Scholar 

  13. Grover WD (2003) Mesh-based survivable networks: options and strategies for optical, MPLS, SONET and ATM networking. Prentice Hall PTR, Upper Saddle River

    Google Scholar 

  14. Grover WD, Doucette J (2002) Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles. In: Proceedings of the existing and emerging architecture and applications/dynamic enablers of next-generation optical communications systems/fast optical processing in optical transmission/VCSEL and all-optical networking. IEEE, IEEE-LEOS Summer Tropical Meetings, Mont Tremblant, Quebec, Canada, pp WA2–WA49

    Google Scholar 

  15. Grover WD, Stamatelakis D (1998) Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. In: Proceedings of the international conference on communications (ICC), vol 1. IEEE, Atlanta, Georgia, USA, pp 537–543

    Google Scholar 

  16. Grover W, Doucette J, Clouqueur M, Leung D, Stamatelakis D (2002) New options and insights for survivable transport networks. IEEE Commun Mag 40(1):34–41

    Article  Google Scholar 

  17. Herzberg M, Bye SJ (1994) An optimal spare-capacity assignment model for survivable networks with hop limits. In: Proceedings of the global telecommunications conference (GLOBECOM), communications: the global bridge, vol 3. IEEE, San Francisco, California, USA, pp 1601–1606

    Google Scholar 

  18. Ho PH, Mouftah H (2001) Issues on diverse routing for wdm mesh networks with survivability. In: Proceedings of the tenth international conference on computer communications and networks (ICCCN). IEEE, Scottsdale, Arizona, USA, pp 61–66

    Google Scholar 

  19. Ho PH, Mouftah HT (2002) A framework for service-guaranteed shared protection in wdm mesh networks. IEEE Commun Mag 40(2):97–103

    Article  MATH  Google Scholar 

  20. Ho PH, Mouftah HT (2004) A novel survivable routing algorithm for shared segment protection in mesh wdm networks with partial wavelength conversion. IEEE J Sel Areas Commun 22(8):1548–1560

    Article  Google Scholar 

  21. Ho PH, Tapolcai J, Cinkler T (2004) Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels. IEEE/ACM Trans Netw 12(6):1105–1118

    Article  Google Scholar 

  22. Ho PH, Tapolcai J, Mouftah HT (2004) On achieving optimal survivable routing for shared protection in survivable next-generation internet. IEEE Trans Reliab 53(2):216–225

    Article  Google Scholar 

  23. Hu JQ (2003) Diverse routing in optical mesh networks. IEEE Trans Commun 51(3):489–494

    Article  Google Scholar 

  24. Iraschko RR, MacGregor M, Grover WD (1998) Optimal capacity placement for path restoration in STM or ATN mesh-survivable networks. IEEE/ACM Trans Netw 6(3):325–336

    Article  Google Scholar 

  25. Kodialam M, Lakshman T (2001) Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information. In: Proceedings of the twentieth annual joint conference of the IEEE computer and communications societies (INFOCOM), vol 1. IEEE, Anchorage, Alaska, USA, pp 376–385

    Google Scholar 

  26. Li CL, McCormick S, Simchi-Levi D (1990) The complexity of finding two disjoint paths with min-max objective function. Discrete Appl Math 26(1):105–115. http://dx.doi.org/10.1016/0166-218X(90)90024-7. http://www.sciencedirect.com/science/article/pii/0166218X90900247

  27. Liu C, Ruan L (2004) Finding good candidate cycles for efficient p-cycle network design. In: Proceedings of the 13th international conference on computer communications and networks (ICCCN). IEEE, Chicago, IL, USA, pp 321–326

    Google Scholar 

  28. Liu Y, Tipper D, Siripongwutikorn P (2005) Approximating optimal spare capacity allocation by successive survivable routing. IEEE/ACM Trans Netw 13(1):198–211

    Article  Google Scholar 

  29. Nguyen HN, Habibi D, Phung VQ, Lachowicz S, Lo K, Kang B (2006) Qrp02-5: joint optimization in capacity design of networks with p-cycle using the fundamental cycle set. In: Proceedings of the global telecommunications conference (GLOBECOM). IEEE, San Francisco, California, USA, pp 1–5

    Google Scholar 

  30. Øverby H (2006) Cost evaluations of the protected network layer packet redundancy scheme. J Opt Netw 5(10):747–763

    Article  Google Scholar 

  31. Pióro M, Medhi D (2004) Routing, flow, and capacity design in communication and computer networks. The Morgan Kaufmann series in networking, Morgan Kaufmann Publishers/Elsevier

    MATH  Google Scholar 

  32. Qiao C, Yoo M (1999) Optical burst switching (obs)—a new paradigm for an optical internetˆ{1}. J High Speed Netw 8(1):69–84

    Google Scholar 

  33. Ramamurthy S, Mukherjee B (1999) Survivable wdm mesh networks. II. Restoration. In: Proceedings of the IEEE international conference on communications (ICC), vol 3. IEEE, Vancouver, British Columbia, Canada, pp 2023–2030

    Google Scholar 

  34. Ramasubramanian S, Harjani A (2006) Comparison of failure dependent protection strategies in optical networks. Photonic Netw Commun 12(2):195–210

    Article  Google Scholar 

  35. Saradhi CV, Murthy CSR (2002) Dynamic establishment of segmented protection paths in single and multi-fiber wdm mesh networks. In: The convergence of information technologies and communications. International Society for Optics and Photonics, Boston, MA, USA, pp 211–222

    Google Scholar 

  36. Schupke D (2004) An ilp for optimal p-cycle selection without cycle enumeration. In: Proceedings of the eighth working conference on optical network design and modelling

    Google Scholar 

  37. Stamatelakis D, Grover WD (2000) Network restorability design using pre-configured trees, cycles, and mixtures of pattern types. TRLabs, Edmonton. Tech. Rep. TR-1999-05

    Google Scholar 

  38. Su X, Su CF (2001) An online distributed protection algorithm in wdm networks. In: Proceedings of the IEEE international conference on communications (ICC), vol 5. IEEE, Helsinki, Finland, pp 1571–1575

    Google Scholar 

  39. Suurballe JW, Tarjan RE (1984) A quick method for finding shortest pairs of disjoint paths. Networks 14(2):325–336

    Article  MATH  MathSciNet  Google Scholar 

  40. Thomassen C (1997) On the complexity of finding a minimum cycle cover of a graph. SIAM J Comput 26(3):675–677

    Article  MATH  MathSciNet  Google Scholar 

  41. Wang D, Li G (2008) Efficient distributed bandwidth management for mpls fast reroute. IEEE/ACM Trans Netw 16(2):486–495

    Article  Google Scholar 

  42. Wang H, Modiano E, Médard M (2002) Partial path protection for wdm networks: end-to-end recovery using local failure information. In: Proceedings of the seventh international symposium on computers and communications (ISCC). IEEE, Taormina, Italy, pp 719–725

    Google Scholar 

  43. Wasem OJ (1991) An algorithm for designing rings for survivable fiber networks. IEEE Trans Reliab 40(4):428–432

    Article  MATH  Google Scholar 

  44. Wasem OJ (1991) Optimal topologies for survivable fiber optic networks using sonet self-healing rings. In: Proceedings of the global telecommunications conference (GLOBECOM), countdown to the new millennium. Featuring a mini-theme on: personal communications services. IEEE, Phoenix, Arizona, USA, pp 2032–2038

    Google Scholar 

  45. Wu B, Yeung K, Ho PH (2010) Ilp formulations for p-cycle design without candidate cycle enumeration. IEEE/ACM Trans Netw 18(1):284–295

    Article  Google Scholar 

  46. Xin C, Ye Y, Dixit S, Qiao C (2001) Joint lightpath routing approach in survivable optical networks. In: Proceedings of the Asia-Pacific optical and wireless communications conference and exhibit. International Society for Optics and Photonics, Beijing, China, pp 139–146

    Google Scholar 

  47. Xiong Y, Mason LG (1999) Restoration strategies and spare capacity requirements in self-healing atm networks. IEEE/ACM Trans Netw 7(1):98–110

    Article  Google Scholar 

  48. Xu D, Qiao C, Xiong Y (2002) An ultra-fast shared path protection scheme-distributed partial information management, part ii. In: Proceedings of the 10th IEEE international conference on network protocols (ICNP). IEEE, Paris, France, pp 344–353

    Google Scholar 

  49. Xu D, Xiong Y, Qiao C (2003) Protection with multi-segments (promise) in networks with shared risk link groups (srlg). In: Proceedings of the annual Allerton conference on communication control and computing, 1998, vol 40. The University, IEEE/ACM Transaction on Networking, 11(2):248–258

    Google Scholar 

  50. Xu D, Chen Y, Xiong Y, Qiao C, He X (2006) On the complexity of and algorithms for finding the shortest path with a disjoint counterpart. IEEE/ACM Trans Netw 14(1):147–158

    Article  Google Scholar 

  51. Yuan S, Jue JP et al (2002) Shared protection routing algorithm for optical network. Opt Netw Mag 3(3):32–39

    Google Scholar 

  52. Zhang H, Yang O (2002) Finding protection cycles in dwdm networks. In: International conference on network protocols IEEE international conference on communications (ICC), vol 5. IEEE, New York, USA, pp 2756–2760

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Budapest University of Technology and Economics, Budapest, Hungary

    János Tapolcai & Péter Babarczi

  2. University of Waterloo, Waterloo, Canada

    Pin-Han Ho

  3. Institute for Computer Science and Control, Budapest University of Technology and Economics, Budapest, Hungary

    Lajos Rónyai

Authors
  1. János Tapolcai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pin-Han Ho
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Péter Babarczi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Lajos Rónyai
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this chapter

Cite this chapter

Tapolcai, J., Ho, PH., Babarczi, P., Rónyai, L. (2015). Failure Restoration Approaches. In: Internet Optical Infrastructure. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-7738-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4614-7738-9_2

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4614-7737-2

  • Online ISBN: 978-1-4614-7738-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation