Performance analysis of QoS routing with network dependant delay cost

Hahnearl Jeon, Sung Dae Kim, Young Joon Kim, Hyung Taek Kim, Jai Yong Lee

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

This paper investigates the problem of path calculation of multiple metric routing. Today's Internet routing is based on a single metric path selecting algorithm. The single metric path is a best effort service that can only support a path for one requirement. In order to support quality-of-service (QoS) call, the path is subject to multiple constraints on the routing metric. In many cases, the path finding problem is NP-complete. This paper proposes the widest-least cost routing algorithm that uses a cost metric that is based on a delay metric and influenced by the resource bandwidth metric and network state. This algorithm is a multiple metric routing algorithm that has the traffic distribution ability to serve a traffic engine ring. Our goal is to select the shortest path when the network link is not loaded, and perform traffic engineering to move traffic to the other path when the network load is heavy. We have studied the performance through simulation and compared it against other routing algorithms.

Original languageEnglish
Title of host publicationProceedings - 15th International Conference on Information Networking, ICOIN 2001
PublisherIEEE Computer Society
Pages689-693
Number of pages5
ISBN (Electronic)0769509517
DOIs
Publication statusPublished - 2001 Jan 1
Event15th International Conference on Information Networking, ICOIN 2001 - Beppu City, Oita, Japan
Duration: 2001 Jan 312001 Feb 2

Publication series

NameInternational Conference on Information Networking
Volume2001-January
ISSN (Print)1976-7684

Other

Other15th International Conference on Information Networking, ICOIN 2001
CountryJapan
CityBeppu City, Oita
Period01/1/3101/2/2

Fingerprint

Routing algorithms
Quality of service
Costs
Computational complexity
Internet
Engines
Bandwidth

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Cite this

Jeon, H., Kim, S. D., Kim, Y. J., Kim, H. T., & Lee, J. Y. (2001). Performance analysis of QoS routing with network dependant delay cost. In Proceedings - 15th International Conference on Information Networking, ICOIN 2001 (pp. 689-693). [905543] (International Conference on Information Networking; Vol. 2001-January). IEEE Computer Society. https://doi.org/10.1109/ICOIN.2001.905543
Jeon, Hahnearl ; Kim, Sung Dae ; Kim, Young Joon ; Kim, Hyung Taek ; Lee, Jai Yong. / Performance analysis of QoS routing with network dependant delay cost. Proceedings - 15th International Conference on Information Networking, ICOIN 2001. IEEE Computer Society, 2001. pp. 689-693 (International Conference on Information Networking).
@inproceedings{6ca900bd1e6f402bb7c36ae590d038c3,
title = "Performance analysis of QoS routing with network dependant delay cost",
abstract = "This paper investigates the problem of path calculation of multiple metric routing. Today's Internet routing is based on a single metric path selecting algorithm. The single metric path is a best effort service that can only support a path for one requirement. In order to support quality-of-service (QoS) call, the path is subject to multiple constraints on the routing metric. In many cases, the path finding problem is NP-complete. This paper proposes the widest-least cost routing algorithm that uses a cost metric that is based on a delay metric and influenced by the resource bandwidth metric and network state. This algorithm is a multiple metric routing algorithm that has the traffic distribution ability to serve a traffic engine ring. Our goal is to select the shortest path when the network link is not loaded, and perform traffic engineering to move traffic to the other path when the network load is heavy. We have studied the performance through simulation and compared it against other routing algorithms.",
author = "Hahnearl Jeon and Kim, {Sung Dae} and Kim, {Young Joon} and Kim, {Hyung Taek} and Lee, {Jai Yong}",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/ICOIN.2001.905543",
language = "English",
series = "International Conference on Information Networking",
publisher = "IEEE Computer Society",
pages = "689--693",
booktitle = "Proceedings - 15th International Conference on Information Networking, ICOIN 2001",
address = "United States",

}

Jeon, H, Kim, SD, Kim, YJ, Kim, HT & Lee, JY 2001, Performance analysis of QoS routing with network dependant delay cost. in Proceedings - 15th International Conference on Information Networking, ICOIN 2001., 905543, International Conference on Information Networking, vol. 2001-January, IEEE Computer Society, pp. 689-693, 15th International Conference on Information Networking, ICOIN 2001, Beppu City, Oita, Japan, 01/1/31. https://doi.org/10.1109/ICOIN.2001.905543

Performance analysis of QoS routing with network dependant delay cost. / Jeon, Hahnearl; Kim, Sung Dae; Kim, Young Joon; Kim, Hyung Taek; Lee, Jai Yong.

Proceedings - 15th International Conference on Information Networking, ICOIN 2001. IEEE Computer Society, 2001. p. 689-693 905543 (International Conference on Information Networking; Vol. 2001-January).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Performance analysis of QoS routing with network dependant delay cost

AU - Jeon, Hahnearl

AU - Kim, Sung Dae

AU - Kim, Young Joon

AU - Kim, Hyung Taek

AU - Lee, Jai Yong

PY - 2001/1/1

Y1 - 2001/1/1

N2 - This paper investigates the problem of path calculation of multiple metric routing. Today's Internet routing is based on a single metric path selecting algorithm. The single metric path is a best effort service that can only support a path for one requirement. In order to support quality-of-service (QoS) call, the path is subject to multiple constraints on the routing metric. In many cases, the path finding problem is NP-complete. This paper proposes the widest-least cost routing algorithm that uses a cost metric that is based on a delay metric and influenced by the resource bandwidth metric and network state. This algorithm is a multiple metric routing algorithm that has the traffic distribution ability to serve a traffic engine ring. Our goal is to select the shortest path when the network link is not loaded, and perform traffic engineering to move traffic to the other path when the network load is heavy. We have studied the performance through simulation and compared it against other routing algorithms.

AB - This paper investigates the problem of path calculation of multiple metric routing. Today's Internet routing is based on a single metric path selecting algorithm. The single metric path is a best effort service that can only support a path for one requirement. In order to support quality-of-service (QoS) call, the path is subject to multiple constraints on the routing metric. In many cases, the path finding problem is NP-complete. This paper proposes the widest-least cost routing algorithm that uses a cost metric that is based on a delay metric and influenced by the resource bandwidth metric and network state. This algorithm is a multiple metric routing algorithm that has the traffic distribution ability to serve a traffic engine ring. Our goal is to select the shortest path when the network link is not loaded, and perform traffic engineering to move traffic to the other path when the network load is heavy. We have studied the performance through simulation and compared it against other routing algorithms.

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

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

U2 - 10.1109/ICOIN.2001.905543

DO - 10.1109/ICOIN.2001.905543

M3 - Conference contribution

AN - SCOPUS:84949755642

T3 - International Conference on Information Networking

SP - 689

EP - 693

BT - Proceedings - 15th International Conference on Information Networking, ICOIN 2001

PB - IEEE Computer Society

ER -

Jeon H, Kim SD, Kim YJ, Kim HT, Lee JY. Performance analysis of QoS routing with network dependant delay cost. In Proceedings - 15th International Conference on Information Networking, ICOIN 2001. IEEE Computer Society. 2001. p. 689-693. 905543. (International Conference on Information Networking). https://doi.org/10.1109/ICOIN.2001.905543