Algorithms for all-pairs reliable quickest paths

Young Cheol Bang; Nageswara S.V. Rao; S. Radhakrishnan

doi:10.1007/3-540-44862-4_73

Algorithms for all-pairs reliable quickest paths

Young Cheol Bang
, Nageswara S.V. Rao
, S. Radhakrishnan

Autonomous and Complex Systems

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We consider the reliable transmission of messages via quickest paths in a network with bandwidth, delay and reliability parameters specified for each link. For a message of size σ, we present algorithms to compute all-pairs quickest most-reliable and most-reliable quickest paths each with time complexity O(n²m), where n and m are the number of nodes and links of the network, respectively.

Original language	English
Pages (from-to)	678-684
Number of pages	7
Journal	Lecture Notes in Computer Science
Volume	2658
DOIs	https://doi.org/10.1007/3-540-44862-4_73
State	Published - 2003

Access to Document

10.1007/3-540-44862-4_73

Cite this

@article{a8c12b1bcfd3407c84dec510b0851313,

title = "Algorithms for all-pairs reliable quickest paths",

abstract = "We consider the reliable transmission of messages via quickest paths in a network with bandwidth, delay and reliability parameters specified for each link. For a message of size σ, we present algorithms to compute all-pairs quickest most-reliable and most-reliable quickest paths each with time complexity O(n2m), where n and m are the number of nodes and links of the network, respectively.",

author = "Bang, \{Young Cheol\} and Rao, \{Nageswara S.V.\} and S. Radhakrishnan",

year = "2003",

doi = "10.1007/3-540-44862-4\_73",

language = "English",

volume = "2658",

pages = "678--684",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

}

TY - JOUR

T1 - Algorithms for all-pairs reliable quickest paths

AU - Bang, Young Cheol

AU - Rao, Nageswara S.V.

AU - Radhakrishnan, S.

PY - 2003

Y1 - 2003

N2 - We consider the reliable transmission of messages via quickest paths in a network with bandwidth, delay and reliability parameters specified for each link. For a message of size σ, we present algorithms to compute all-pairs quickest most-reliable and most-reliable quickest paths each with time complexity O(n2m), where n and m are the number of nodes and links of the network, respectively.

AB - We consider the reliable transmission of messages via quickest paths in a network with bandwidth, delay and reliability parameters specified for each link. For a message of size σ, we present algorithms to compute all-pairs quickest most-reliable and most-reliable quickest paths each with time complexity O(n2m), where n and m are the number of nodes and links of the network, respectively.

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

U2 - 10.1007/3-540-44862-4_73

DO - 10.1007/3-540-44862-4_73

M3 - Article

AN - SCOPUS:35248848970

SN - 0302-9743

VL - 2658

SP - 678

EP - 684

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

Algorithms for all-pairs reliable quickest paths

Abstract

Access to Document

Other files and links

Fingerprint

Cite this