Abstract
The explosive growth of Internet traffic has led to a dramatic increase in demand for data transmission capacity, which requires high transmission rates beyond the conventional transmission capability. This demand has spurred tremendous research activities in new high-speed transmission and switching technologies. The present paper focuses on the point of minimizing recovery blocking probability and contention probability to ensure fast and seamless recovery. For this purpose, first the recovery characteristics and grooming architectures of broadband convergence networks is analyzed. Based on the analyzed information, this paper proposes a new dynamic path selection scheme. The simulation results verify that the proposed revised SRLG schemes achieve good network performance and provides good network connectivity as well.
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
Bernstein, G., Rajagopalan, B., Saha, D.: Optical Network Control: Architecture, Protocols, and Standards. Addison Wesley, Reading (2003)
Rajagopalan, R., Pendarakis, D., Saha, D., Ramamoorthy, R.S.: IP over Optical Networks: Architectureal Aspects. IEEE Communications Magazine 38(9), 94–102 (2000)
Hjalmtysson, G., Yates, J., Chaudhuri, S.: Restoration Services for the Optical Internet. In: Proceeding of SPIE, Terabit Optical Networking: Architecture, Control, and Management Issues, October 2000, vol. 4213 (2000)
Grover, W.D.: Mesh-Based Survivable Networks - Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Prentice Hall, Englewood Cliffs (2004)
Jianxin, W., Weiping, W., Jianer, C., Songqiao, C.: A Randomized Qos Routing Algorithm On Networks with Inaccurate Link-state Information. In: International Conference on Communication Technology, WCC-ICCT 2000, August 2000, vol. 2, pp. 1617–1622 (2000)
Oki, E., Matsuura, N., Shiomoto, K., Yamanaka, N.: A Disjoint Path Selection Schemes With Shared Risk Link Groups in GMPLS Networks. IEEE Communications Letters 6(9), 406–408 (2002)
Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part II-Restoration. In: ICC 1999, June 1999, vol. 3, pp. 2023–2030 (1999)
Ye, Y., Dixit, S., Ali, M.: On Joint Protection/Restoration in IP-Centric DWDM-Based Optical Transport Networks. IEEE Communications Magazine 38(6), 174–183 (2000)
Wang, J., Sahasrabuddhe, L., Mukherjee, B.: Path vs. Subpath vs. Link Restoration for Fault Management in IP over WDM Networks: Performance Comparisions Using GMPLS Control Signaling. IEEE Communications Magazine 40(11), 80–87 (2002)
Miyamura, T., Kurimoto, T., Aoki, M., Urushidani, S.: A Multi-layer Disjoint Path Selection Algorithm for Highly Reliable Carrier Services. In: IEEE GLOBECOM 2004, November 2004, vol. 3, pp. 1974–1978 (2004)
Kar, K., Kodialam, M., Lakshman, T.V.: Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications. IEEE J. Sel. Areas in Communications 18(12), 2566–2579 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, H., Ahn, S. (2005). Minimum Interference Path Selection Based on Maximum Degree of Sharing. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds) High Performance Computing and Communications. HPCC 2005. Lecture Notes in Computer Science, vol 3726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11557654_122
Download citation
DOI: https://doi.org/10.1007/11557654_122
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29031-5
Online ISBN: 978-3-540-32079-1
eBook Packages: Computer ScienceComputer Science (R0)