Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths
Computers and Operations Research
Algorithms for the constrained quickest path problem and the enumeration of quickest paths
Computers and Operations Research
NetLets: Measurement-Based Routing for End-to-End Performance over the Internet
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Probabilistic quickest path algorithm
Theoretical Computer Science
On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture
The Journal of Supercomputing
Reliability problem on all pairs quickest paths
ICCS'03 Proceedings of the 2003 international conference on Computational science
Algorithms for all-pairs reliable quickest paths
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartII
On bandwidth adjusted multicast in pipelined routing architecture for mobile environment
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
NetLets: measurement-based routing daemons for low end-to-end delays over networks
Computer Communications
| Hi-index | 0.25 |
The quickest path problem deals with the transmission of a message of size @s from a source to a destination with the minimum end-to-end delay over a network with bandwidth and delay constraints on the links. The path-table that maps all intervals for @s to the corresponding quickest paths can be computed in O(m^2+mnlogn) time, where n and m are the number of nodes and links of the network, respectively. We propose linear-time algorithms that update the path-table after a increase or decrease bandwidth of a link or a path, respectively.