Link weight optimization for routing in communication networks

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

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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 languageEnglish
Pages (from-to)33-39
Number of pages7
Journalieice electronics express
Issue number1
Publication statusPublished - 2010 Jan 10

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'Link weight optimization for routing in communication networks'. Together they form a unique fingerprint.

Cite this