Algorithms for all-pairs reliable quickest paths

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

Research output: Contribution to journalArticlepeer-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(n2m), where n and m are the number of nodes and links of the network, respectively.

Original languageEnglish
Pages (from-to)678-684
Number of pages7
JournalLecture Notes in Computer Science
Volume2658
DOIs
StatePublished - 2003

Fingerprint

Dive into the research topics of 'Algorithms for all-pairs reliable quickest paths'. Together they form a unique fingerprint.

Cite this