Abstract
In this study, we present a eccentric end-to-end path selection and recovery scheme that guarantees fast and efficient recovery of individual and groomed paths in Generalized Multiprotocol Label Switching (GMPLS) based Wavelength Division Multiplexing (WDM) networks. To this, we propose a novel allocation and restoration strategy called ”Reverse Shared Risk Link Group (RSRLG)” and demonstrate how this concept can be applied to minimize network reconfiguration in GMPLS networks and to minimize network recovery time. It is found that only a additional open shortest path first-traffic engineering (OSPF-TE) message is needed to support the RSRLG scheme and a very fast restorability can be accomplished for a single failure. This paper also has developed an analytical model and performed analysis for the proposed scheme in terms of two performance factors: mean number of recovery requests in the system and recovery blocking probability.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ye, Y., Dixit, S., Ali, M.: On Joint Protection/Restoration in IPCentric DWDM-Based Optical Transport Networks. IEEE Communications Magazine 6, 174–183 (2000)
S. Ramamurthy, Biswanath Mukherjee: Survivable WDM Mesh Networks, Part I-Protection, INFOCOM ’99, Vol. 2. (1999) 744–751
Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part II-Restoration. ICC 1999 3, 2023–2030 (1999)
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)
Oki, E., Matsuura, N.: A Disjoint Path Selection Schemes With Shared Risk Link Groups in GMPLS Networks. IEEE Communications Letters 6, 406–408 (2002)
kim, H., Choi, J., Ahn, S., chung, J.: Analysis of End to End Recovery Algorithms with Preemptive Priority in GMPLS Networks. LNCS, vol. 2662, pp. 118–127 (2003)
Jianxin, W., Weiping, W., Jianer, C., Songqiao, C.: A Randomized Qos Routing Algorithm On Networks with Inaccurate Link-state Information. In: GLOBECOM 1999, vol. 3, pp. 1694–1698 (1999)
Ou, C., Zhu, K., et al.: Traffic Grooming for Survivable WDM Networks- Shared Protection. IEEE J. Sel. Areas in Communications 21(9), 1367–1383 (2003)
Zhu, K., Mukherjee, B.: Traffic Grooming in an Optical WDM Mesh Network. IEEE J. Sel. Areas in Communications 20(1), 122–133 (2002)
Cho, Y.Z., Kwan, C.: Un: Analysis of the M/G/1 Queue under a Combined Preemptive/Nonpreemptive Priority Discipline. IEEE Transactions on Communications 41, 132–141 (1993)
Neuts, M.F.: Matrix-Geomatric Solutions in Stochastic Models, pp. 81–100 (1983)
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)
Kim, Y., Kwan, C.: Un: Analysis of Bandwidth Allocation Strategies with Access Restrictions in Broadband ISDN. IEEE Transactions On Communications 41, 771–781 (1993)
Kim, Y., Kwan, C.: Un: Bandwidth Allocation Strategy with Access Restriction and Pre-emptive Priority. IEEE Electrics Letters 25(10), 655–656 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, H., Ahn, S., Kim, D., Kim, S., Chung, J. (2004). A New Recovery Scheme with Reverse Shared Risk Link Group in GMPLS-Based WDM Networks. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3043. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24707-4_121
Download citation
DOI: https://doi.org/10.1007/978-3-540-24707-4_121
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22054-1
Online ISBN: 978-3-540-24707-4
eBook Packages: Springer Book Archive