Link-disjoint routing algorithms with link-disjoint degree and resource utilization concern in translucent WDM optical networks

Tithra Chap, Xin Wang, Sugang Xu, Yoshiaki Tanaka

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Link-disjoint routing strategy can offer a set of reliable alternate paths when the active best path fails. However, simply employing a set of fully disjointed paths may not necessarily result in the efficient network resource utilization in some circumstances, which degrades the performance of the network system under a highly loaded traffic condition. In this study, we propose two heuristic link-disjoint routing algorithms to recruit a set of link-disjoint paths considering network resource optimization. Resource balance-based link-disjoint routing (RBR), as the first proposed scheme, selects a set of link-disjoint paths under a balanced condition between resource consumption and the link-disjoint degree (the percentage of the disjointed level between links of the selected paths and the links of the new path to be selected). The second scheme, resource optimization-based with customized link-disjoint degree routing (ROR), computes a set of link-disjoint paths which prioritize the minimum resource consumption and a required link-disjoint degree. The simulation results show that RBR and ROR significantly outperform the traditional shortest path in term of blocking probability. RBR works relatively at the same level as ROR. ROR's effectiveness is rather various depending on the given link-disjoint degree and the network size. We also find out that the link-disjoint degree of approximately 90% enables ROR to produce its best blocking performance in USANet backbone network topology while a lower degree suits a smaller network size.

Original languageEnglish
Title of host publication13th International Conference on Advanced Communication Technology
Subtitle of host publicationSmart Service Innovation through Mobile Interactivity, ICACT 2011, Proceeding
Pages357-362
Number of pages6
Publication statusPublished - 2011 May 11
Event13th International Conference on Advanced Communication Technology: Smart Service Innovation through Mobile Interactivity, ICACT 2011 - Gangwon-Do, Korea, Republic of
Duration: 2011 Feb 132011 Feb 16

Publication series

NameInternational Conference on Advanced Communication Technology, ICACT
ISSN (Print)1738-9445

Conference

Conference13th International Conference on Advanced Communication Technology: Smart Service Innovation through Mobile Interactivity, ICACT 2011
CountryKorea, Republic of
CityGangwon-Do
Period11/2/1311/2/16

Keywords

  • Link-Disjoint
  • Network
  • Optical
  • Resource Optimization
  • Routing
  • Translucent
  • WDM
  • Wavelength Division Multiplexing

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Link-disjoint routing algorithms with link-disjoint degree and resource utilization concern in translucent WDM optical networks'. Together they form a unique fingerprint.

  • Cite this

    Chap, T., Wang, X., Xu, S., & Tanaka, Y. (2011). Link-disjoint routing algorithms with link-disjoint degree and resource utilization concern in translucent WDM optical networks. In 13th International Conference on Advanced Communication Technology: Smart Service Innovation through Mobile Interactivity, ICACT 2011, Proceeding (pp. 357-362). (International Conference on Advanced Communication Technology, ICACT).