Fast data transmission and maximal dynamic flow
References (12)
- et al.
On the quickest path problem
Inform. Process. Lett.
(1993) An algorithm for finding the k quickest paths in a network
Comput. Oper. Res.
(1993)Finding the k quickest simple paths in a network
Inform. Process. Lett.
(1994)- et al.
The quickest path problem
Comput. Oper. Res.
(1990) - et al.
Distributed algorithms for the quickest path problem
Parallel Comput.
(1992) - et al.
The all-pairs quickest path problem
Inform. Process. Lett.
(1993)
Cited by (10)
Fast and fine quickest path algorithm
2014, European Journal of Operational ResearchCitation Excerpt :Several authors have also developed some extensions to the QPP problem. See for example (Chen, 1993; Chen and Hung, 1993; Lee and Papadopoulou, 1993; Chen, 1994; Chen and Hung, 1994; Xue, 1998; Xue et al., 1998; Kagaris et al., 1999; Calvete and del-Pozo, 2003; Lin, 2003; Calvete, 2004;Rao, 2004; Pascoal et al., 2005; Pascoal et al., 2007; Ruzika and Thiemann, 2012). Furthermore, we show that our method outperforms the previous methods in the different extensive experiments that we carried out.
A label-setting algorithm for finding a quickest path
2004, Computers and Operations ResearchOptimal multichannel data transmission in computer networks
2003, Computer CommunicationsCitation Excerpt :The same example shows that the algorithm of Ref. [6] is also suboptimal. While the author was writing this paper, N.S.V. Rao also discovered the mistake in Ref. [29] independently [19]. The author would like to thank N.S.V. Rao for many helpful discussions.
On source-based route computation for quickest paths under dynamic bandwidth constraints
2003, International Journal of Foundations of Computer ScienceA novel method for delivering multimedia e-advertisement data base on use multi-path and multi-seed peer-to-peer-like approach
2014, Peer-to-Peer Networking and ApplicationsDistributed multicast multichannel paths
2012, Telecommunication Systems
- ∗
The research of this author was supported in part by the US Army Research Office grant DAAH04-96-1 -0233 and by the National Science Foundation grants ASC-9409285 and OSR-9350540.