On balancing delay and cost for routing paths

Moonseong Kim; Young Cheol Bang; Hyunseung Choo

doi:10.1007/978-3-540-24685-5_100

On balancing delay and cost for routing paths

Moonseong Kim
, Young Cheol Bang
, Hyunseung Choo

Department of Computer Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Abstract

The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The path cost of the least delay (LD) path is relatively more expensive than that of the least cost (LC) path, and the path delay of the LC path is relatively higher than that of the LD path. In this paper, we propose an effective parameter that is the probabilistic combination of cost and delay. It significantly contributes to identify the low cost and low delay unicasting path, and improves the path cost with the acceptable delay.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Marian Bubak, Geert Dick van Albada, Peter M.A. Sloot, Jack J. Dongarra
Publisher	Springer Verlag
Pages	602-606
Number of pages	5
ISBN (Print)	9783540221142
DOIs	https://doi.org/10.1007/978-3-540-24685-5_100
State	Published - 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3036
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-540-24685-5_100

Cite this

Kim, M., Bang, Y. C., & Choo, H. (2004). On balancing delay and cost for routing paths. In M. Bubak, G. D. van Albada, P. M. A. Sloot, & J. J. Dongarra (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 602-606). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3036). Springer Verlag. https://doi.org/10.1007/978-3-540-24685-5_100

Kim, Moonseong ; Bang, Young Cheol ; Choo, Hyunseung. / On balancing delay and cost for routing paths. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Marian Bubak ; Geert Dick van Albada ; Peter M.A. Sloot ; Jack J. Dongarra. Springer Verlag, 2004. pp. 602-606 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{9c06b41ab4554a20b8e205f57429c5d3,

title = "On balancing delay and cost for routing paths",

abstract = "The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The path cost of the least delay (LD) path is relatively more expensive than that of the least cost (LC) path, and the path delay of the LC path is relatively higher than that of the LD path. In this paper, we propose an effective parameter that is the probabilistic combination of cost and delay. It significantly contributes to identify the low cost and low delay unicasting path, and improves the path cost with the acceptable delay.",

author = "Moonseong Kim and Bang, \{Young Cheol\} and Hyunseung Choo",

year = "2004",

doi = "10.1007/978-3-540-24685-5\_100",

language = "English",

isbn = "9783540221142",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "602--606",

editor = "Marian Bubak and \{van Albada\}, \{Geert Dick\} and Sloot, \{Peter M.A.\} and Dongarra, \{Jack J.\}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Kim, M, Bang, YC & Choo, H 2004, On balancing delay and cost for routing paths. in M Bubak, GD van Albada, PMA Sloot & JJ Dongarra (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3036, Springer Verlag, pp. 602-606. https://doi.org/10.1007/978-3-540-24685-5_100

On balancing delay and cost for routing paths. / Kim, Moonseong; Bang, Young Cheol; Choo, Hyunseung.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Marian Bubak; Geert Dick van Albada; Peter M.A. Sloot; Jack J. Dongarra. Springer Verlag, 2004. p. 602-606 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3036).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - On balancing delay and cost for routing paths

AU - Kim, Moonseong

AU - Bang, Young Cheol

AU - Choo, Hyunseung

PY - 2004

Y1 - 2004

N2 - The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The path cost of the least delay (LD) path is relatively more expensive than that of the least cost (LC) path, and the path delay of the LC path is relatively higher than that of the LD path. In this paper, we propose an effective parameter that is the probabilistic combination of cost and delay. It significantly contributes to identify the low cost and low delay unicasting path, and improves the path cost with the acceptable delay.

AB - The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The path cost of the least delay (LD) path is relatively more expensive than that of the least cost (LC) path, and the path delay of the LC path is relatively higher than that of the LD path. In this paper, we propose an effective parameter that is the probabilistic combination of cost and delay. It significantly contributes to identify the low cost and low delay unicasting path, and improves the path cost with the acceptable delay.

UR - https://www.scopus.com/pages/publications/35048832313

U2 - 10.1007/978-3-540-24685-5_100

DO - 10.1007/978-3-540-24685-5_100

M3 - Chapter

AN - SCOPUS:35048832313

SN - 9783540221142

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 602

EP - 606

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Bubak, Marian

A2 - van Albada, Geert Dick

A2 - Sloot, Peter M.A.

A2 - Dongarra, Jack J.

PB - Springer Verlag

ER -

Kim M, Bang YC, Choo H. On balancing delay and cost for routing paths. In Bubak M, van Albada GD, Sloot PMA, Dongarra JJ, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 602-606. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-24685-5_100

On balancing delay and cost for routing paths

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this