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 journalArticle

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

Fingerprint

communication networks
Telecommunication networks
Simulated annealing
optimization
simulated annealing
Routing algorithms

All Science Journal Classification (ASJC) codes

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

Cite this

Gong, Seong Lyong ; Kim, Seong Yeon ; Lee, Jang Won ; Lee, Sang Il ; Ahn, Myung Kil. / Link weight optimization for routing in communication networks. In: ieice electronics express. 2010 ; Vol. 7, No. 1. pp. 33-39.
@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 = "1",
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",

}

Link weight optimization for routing in communication networks. / Gong, Seong Lyong; Kim, Seong Yeon; Lee, Jang Won; Lee, Sang Il; Ahn, Myung Kil.

In: ieice electronics express, Vol. 7, No. 1, 10.01.2010, p. 33-39.

Research output: Contribution to journalArticle

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

VL - 7

SP - 33

EP - 39

JO - IEICE Electronics Express

JF - IEICE Electronics Express

SN - 1349-2543

IS - 1

ER -