On algorithm for all-pairs most reliable quickest paths

Young Cheol Bang; Inki Hong; Hyunseung Choo

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

On algorithm for all-pairs most reliable quickest paths

Young Cheol Bang
, Inki Hong
, Hyunseung Choo

Department of Computer Science and Engineering

Tech University of Korea

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

Abstract

The reliability problem of the quickest path deals with the transmission of a message of size σ from a source to a destination with both the minimum end-to-end delay and the reliability of the path over a network with bandwidth, delay, and probability of fault free on the links. For any value of message size σ, we present algorithm to compute all-pairs most-reliable quickest paths each with time complexity O(n²m), where n and m are the number of nodes and the number of arcs or links in the network, respectively.

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	611-614
Number of pages	4
ISBN (Print)	9783540221142
DOIs	https://doi.org/10.1007/978-3-540-24685-5_102
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_102

Cite this

Bang, Y. C., Hong, I., & Choo, H. (2004). On algorithm for all-pairs most reliable quickest 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. 611-614). (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_102

Bang, Young Cheol ; Hong, Inki ; Choo, Hyunseung. / On algorithm for all-pairs most reliable quickest 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. 611-614 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{b148e6514a6d49998bb39cd9422c3230,

title = "On algorithm for all-pairs most reliable quickest paths",

abstract = "The reliability problem of the quickest path deals with the transmission of a message of size σ from a source to a destination with both the minimum end-to-end delay and the reliability of the path over a network with bandwidth, delay, and probability of fault free on the links. For any value of message size σ, we present algorithm to compute all-pairs most-reliable quickest paths each with time complexity O(n2m), where n and m are the number of nodes and the number of arcs or links in the network, respectively.",

author = "Bang, \{Young Cheol\} and Inki Hong and Hyunseung Choo",

year = "2004",

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

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 = "611--614",

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)",

}

Bang, YC, Hong, I & Choo, H 2004, On algorithm for all-pairs most reliable quickest 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. 611-614. https://doi.org/10.1007/978-3-540-24685-5_102

On algorithm for all-pairs most reliable quickest paths. / Bang, Young Cheol; Hong, Inki; 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. 611-614 (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 algorithm for all-pairs most reliable quickest paths

AU - Bang, Young Cheol

AU - Hong, Inki

AU - Choo, Hyunseung

PY - 2004

Y1 - 2004

N2 - The reliability problem of the quickest path deals with the transmission of a message of size σ from a source to a destination with both the minimum end-to-end delay and the reliability of the path over a network with bandwidth, delay, and probability of fault free on the links. For any value of message size σ, we present algorithm to compute all-pairs most-reliable quickest paths each with time complexity O(n2m), where n and m are the number of nodes and the number of arcs or links in the network, respectively.

AB - The reliability problem of the quickest path deals with the transmission of a message of size σ from a source to a destination with both the minimum end-to-end delay and the reliability of the path over a network with bandwidth, delay, and probability of fault free on the links. For any value of message size σ, we present algorithm to compute all-pairs most-reliable quickest paths each with time complexity O(n2m), where n and m are the number of nodes and the number of arcs or links in the network, respectively.

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

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

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

M3 - Chapter

AN - SCOPUS:35048890549

SN - 9783540221142

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

SP - 611

EP - 614

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 -

Bang YC, Hong I, Choo H. On algorithm for all-pairs most reliable quickest 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. 611-614. (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_102

On algorithm for all-pairs most reliable quickest paths

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this