Skip to main content

Dynamic Traffic Grooming and Load Balancing for GMPLS-Centric All Optical Networks

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2004)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3215))

Abstract

Fast and resource optimized lightpath restoration strategies are urgent requirements for the near future Optical Transport Networks (OTN) with a Generalized Multi-Protocol Label Switching (GMPLS) control plane. In this paper, we propose a lightpath selection scheme with Shared Risk Link Group (SRLG) constraints that guarantees fast and load balanced recovery of lightpaths in GMPLS-centric all optical networks. To this, we propose a lightpath allocation and recovery strategy called “Enhanced Reverse Shared Risk Link Group (E-RSRLG)” and demonstrate how this concept can be applied to minimize recovery blocking probability and network convergence time. A 32-node network topology has been set up in OPNETTM to analyze the effects of E-RSRLG handling in terms of two performance factors: the number of recovery contention and the number of extra hops.

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. Banerjee, A., Drake, J., et al.: Generalized Multiprotocol Label Switching: An Overview of signaling Enhancements and Recovery Techniques. IEEE Communications Magazine 7, 144–151 (2001)

    Google Scholar 

  2. Jianxin, W., Weiping, W., et al.: A Randomized Qos Routing Algorithm On Networks with Inaccurate Link-state Information. In: GLOBECOM 1999, vol. 3, pp. 1694–1698 (1999)

    Google Scholar 

  3. kim, H., Choi, J., et al.: Analysis of End to End Recovery Algorithms with Preemptive Priority in GMPLS Networks. In: Kahng, H.-K. (ed.) ICOIN 2003. LNCS, vol. 2662, pp. 118–122. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  4. Ozugur, T., Park, M.-A., et al.: Label Prioritization in GMPLS-Centric All-Optical Networks. In: ICC 2003, vol. 2, May 2003, pp. 1283–1287 (2003)

    Google Scholar 

  5. Xin, C., Ye, Y., et al.: A Joint Working and Protection Path Selection Approach in WDM Optical Networks. In: GLOBECOM 2001, vol. 4, November 1999, pp. 2165–2168 (1999)

    Google Scholar 

  6. Oki, E., Matsuura, N.: A Disjoint Path Selection Schemes With Shared Risk Link Groups in GMPLS Networks. IEEE Communications Letters 6, 406–408 (2002)

    Article  Google Scholar 

  7. Ye, Y., Dixit, S., et al.: On Joint Protection/Restoration in IP-Centric DWDM-Based Optical Transport Networks. IEEE Communications Magazine 6, 174–183 (2000)

    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

Kim, H., Ahn, S., Chung, J. (2004). Dynamic Traffic Grooming and Load Balancing for GMPLS-Centric All Optical Networks. In: Negoita, M.G., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2004. Lecture Notes in Computer Science(), vol 3215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30134-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30134-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30134-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics