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

    研究成果: Conference contribution

    1 引用 (Scopus)

    抄録

    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.

    元の言語English
    ホスト出版物のタイトルInternational Conference on Advanced Communication Technology, ICACT
    ページ357-362
    ページ数6
    出版物ステータスPublished - 2011
    イベント13th International Conference on Advanced Communication Technology: Smart Service Innovation through Mobile Interactivity, ICACT 2011 - Gangwon-Do
    継続期間: 2011 2 132011 2 16

    Other

    Other13th International Conference on Advanced Communication Technology: Smart Service Innovation through Mobile Interactivity, ICACT 2011
    Gangwon-Do
    期間11/2/1311/2/16

    Fingerprint

    Routing algorithms
    Fiber optic networks
    Wavelength division multiplexing
    Blocking probability
    Telecommunication links
    Topology

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    これを引用

    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. : International Conference on Advanced Communication Technology, ICACT (pp. 357-362)

    Link-disjoint routing algorithms with link-disjoint degree and resource utilization concern in translucent WDM optical networks. / Chap, Tithra; Wang, Xin; Xu, Sugang; Tanaka, Yoshiaki.

    International Conference on Advanced Communication Technology, ICACT. 2011. p. 357-362.

    研究成果: Conference contribution

    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. : International Conference on Advanced Communication Technology, ICACT. pp. 357-362, 13th International Conference on Advanced Communication Technology: Smart Service Innovation through Mobile Interactivity, ICACT 2011, Gangwon-Do, 11/2/13.
    Chap T, Wang X, Xu S, Tanaka Y. Link-disjoint routing algorithms with link-disjoint degree and resource utilization concern in translucent WDM optical networks. : International Conference on Advanced Communication Technology, ICACT. 2011. p. 357-362
    Chap, Tithra ; Wang, Xin ; Xu, Sugang ; Tanaka, Yoshiaki. / Link-disjoint routing algorithms with link-disjoint degree and resource utilization concern in translucent WDM optical networks. International Conference on Advanced Communication Technology, ICACT. 2011. pp. 357-362
    @inproceedings{def2f6e33db24a96858636f9eee7bfc5,
    title = "Link-disjoint routing algorithms with link-disjoint degree and resource utilization concern in translucent WDM optical networks",
    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.",
    keywords = "Link-Disjoint, Network, Optical, Resource Optimization, Routing, Translucent, Wavelength Division Multiplexing, WDM",
    author = "Tithra Chap and Xin Wang and Sugang Xu and Yoshiaki Tanaka",
    year = "2011",
    language = "English",
    isbn = "9788955191554",
    pages = "357--362",
    booktitle = "International Conference on Advanced Communication Technology, ICACT",

    }

    TY - GEN

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

    AU - Chap, Tithra

    AU - Wang, Xin

    AU - Xu, Sugang

    AU - Tanaka, Yoshiaki

    PY - 2011

    Y1 - 2011

    N2 - 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.

    AB - 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.

    KW - Link-Disjoint

    KW - Network

    KW - Optical

    KW - Resource Optimization

    KW - Routing

    KW - Translucent

    KW - Wavelength Division Multiplexing

    KW - WDM

    UR - http://www.scopus.com/inward/record.url?scp=79955681494&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=79955681494&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:79955681494

    SN - 9788955191554

    SP - 357

    EP - 362

    BT - International Conference on Advanced Communication Technology, ICACT

    ER -