Skip to main content

A New Path Protection Algorithm for Meshed Survivable Wavelength-Division-Multiplexing Networks

  • Conference paper
Networking - ICN 2005 (ICN 2005)

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

Included in the following conference series:

Abstract

In this paper, we investigate the relationship between the resource sharing degree and the protection ability, and propose a new path protection algorithm (PPA) to protect the multi-link failures in survivable wavelength-division-multiplexing (WDM) mesh networks. Under dynamic traffic with different load, the simulation results show that PPA not only provide 100% protection for the single-link failure but also has higher resource utilization ratio than the dedicated-path protection (DPP) and higher protection ability than the shared-path protection (SPP) as the multi-link failures occur. With configuring different parameter, PPA can determine the appropriate tradeoffs between the resource utilization ratio and the protection ability.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ramamurthy, S., Sahasrabuddhe, L., Mukherjee, B.: Survivable WDM mesh networks. J. Lightwave Technol. 21, 870–883 (2003)

    Article  Google Scholar 

  2. He, R., Wen, H., Li, L., Wang, G.: Shared sub-path protection algorithm in traffic-grooming WDM mesh networks. Photon. Netw. Commu. 8, 239–249 (2004)

    Article  Google Scholar 

  3. Wen, H., Li, L., He, R., et al.: Dynamic grooming algorithms for survivable WDM mesh networks. Photon. Netw. Commun. 6, 253–263 (2003)

    Article  Google Scholar 

  4. Ou, C., Zhang, J., Zang, H., et al.: New and improved approaches for shared-path protection in WDM mesh networks. J. Lightwave Technol. 22, 1223–1232 (2004)

    Article  Google Scholar 

  5. Jozsa, B.G., Orincsay, D., Kern, A.: Surviving multiple network failures using shared backup path protection. In: Proc. IEEE ISCC, pp. 1333–1340 (2004)

    Google Scholar 

  6. He, W.S., Somani, A.K.: Path-based protection for surviving double-link failures in mesh-restorable optical networks. In: Proc. IEEE GLOBECOM, pp. 2558–2563 (2003)

    Google Scholar 

  7. Guo, L., Yu, H., Li, L.: Double-link failure protection algorithm for shared sub-path in survivable WDM mesh networks. Chin. Opt. Lett. 2, 379–382 (2004)

    Google Scholar 

  8. Guo, L., Yu, H., Li, L.: Joint routing-selection algorithm for a shared path with differentiated reliability in survivable wavelength-division-multiplexing mesh networks. Opt. Express 12, 2327–2337 (2004)

    Article  Google Scholar 

  9. Guo, L., Yu, H., Zhou, T., Li, L.: Dynamic shared-path protection algorithm for dual-risk failures in WDM mesh networks. In: Proc. IEEE ICPP Workshops, pp. 394–398 (2004)

    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

Guo, L., Yu, H., Li, L. (2005). A New Path Protection Algorithm for Meshed Survivable Wavelength-Division-Multiplexing Networks. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31956-6_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25339-6

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics