Minimum Interference Path Selection Based on Maximum Degree of Sharing (original) (raw)

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.

Preview

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Bernstein, G., Rajagopalan, B., Saha, D.: Optical Network Control: Architecture, Protocols, and Standards. Addison Wesley, Reading (2003)
    Google Scholar
  2. Rajagopalan, R., Pendarakis, D., Saha, D., Ramamoorthy, R.S.: IP over Optical Networks: Architectureal Aspects. IEEE Communications Magazine 38(9), 94–102 (2000)
    Article Google Scholar
  3. 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)
    Google Scholar
  4. Grover, W.D.: Mesh-Based Survivable Networks - Options and Strategies for Optical, MPLS, SONET, and ATM Networking. Prentice Hall, Englewood Cliffs (2004)
    Google Scholar
  5. 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)
    Google Scholar
  6. 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)
    Article Google Scholar
  7. Ramamurthy, S., Mukherjee, B.: Survivable WDM Mesh Networks, Part II-Restoration. In: ICC 1999, June 1999, vol. 3, pp. 2023–2030 (1999)
    Google Scholar
  8. 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)
    Article Google Scholar
  9. 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)
    Article Google Scholar
  10. 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)
    Google Scholar
  11. 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)
    Article Google Scholar

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical and Computer Engineering, Sungkyunkwan University, 300 Chunchun-Dong, Jangan-Gu, Suwon, 440-746, Korea
    Hyuncheol Kim
  2. Dept. of Computer Education, Sungkyunkwan University, 53 Myungryun-Dong, Jongro-Gu, Seoul, 110-745, Korea
    Seongjin Ahn

Authors

  1. Hyuncheol Kim
  2. Seongjin Ahn

Editor information

Editors and Affiliations

  1. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada
    Laurence T. Yang
  2. School of Computer Science/Welsh eScience Centre, Cardiff University, UK
    Omer F. Rana
  3. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy
    Beniamino Di Martino
  4. Computer Science Department, University of Tennessee, 37996-3450, Knoxville, TN, USA
    Jack Dongarra

Rights and permissions

© 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

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us