TY - GEN
T1 - Autonomic interference avoidance with extended shortest path algorithm
AU - Cui, Yong
AU - Che, Hao
AU - Lagoa, Constantino
AU - Zheng, Zhi Mei
PY - 2006
Y1 - 2006
N2 - The self-optimization of network resource utilization is one of the important goals for Internet Traffic Engineering. To achieve this goal, many label switched path selection solutions are proposed. However, there are two drawbacks in these solutions. First, they are computationally expensive because they identify the critical links based on the maxflow algorithm. Second, they do not consider the self-demand of the current request when trying to avoid the interference. In this paper, we propose a novel Autonomic Interference Avoidance (AIA) algorithm, which autonomically selects the path with the least interference with the future requests, to overcome these shortcomings. First, AIA identifies the critical links in the shortest paths found by the Shortest Path First (SPF) algorithm, instead of the computationally expensive maxflow algorithm. Second, we introduce the competitive principle to take into account the self-demand of the current request as well as the network status. Therefore, AIA achieves both high resource efficiency and low computation complexity.
AB - The self-optimization of network resource utilization is one of the important goals for Internet Traffic Engineering. To achieve this goal, many label switched path selection solutions are proposed. However, there are two drawbacks in these solutions. First, they are computationally expensive because they identify the critical links based on the maxflow algorithm. Second, they do not consider the self-demand of the current request when trying to avoid the interference. In this paper, we propose a novel Autonomic Interference Avoidance (AIA) algorithm, which autonomically selects the path with the least interference with the future requests, to overcome these shortcomings. First, AIA identifies the critical links in the shortest paths found by the Shortest Path First (SPF) algorithm, instead of the computationally expensive maxflow algorithm. Second, we introduce the competitive principle to take into account the self-demand of the current request as well as the network status. Therefore, AIA achieves both high resource efficiency and low computation complexity.
UR - http://www.scopus.com/inward/record.url?scp=33750037926&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33750037926&partnerID=8YFLogxK
U2 - 10.1007/11839569_6
DO - 10.1007/11839569_6
M3 - Conference contribution
AN - SCOPUS:33750037926
SN - 354038619X
SN - 9783540386193
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 57
EP - 66
BT - Autonomic and Trusted Computing - Thrid International Conference, ATC 2006, Proceedings
PB - Springer Verlag
T2 - Thrid International Conference on Autonomic and Trusted Computing, ATC 2006
Y2 - 3 September 2006 through 6 September 2006
ER -
