Skip to main content
SpringerLink
Log in

Network Survivability: End-to-End Recovery Using Local Failure Information

  • Chapter
  • First Online:
Graphs and Algorithms in Communication Networks

Part of the book series: Texts in Theoretical Computer Science. An EATCS Series ((TTCS))

Abstract

This chapter presents an advanced shared protection approach called Failure Dependent Path Protection (FDPP). Under this approach, several protection paths can be assigned to connections in the context of a shared protection framework. After formalizing the survivable online routing problem, two possible implementations are compared, one based on heuristics and the other on ILP. Building upon the concepts of routing already exposed, the chapter then presents two case studies. The first one employs Shortcut Span Protection to examine how different protection strategies affect resource provisioning, while the second is a thorough analysis of the performance of path protection in terms of connection availability, both for dedicated and shared path protection in heterogeneous network topologies.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andersen, R., Chung, F., Sen, A., Xue, G.: On disjoint path pairs with wavelength continuity constraint in WDM networks. In: INFOCOM (2004)

    Google Scholar 

  2. Autenrieth, A., Kirstädter, A.: Engineering end-to-end ip resilience using resilience-differentiated QoS. IEEE Communications Magazine 40(1), 50–57 (2002). DOI 10.1109/35.978049

    Article  Google Scholar 

  3. Batchelor, P., Daino, B., Heinzmann, P., Hjelme, D., Inkret, R., Jager, H., Joindot, M., Kuchar, A., Coquil, E., Leuthold, P., Marchis, G., Matera, F., Mikac, B., Nolting, H. P., Spath, J., Tillerot, F., Caenegem, B., Wauters, N., Weinert, C.: Study on the implementation of optical transparent transport networks in the european environment-results of the research project cost 239. Photonic Network Communications 2, 15–32(18) (March 2000)

    Google Scholar 

  4. Berger, L., Bryskin, I., Papadimitriou, D., Farrel, A.: GMPLS segment recovery. IETF RFC 4873 (2007)

    Google Scholar 

  5. Chołda, P.: The Reliability Analysis of Recovery Procedures in GMPLS-based Optical IP Networks. Ph.D. thesis, AGH University of Science and Technology, Kraków, Poland (2005). http://kt.agh.edu.pl/cholda/Papers/PhD.pdf. Submitted

  6. Cholda, P., Mykkeltveit, A., Helvik, B., Wittner, O., Jajszczyk, A.: A survey of resilience differentiation frameworks in communication networks. Communications Surveys and Tutorials, IEEE 9(4), 32–55 (2007). DOI 10.1109/COMST.2007.4444749

    Article  Google Scholar 

  7. Doucette, J., Grover, W. D.: Comparison of mesh protection and restoration schemes and the dependency on graph connectivity. In: Design of Reliable Communication Networks, pp. 121–128 (2001)

    Google Scholar 

  8. Doucette, J., He, D., Grover, W., Yang, O.: Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design. Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings. Fourth International Workshop on pp. 212–220 (2003). DOI 10.1109/DRCN.2003.1275359

    Google Scholar 

  9. Ellinas, G., Bouillet, E., Ramamurthy, R., Labourdette, J. F., Chaudhuri, S., Bala, K.: Routing and restoration architectures in mesh optical networks. Optical Networks Magazine pp. 91–106 (2003)

    Google Scholar 

  10. Feldman, J., Ruhl, M.: The directed steiner network problem is tractable for a constant number of terminals. In: Proc. 40th annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 299–308 (1999)

    Google Scholar 

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

    Article  Google Scholar 

  12. Gummadi, K. P., Pradeep, M. J., Murthy, C. S. R.: An efficient primary-segmented backup scheme for dependable real-time communication in multihop networks. IEEE/ACM Transactions on Networking 11(1), 81–94 (2003)

    Article  Google Scholar 

  13. Haider, A., Harris, R.: Recovery techniques in next generation networks. Communications Surveys and Tutorials, IEEE 9(3), 2–17 (2007). DOI 10.1109/COMST.2007.4317617

    Article  Google Scholar 

  14. Ho, P. H., Tapolcai, J., Mouftah, H. T.: On optimal diverse routing for shared protection in mesh WDM networks. IEEE Transactions on Reliability 53(6), 2216–225 (2004)

    Google Scholar 

  15. Hu, J. Q.: Diverse routing in optical mesh networks. IEEE Transactions on Communications 51, 489–494 (2003)

    Article  Google Scholar 

  16. Hülsermann, R., Jäger, M., Koster, A., Orlowski, S., Wessäly, R., Zymolka, A.: Availability and cost based evaluation of demand-wise shared protection. In: 7th ITG-Workshop on Photonic Networks, Leipzig, Germany, pp. 161–168. VDE Verlag GmbH (2006)

    Google Scholar 

  17. Iraschko, R. R., Grover, W. D.: A highly efficient path-restoration protocol for management of optical network transport integrity. IEEE Journal on Selected Areas in Communications (JSAC) 18(5), 779–794 (2000)

    Article  Google Scholar 

  18. Jäger, M., R. Hüelsermann, D. A. S., Sedlak, R.: Evaluation of novel resilience schemes in dynamic optical transport networks. In: Proc. APOC (2002)

    Google Scholar 

  19. Laborczi, P., Tapolcai, J., Ho, P. H., Cinkler, T., Recski, A., Mouftah, H. T.: Algorithms for asymmetrically weighted pair of disjoint paths in survivable networks. In: Design of Reliable Communication Networks, pp. 220–227 (2001)

    Google Scholar 

  20. Lai, W., McDysan, D.: Network hierarchy and multilayer survivability. IETF RFC 3386 (2002)

    Google Scholar 

  21. Liu, Y., Tipper, D.: Spare capacity allocation for non-linear link cost and failure-dependent path restoration. In: Design of Reliable Communication Networks, pp. – (2001)

    Google Scholar 

  22. Liu, Y., Tipper, D., Siripongwutikorn, P.: Approximating optimal spare capacity allocation by successive survivable routing. In: INFOCOM, pp. 699–708. Anchorage, Alaska (2001)

    Google Scholar 

  23. Mohan, G., Murthy, C. S. R.: Lightpath restoration in WDM optical networks. IEEE Network 14(6), 24–32 (2000)

    Article  Google Scholar 

  24. Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0–Survivable Network Design Library. In: Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium (2007)

    Google Scholar 

  25. Ou, C. S., Zang, H., Mukherjee, B.: Sub-Path Protection for Scalability and Fast Recovery in WDM Mesh Networks. In: Proc. Optical Fiber Communications Conference (OFC), p. ThO6 (2002)

    Google Scholar 

  26. Pan, P., Swallow, G., Atlas, A.: Fast reroute extensions to RSVP-TE for LSP tunnels. IETF RFC 4090 (2001)

    Google Scholar 

  27. Ramamurthyt, S., Mukherjee, B.: Survivable WDM mesh networks, part II – restoration. In: International Conference on Communications, pp. 2023–2030 (1999)

    Google Scholar 

  28. Ramasubramanian, S.: On failure dependent protection in optical grooming networks. In: International Conference on Dependable Systems and Networks, pp. 440–449 (2004)

    Google Scholar 

  29. Segovia, J., Calle, E., Vila, P., Marzo, J., Tapolcai, J.: Topology-focused availability analysis of basic protection schemes in optical transport networks. J. Opt. Netw. 7(4), 351–364 (2008)

    Article  Google Scholar 

  30. Optical fiber supply meets expanding application. SK Opto-Electronics Newsletter (2003)

    Google Scholar 

  31. Stidsen, T., Kjaerulff, P.: Complete rerouting protection. Journal of Optical Networking 5(6), 481–492 (2006)

    Article  Google Scholar 

  32. Tapolcai, J., Cinkler, T.: On-line routing algorithms with shared protection in WDM networks. In: Optical Network Design and Modelling, pp. 351–364 (2003)

    Google Scholar 

  33. Tapolcai, J., Ho, P. H., Cinkler, T.: A compact mathematical formulation for shared path protection with general shared risk groups. In: Conference on Wireless and Optical Communications Networks (WOCN), pp. 270–274. Dubai, UAE (2005)

    Google Scholar 

  34. Tapolcai, J., Ho, P. H., Verchere, D., Cinkler, T.: A novel shared segment protection method for guaranteed recovery time. In: Broadband Optical Networking Symposium (BroadNets), pp. 127–136 (2005)

    Google Scholar 

  35. Verbrugge, S., Colle, D., Demeester, P., Hülsermann, R., Jäger, M.: General availability model for multilayer transport networks. In: Proc. DRCN 2005. Lacco Ameno, Italy (2005)

    Google Scholar 

  36. Wang, D., Li, G.: Efficient distributed solution for MPLS Fast Reroute. In: 4th International IFIP-TC6 Networking Conference (NETWORKING), p. 804 (2005)

    Google Scholar 

  37. Wang, H., Modiano, E., Médard, M.: Partial path protection for wdm networks: End-to-end recovery using local failure information. In: Seventh International Symposium on Computers and Communications (ISCC), pp. 719–725 (2002)

    Google Scholar 

  38. Xiong, Y., Mason, L.: Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Transactions on Networking 7(1), 98–110 (1999)

    Article  Google Scholar 

  39. Xu, D., Xiong, Y., Qiao, C., Li, G.: Trap avoidance and protection schemes in networks with shared risk link groups. In: IEEE Journal of Lightwave Technology (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics and Applications, University of Girona, Campus Montilivi, 17071, Girona, Spain

    José L. Marzo, Eusebi Calle & Juan Segovia

  2. Informatics and Mathematical Modeling, Danish Technical University, Richard Petersens Plads, DK-2800 Kgs, Lyngby, Denmark

    Thomas Stidsen

  3. Networks Competence Area, DTU Fotonik, Technical University of Denmark, 2800 Kgs, Lyngby, Denmark

    Sarah Ruepp

  4. Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Budapest, Hungary

    Janos Tapolcai

Authors
  1. José L. Marzo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Stidsen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sarah Ruepp
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Eusebi Calle
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Janos Tapolcai
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Juan Segovia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to José L. Marzo , Thomas Stidsen , Sarah Ruepp , Eusebi Calle , Janos Tapolcai or Juan Segovia .

Editor information

Editors and Affiliations

  1. LS II für Mathematik, RWTH Aachen, Templergraben 55, Aachen, 52056, Germany

    Arie Koster

  2. Depto. Matematica Aplicada IV, Universitat Politècnica de Catalunya, C. Jordi Girona 1-3, Barcelona, 08034, Spain

    Xavier Muñoz

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Marzo, J.L., Stidsen, T., Ruepp, S., Calle, E., Tapolcai, J., Segovia, J. (2009). Network Survivability: End-to-End Recovery Using Local Failure Information. In: Koster, A., Muñoz, X. (eds) Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02250-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02250-0_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02249-4

  • Online ISBN: 978-3-642-02250-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation