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 条

[21] Text Line Extraction based on Integrated K-shortest Paths Optimization
Wang, Liuan
Sun, Jun
Uchida, Seiichi
[J]. 2018 13TH IAPR INTERNATIONAL WORKSHOP ON DOCUMENT ANALYSIS SYSTEMS (DAS), 2018, : 85 - 90
[22] Research on the algorithm for K-shortest paths problem based on A* in complicated network
Chen, Lichao
Liu, Jia
Zhang, Yingjun
Xie, Binhong
[J]. PROCEEDINGS OF THE SIXTH IEEE INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS, 2007, : 419 - +
[23] Efficient Multi-hop Broadcasting in Wireless Networks Using k-Shortest Path Pruning
Rieck, Michael Q.
Dhar, Subhankar
[J]. DISTRIBUTED COMPUTING AND NETWORKING, PROCEEDINGS, 2010, 5935 : 283 - +
[24] Intelligent Optimization Approach for the k Shortest Paths Problem Based on Genetic Algorithm
Wang, Feng
Man, Yuan
Man, Lichun
[J]. 2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014, : 219 - 224
[25] Globally Optimal Text Line Extraction based on K-Shortest Paths algorithm
Wang, Liuan
Fan, Wei
Sun, Jun
Uchida, Seiichi
[J]. PROCEEDINGS OF 12TH IAPR WORKSHOP ON DOCUMENT ANALYSIS SYSTEMS, (DAS 2016), 2016, : 335 - 339
[26] High Performance Computing Simulation of Intelligent Logistics Management Based on Shortest Path Algorithm
Wei, Zongchao
[J]. COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2022, 2022
[27] Hybrid intelligent algorithm for multiple objectives stochastic shortest path problem
Ji, Xiaoyu
[J]. PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INFORMATION AND MANAGEMENT SCIENCES, 2006, 5 : 480 - 483
[28] A new solution to the K-shortest paths problem and its application in wavelength routed optical networks
Li, Junjie
Zhang, Hanyi
[J]. PHOTONIC NETWORK COMMUNICATIONS, 2006, 12 (03) : 269 - 284
[29] K-shortest paths Q-routing: A new QoS routing algorithm in telecommunication networks
Hoceini, S
Mellouk, A
Amirat, Y
[J]. NETWORKING - ICN 2005, PT 2, 2005, 3421 : 164 - 172
[30] A Signal Separation Method for Physical Wireless Parameter Conversion Sensor Networks Using K-Shortest Path
Yamasaki, Shuhei
Oriuchi, Minato
Takyu, Osamu
Shirai, Keiichiro
Fujii, Takeo
Ohta, Mai
Sasamori, Fumihito
Handa, Shiro
[J]. 2018 ASIA-PACIFIC SIGNAL AND INFORMATION PROCESSING ASSOCIATION ANNUAL SUMMIT AND CONFERENCE (APSIPA ASC), 2018, : 165 - 170

← 1 2 3 4 5 →