On algorithms for quickest paths under different routing modes

IEICE Transactions on Communications

Volumn E87-B, Issue 4, 2004, Pages 1002-1006

  Rao, Nageswara S V ^a   Grimmell, William C ^a   Bang, Young Cheol ^b   Radhakrishnan, Sridhar ^c  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

^b Korea Polytechnic University   (South Korea)

^c University of Oklahoma   (United States)

Author keywords

End to end delay; Message forwarding mechanisms; Path computation; Quickest path problem

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL METHODS; PROBLEM SOLVING; QUALITY OF SERVICE; RELIABILITY; ROUTERS; SET THEORY; SWITCHING CIRCUITS; THEOREM PROVING; WIDE AREA NETWORKS;

CIRCUIT SWITCHING; END-TO-END DELAY; MESSAGE FORWARDING MECHANISMS; PATH COMPUTATION; QUICKEST PATH PROBLEM;

NETWORK PROTOCOLS;

EID: 2342613621     PISSN: 09168516     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. Y.L. Chen and Y.H. Chin, "The quickest path problem," Comput. Oper. Res., vol.17, no.2, pp.153-161, 1990.
2. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, 1990.
3. R.A. Guerin and A. Orda, "Qos routing in networks witrh inaccurate information: Theory and algorithms," IEEE/ACM Trans. Netw., vol.7, no.3, pp.350-364, 1999.
4. G. Huston, Internet Performance Survival Guide: Basic Mechanisms and Directions, John Wiley & Sons, 2000.
5. N.S.V. Rao, "NetLets for end-to-end delay minimization in distributed computing over Internet using two-paths," Int. J. High Performance Computing Applications, vol.16, no.3, pp.285-292, 2002.
6. N.S.V. Rao, "Overlay networks of in-situ instruments for probabilistic guarantees on message delays in wide-area networks," IEEE J. Sel. Areas Commun., vol.22, no.1, 2004.
7. N.S.V. Rao, Y.C. Bang, S. Radhakrishnan, Q. Wu, S.S. Iyengar, and H. Cho, "Netlets: Measurement-based routing daemons for low end-to-end delays over networks," Comput. Commun., vol.26, no.8, pp.834-844, 2003.
8. N.S.V. Rao and S.G. Batsell, "Algorithm for minimum end-to-end delay paths," IEEE Commun. Lett., vol.1, no.5, pp.152-154, 1997.
9. N.S.V. Rao and S.G. Batsell, "QoS routing via multiple paths using bandwidth reservation," IEEE INFOCOM98: Conference on Computer Communications, vol.1, pp.11-18, 1998.
10. N.S.V. Rao, W.C. Grimmell, S. Radhakrishnan, and Y.C. Bang, "Quickest paths for different network router mechanisms," Technical Report ORNL/TM-2000/208, Oak Ridge National Laboratory, Oak Ridge, TN, 2000.
11. J.B. Rosen, S.Z. Sun, and G.L. Xue, "Algorithms for the quickest path problem and the enumeration of quickest paths," Comput. Oper. Res., vol.18, no.6, pp.579-584, 1991.
12. Z. Wang, Internet QoS, Morgan Kaufman Pub., 2001.
13. G. Xue, "End-to-end data paths: Quickest or most reliable?," IEEE Commun. Lett., vol.2, no.6, pp.156-158, 1998.
14. G. Xue and S. Sun, "Optimal multicast trees in communication systems with channel capabilities and channel reliabilities," IEEE Trans. Commun., vol.47, no.5, pp.662-663, 1999.
15. G. Xue, S. Sun, and J.B. Rosen, "Fast data transmission and maximal dynamic flow," Inf. Process. Lett., vol.66, pp. 127-132, 1998.