Skip to main content

Analysis of End-to-End Recovery Algorithms with Preemptive Priority in GMPLS Networks

  • Conference paper
Information Networking (ICOIN 2003)

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

Included in the following conference series:

Abstract

To provide high resilience against failures, optical networks must have an ability to maintain an acceptable level of service during network failures. This paper proposes a new enhanced end-to-end recovery algorithm that guarantees fast and dynamic utilization of network resources in Wavelength Division Multiplexing (WDM) based Generalized Multi-protocol Label Switching (GMPLS) networks. The proposed algorithm guarantees the maximum availability with less burden in finding as many disjointed paths. This paper also has developed an analytical model and performed analysis for the proposed algorithm in terms of two performance factors: mean system time and blocking probability.

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. Ye, Y., Dixit, S., Ali, M.: On Joint Protection/Restoration in IP-Centric DWDM-Based Optical Transport Networks. IEEE Communications Magazine 6, 174–183 (2000)

    Google Scholar 

  2. Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part I-Protection. In: INFOCOM 1999, vol. 2, pp. 744–751 (1999)

    Google Scholar 

  3. Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part II-Restoration. In: ICC 1999, vol. 3, pp. 2023–2030 (1999)

    Google Scholar 

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

    Google Scholar 

  5. Cho, Y.Z., Un, C.K.: Analysis of the M/G/1 Queue under a Combined Preemptive/Nonpreemptive Priority Discipline. IEEE Transactions on Communications 41, 132–141 (1993)

    Article  MATH  Google Scholar 

  6. Neuts, M.F.: Matrix-Geomatric Solutions in Stochastic Models, pp. 81–100 (1983)

    Google Scholar 

  7. Kraimechem, B., Schwartz, M.: Bandwidth Allocation Strategies in Wide-Band Integrated Networks. IEEE J. Sel. Areas in Communications, 1293–1301 (1986)

    Google Scholar 

  8. Ngo, B., Lee, H.: Queueing Analysis of Traffic Access Control Strategies with Preemptive and Nonpreemptive Discipline in Wideband Integrated Networks. IEEE J. on Selected Areas in Communications 9, 1093–1109 (1991)

    Article  Google Scholar 

  9. Kim, Y., Un, C.: Analysis of Bandwidth Allocation Strategies with Access Restrictions in Broadband ISDN. IEEE Transactions on Communications 41, 771–781 (1993)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, H.C., Choi, J.K., Ahn, S., Chung, J.W. (2003). Analysis of End-to-End Recovery Algorithms with Preemptive Priority in GMPLS Networks. In: Kahng, HK. (eds) Information Networking. ICOIN 2003. Lecture Notes in Computer Science, vol 2662. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45235-5_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45235-5_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40827-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics