Skip to main content

Inter-arrival Planning for Sub-graph Routing Protection in WDM Networks

  • Conference paper
Book cover Telecommunications and Networking - ICT 2004 (ICT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3124))

Included in the following conference series:

Abstract

We propose an inter-arrival planning strategy that strongly reduces path and wavelength reassignment in WDM networks protected by sub-graph routing. It has been recently demonstrated that Sub-Graph Routing Protection outperforms Backup Multiplexing in terms of blocking probability and link utilization. However, a major drawback is that upon occurrence of a link failure, even connections that do not traverse the faulty link may have to reassign their path or wavelength to accommodate others, interrupting the service. In this paper we show that offline inter-arrival planning of protection resources can efficiently reduce reassignment while preserving blocking performance.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ramaswami, R., Sivarajan, K.N.: Optical Networks: a Practical Perspective. Morgan Kaufmann Publishers, San Francisco (2002)

    Google Scholar 

  2. Mohan, G., Murthy, C.S.R., Somani, A.K.: Efficient algorithms for routing dependable connections in WDM optical networks. IEEE/ACM Trans. Networking 9, 553–566 (2001)

    Article  Google Scholar 

  3. Frederick, M.T., Somani, A.K.: A single-fault recovery strategy for optical networks using subgraph routing. In: Proc. ONDM 2003, pp. 549–568 (2003)

    Google Scholar 

  4. Datta, P., Frederick, M.T., Somani, A.K.: Sub-graph routing: a novel fault-tolerant architecture for shared-risk link group failures in WDM optical networks. In: Proc. DRCN 2003 (2003)

    Google Scholar 

  5. Ho, P.H., Mouftah, H.T.: A novel distributed protocol for path selection in dynamic wavelength-routed WDM networks. Kluwer Photonic Network Communications 5, 23–32 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mello, D.A.A., Pelegrini, J.U., Savasini, M.S., Pavani, G.S., Waldman, H. (2004). Inter-arrival Planning for Sub-graph Routing Protection in WDM Networks. In: de Souza, J.N., Dini, P., Lorenz, P. (eds) Telecommunications and Networking - ICT 2004. ICT 2004. Lecture Notes in Computer Science, vol 3124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27824-5_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27824-5_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22571-3

  • Online ISBN: 978-3-540-27824-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics