Skip to main content

Region Protection/Restoration Scheme in Survivable Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3685))

Abstract

In this paper we propose the novel concept of a region protection/ restoration, where one backup path protects a certain region of an active path. We show that using the region protection/restoration we can keep both restoration times and network resource utilization ratio at the reasonable level.

Since the optimization problem of finding working and backup paths is NP-complete, we developed the heuristic algorithm. We show that in the worst case our algorithm gave network resource utilization ratio only about 3.9 percent higher compared to the optimal one returned by the CPLEX program. Results of the U.S. Long-Distance Network modeling show that region protection gives a good compromise between path and link protection.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as 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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about 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: Proc. INFOCOM, pp. 524–535 (2004)

    Google Scholar 

  2. Dijkstra, E.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269–271 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  3. Kodialam, M., Lakshman, T.V.: Dynamic routing of bandwidth guaranteed tunnels with restoration. In: Proc. INFOCOM, pp. 902–911 (2000)

    Google Scholar 

  4. Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks, Part I – protection. In: Proc. IEEE INFOCOM, pp. 744–751 (1999)

    Google Scholar 

  5. Ramamurthy, S., Mukherjee, B.: Survivable WDM mesh networks, Part II – restoration. In: Proc. IEEE-ICC, vol. 3, pp. 2023–2030 (1999)

    Google Scholar 

  6. Suurballe, J.W.: Disjoint paths in a network, pp. 125–145. John Wiley & Sons, Chichester (1974)

    Google Scholar 

  7. Xiong, Y., Mason, L.G.: Comparison of two path restoration schemes in self-healing networks. Computer Networks 38, 663–674 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Molisz, W., Rak, J. (2005). Region Protection/Restoration Scheme in Survivable Networks. In: Gorodetsky, V., Kotenko, I., Skormin, V. (eds) Computer Network Security. MMM-ACNS 2005. Lecture Notes in Computer Science, vol 3685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560326_37

Download citation

  • DOI: https://doi.org/10.1007/11560326_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29113-8

  • Online ISBN: 978-3-540-31998-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics