Performance optimization of intelligent optical networks by multiple alternate routes based on the K-shortest path algorithm

被引：0
|
作者：
Cu, Xinyou [1 ]
Zheng, Xiaoping [1 ]
Zhang, Hanyi [1 ]
Li, Yanhe [1 ]
Guo, Yili [1 ]
机构：
[1] Tsinghua Univ, Dept Elect Engn, Beijing 100084, Peoples R China
来源：
NETWORK ARCHITECTURES, MANAGEMENT, AND APPLICATIONS IV | 2006年 / 6354卷
基金：
中国国家自然科学基金;
关键词：
Routing and Wavelength Assignment; K-Shortest Path Algorithm; Dynamic K-Shortest Path Algorithm; Linear Link Weight Function; Piecewise Linear Link Weight Function; Blocking Probability;
D O I：
10.1117/12.691159
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Blocking probability is one of the key factors to evaluate the routing and wavelength algorithms for intelligent optical network. Two kinds of Dynamic K-Shortest Path (DKSP) Algorithms were designed. One is based on Linear Link Weight Function (LW) and the other is based on Piecewise Linear Link Weight Function (PLW). It was found that the two kinds of DKSP can significantly decrease the blocking probability of optical network comparing to the static KSP for the same number of alternate routes. Compared to routing with LW, the coefficient of PLW has larger effect on the blocking probability of optical network when the number of alternate route is small, but the effect is weakened with the increase of the number of alternate route. As far as the two kinds of DKSP algorithms are concerned, DKSP with PLW has some advantage over DKSP with LW on decreasing the blocking probability. It was also found that the optimized performance can almost be got by DKSP with only 2-4 alternate routes for NSFNET.
引用
收藏
页数：8
相关论文
共 50 条
  • [1] K-Shortest Path Algorithm for Overlay Protection in Optical Networks
    Wang, Xi
    Zhang, Qiong
    Palacharla, Paparao
    Naito, Takao
    [J]. 2009 14TH OPTOELECTRONICS AND COMMUNICATIONS CONFERENCE (OECC 2009), 2009, : 60 - 61
  • [2] Optimization of modern tram network based on k-shortest path algorithm
    Hu, Junhong
    Guo, Xiucheng
    Tao, Tao
    Hu, Tingting
    [J]. Dongnan Daxue Xuebao (Ziran Kexue Ban)/Journal of Southeast University (Natural Science Edition), 2017, 47 (06): : 1274 - 1278
  • [3] A New(?) k-Shortest Path Algorithm
    Paluch, Stanislav
    [J]. PROCEEDINGS OF 30TH INTERNATIONAL CONFERENCE MATHEMATICAL METHODS IN ECONOMICS, PTS I AND II, 2012, : 664 - 669
  • [4] A K-SHORTEST PATH ALGORITHM FOR ADAPTIVE ROUTING IN COMMUNICATIONS NETWORKS
    TOPKIS, DM
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1988, 36 (07) : 855 - 859
  • [5] k-PathA: k-shortest Path Algorithm
    Ullrich, Alexander
    Forst, Christian V.
    [J]. 2009 INTERNATIONAL WORKSHOP ON HIGH PERFORMANCE COMPUTATIONAL SYSTEMS BIOLOGY, PROCEEDINGS, 2009, : 23 - +
  • [6] Virtual network construction with K-shortest path algorithm and optimization problems for robust physical networks
    Urayama, Yasuhiro
    Tachibana, Takuji
    [J]. INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2017, 30 (01)
  • [7] COMPUTING K-SHORTEST PATH LENGTHS IN EUCLIDEAN NETWORKS
    SKISCIM, CC
    GOLDEN, BL
    [J]. NETWORKS, 1987, 17 (03) : 341 - 352
  • [8] Adaptations of k-Shortest Path Algorithms for Transportation Networks
    Scano, Gregoire
    Huguet, Marie-Jose
    Ngueveu, Sandra Ulrich
    [J]. 2015 INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM), 2015, : 663 - 669
  • [9] Implementation of K-shortest path algorithm in GPU using CUDA
    AvadheshPratapSingh
    DhirendraPratapSingh
    [J]. INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION AND CONVERGENCE (ICCC 2015), 2015, 48 : 5 - 13
  • [10] Restoration performance study of k-shortest disjoint paths in WDM optical networks
    Tak, Sungwoo
    Park, E. K.
    [J]. TELECOMMUNICATION SYSTEMS, 2007, 34 (1-2) : 13 - 26
12345