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 language | English |
---|---|
Pages (from-to) | 678-684 |
Number of pages | 7 |
Journal | Lecture Notes in Computer Science |
Volume | 2658 |
DOIs | |
State | Published - 2003 |