Advertisement

Cross-Layer Survivability

Chapter
Part of the Optical Networks book series (OPNW, volume 15)

Abstract

The layered architecture of modern communication networks takes advantage of the flexibility of upper layer technology, such as IP, and the high data rates of lower layer technology, such as WDM. In particular, the WDM technology available today can support up to several terabits per second over a single fiber [9], making networks vulnerable to failures, because a failure for even a short period of time can result in a huge loss of data. The main theme of network survivability is to prevent such data loss by provisioning spare resources for recovery. In this chapter, we focus on the impact of layering on network survivability.

Notes

Acknowledgements

This work was supported by NSF grants CNS-0626781 and CNS-0830961 and by DTRA grants HDTRA1-07-1-0004 and HDTRA-09-1-0050. Hyang-Won Lee was supported in part by the Basic Science Research Program through the National Research Foundation of Korea(NRF) funded by the Ministry of Education, Science and Technology (2012R1A1A1012610).

References

  1. 1.
    Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, NJMATHGoogle Scholar
  2. 2.
    Armitage J, Crochat O, Boudec JYL (1997) Design of a survivable WDM photonic network. In: Proceedings of the sixteenth IEEE International Conference on Computer Communications, Kobe, JapanGoogle Scholar
  3. 3.
    Ball M (1980) Complexity of network reliability computations. Networks 10:153–165MathSciNetMATHCrossRefGoogle Scholar
  4. 4.
    Banerjee D, Mukherjee B (1996) A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE J Sel Area Comm 14(5):903–908CrossRefGoogle Scholar
  5. 5.
    Bertsimas D, Tsitsiklis JN (1997) Introduction to linear optimization. Athena Scientific, Belmont, MassachusettsGoogle Scholar
  6. 6.
    Crochat O, Boudec JYL (1998) Design protection for WDM optical networks. IEEE J Sel Area Comm 16(7):1158–1165Google Scholar
  7. 7.
    Crochat O, Boudec JYL, Gerstel O (2000) Protection interoperability for WDM optical networks. IEEE ACM Trans Netw 8(3):384–395Google Scholar
  8. 8.
    Deng Q, Sasaki G, Su CF (2002) Survivable IP over WDM: a mathematical programming problem formulation. In: Proceedings of the 40th Allerton conference on communication, control and computing, Monticello, ILGoogle Scholar
  9. 9.
    Elhanany I, Kahane M, Sadot D (2001) Packet scheduling in next-generation multiterabit networks. Computer 34(4):104–106CrossRefGoogle Scholar
  10. 10.
    Kan DDJ (2003) Design of survivable IP-over-WDM networks: Providing protection and restoration at the electronic layer. Master’s Thesis, Massachusetts Institute of TechnologyGoogle Scholar
  11. 11.
    Kurant M, Thiran P (2006) Survivable routing in IP-over-WDM networks in the presence of multiple failures. In: EuroNGI workshop on traffic engineering, protection and restoration for NGI, Kraków, PolandGoogle Scholar
  12. 12.
    Kurant M, Thiran P (2007) Survivable routing of mesh topologies in IP-over-WDM networks by recursive graph contraction. IEEE J Sel Area Comm 25(5):922–933. DOI 10.1109/JSAC.2007.070606CrossRefGoogle Scholar
  13. 13.
    Lee K, Lee HW, Modiano E (2010) Reliability in layered networks with random link failures. In: IEEE INFOCOM. San Diego, CAGoogle Scholar
  14. 14.
    Lee K, Modiano E, Lee HW (2011) Cross-layer survivability in WDM-based networks. In: IEEE/ACM Trans. on Networking 19(4):1000–1013Google Scholar
  15. 15.
    Modiano E, Narula-Tam A (2002) Survivable lightpath routing: A new approach to the design of WDM-based networks. IEEE J Sel Area Comm 20(4):800–809CrossRefGoogle Scholar
  16. 16.
    Narula-Tam A, Modiano E, Brzezinski A (2004) Physical topology design for survivable routing of logical rings in wdm-based networks. IEEE J Sel Area Comm 22(8):1525–1583CrossRefGoogle Scholar
  17. 17.
    Raghavan P, Tompson CD (1987) Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7(4):365–374. DOI http://dx.doi.org/10.1007/BF02579324 Google Scholar
  18. 18.
    Todimala A, Ramamurthy B (2004) Survivable virtual topology routing under Shared Risk Link Groups in WDM networks. In: BROADNETS ’04: Proceedings of the first international conference on broadband networks, pp. 130–139. IEEE Computer Society, Washington, DC, USA. DOI http://dx.doi.org/10.1109/BROADNETS.2004.81

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Konkuk UniversitySeoulRepublic of Korea
  2. 2.Google IncCambridgeUSA
  3. 3.Massachusetts Institute of TechnologyLaboratory for Information and Decision SystemsCambridgeUSA

Personalised recommendations