TY - GEN
T1 - Link weight optimization for routing considering link utilization in communication networks
AU - Gong, Seong Lyong
AU - Kim, Sung Yeon
AU - Lee, Jang Won
AU - Lee, Sang Il
AU - Ahn, Myung Kil
PY - 2009
Y1 - 2009
N2 - In this paper, we study the problem that finds optimal link weights for routing in communication networks with a target utilization for each link. Since the problem is known as NP-hard, we take a heuristic approach based on the simulated annealing method. However, to make the algorithm to be more robust and converge fast, we modify the basic simulated annealing method. Numerical results show that our algorithm provides a better performance than the basic simulated annealing method.
AB - In this paper, we study the problem that finds optimal link weights for routing in communication networks with a target utilization for each link. Since the problem is known as NP-hard, we take a heuristic approach based on the simulated annealing method. However, to make the algorithm to be more robust and converge fast, we modify the basic simulated annealing method. Numerical results show that our algorithm provides a better performance than the basic simulated annealing method.
UR - http://www.scopus.com/inward/record.url?scp=74549182699&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=74549182699&partnerID=8YFLogxK
U2 - 10.1109/ISCIT.2009.5341025
DO - 10.1109/ISCIT.2009.5341025
M3 - Conference contribution
AN - SCOPUS:74549182699
SN - 9781424445219
T3 - 2009 9th International Symposium on Communications and Information Technology, ISCIT 2009
SP - 1532
EP - 1533
BT - 2009 9th International Symposium on Communications and Information Technology, ISCIT 2009
T2 - 2009 9th International Symposium on Communications and Information Technology, ISCIT 2009
Y2 - 28 September 2009 through 30 September 2009
ER -