Link weight optimization for routing in communication networks

Seong Lyong Gong; Seong Yeon Kim; Jang Won Lee; Sang Il Lee; Myung Kil Ahn

doi:10.1587/elex.7.33

Link weight optimization for routing in communication networks

Seong Lyong Gong, Seong Yeon Kim, Jang Won Lee, Sang Il Lee, Myung Kil Ahn

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

Abstract

In the shortest path routing algorithm for communication networks, the end-to-end path of each session is found such that the sum of weights of links on the path is minimized. Hence, to find a 'good' path for each session, it is important to assign the appropriate weight to each link in the network. In this paper, we study this problem considering the utilization of each link. Since this problem is known to be NP-hard[1], we use a heuristic approach. Our algorithm is based on the simulated annealing algorithm. However, with taking into account the properties of our problem, we modify the basic simulated annealing algorithm, which results in a faster and more robust convergence.

Original language	English
Pages (from-to)	33-39
Number of pages	7
Journal	ieice electronics express
Volume	7
Issue number	1
DOIs	https://doi.org/10.1587/elex.7.33
Publication status	Published - 2010 Jan 10

All Science Journal Classification (ASJC) codes

Electronic, Optical and Magnetic Materials
Condensed Matter Physics
Electrical and Electronic Engineering

Access to Document

10.1587/elex.7.33

Cite this

@article{f5bd7662c91b49eeb9b4712c24966752,

title = "Link weight optimization for routing in communication networks",

abstract = "In the shortest path routing algorithm for communication networks, the end-to-end path of each session is found such that the sum of weights of links on the path is minimized. Hence, to find a 'good' path for each session, it is important to assign the appropriate weight to each link in the network. In this paper, we study this problem considering the utilization of each link. Since this problem is known to be NP-hard[1], we use a heuristic approach. Our algorithm is based on the simulated annealing algorithm. However, with taking into account the properties of our problem, we modify the basic simulated annealing algorithm, which results in a faster and more robust convergence.",

author = "Gong, {Seong Lyong} and Kim, {Seong Yeon} and Lee, {Jang Won} and Lee, {Sang Il} and Ahn, {Myung Kil}",

year = "2010",

month = jan,

day = "10",

doi = "10.1587/elex.7.33",

language = "English",

volume = "7",

pages = "33--39",

journal = "ieice electronics express",

issn = "1349-2543",

publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",

number = "1",

}

TY - JOUR

T1 - Link weight optimization for routing in communication networks

AU - Gong, Seong Lyong

AU - Kim, Seong Yeon

AU - Lee, Jang Won

AU - Lee, Sang Il

AU - Ahn, Myung Kil

PY - 2010/1/10

Y1 - 2010/1/10

N2 - In the shortest path routing algorithm for communication networks, the end-to-end path of each session is found such that the sum of weights of links on the path is minimized. Hence, to find a 'good' path for each session, it is important to assign the appropriate weight to each link in the network. In this paper, we study this problem considering the utilization of each link. Since this problem is known to be NP-hard[1], we use a heuristic approach. Our algorithm is based on the simulated annealing algorithm. However, with taking into account the properties of our problem, we modify the basic simulated annealing algorithm, which results in a faster and more robust convergence.

AB - In the shortest path routing algorithm for communication networks, the end-to-end path of each session is found such that the sum of weights of links on the path is minimized. Hence, to find a 'good' path for each session, it is important to assign the appropriate weight to each link in the network. In this paper, we study this problem considering the utilization of each link. Since this problem is known to be NP-hard[1], we use a heuristic approach. Our algorithm is based on the simulated annealing algorithm. However, with taking into account the properties of our problem, we modify the basic simulated annealing algorithm, which results in a faster and more robust convergence.

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

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

U2 - 10.1587/elex.7.33

DO - 10.1587/elex.7.33

M3 - Article

AN - SCOPUS:74349091514

SN - 1349-2543

VL - 7

SP - 33

EP - 39

JO - ieice electronics express

JF - ieice electronics express

IS - 1

ER -

Link weight optimization for routing in communication networks

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this