On transport daemons for small collaborative applications over wide-area networks

Conference Proceedings of the IEEE International Performance, Computing, and Communications Conference

Volumn , Issue , 2005, Pages 159-166

  Wu, Qishi ^a   Rao, Nageswara S V ^a   Iyengar, S Sitharama ^b  

^a OAK RIDGE NATIONAL LABORATORY   (United States)

^b Louisiana State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET NODES; IP PATHS;

BANDWIDTH; INTERNET; NETWORK PROTOCOLS;

WIDE AREA NETWORKS;

EID: 28444431602     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to algorithms, the MIT Press, 2000.
2. J. Curtis, T. McGregor, Review of bandwidth estimation techniques. New Zealand Computer Science Research Students' Conference, University of Canterbury, New Zealand, 19-20th April 2001.
3. C. Dovrolis, P. Ramanathan, D. Moore, Packet dispersion techniques and capacity estimation. Submitted to the IEEE/ACM Transactions in Networking, 2002.
4. V. V. Fedorov, D. Flanagan, T. Rowan, and S. G. Batsell, Analysis and monitoring design for networks, Technical Report, ORNL-TM-13620, Oak Ridge National Laboratory, 1998.
5. V. V. Fedorov and P. Hackl, Model-oreinted design of experiments, Springer-Verlag, Berlin 1997.
6. M. Jain, C. Dovrolis, End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput. Proceedings of ACM SIGCOMM, August 2002.
7. N. S.V. Rao, Vector space methods for sensor fusion problems, Optical Engineering, vol 37, no. 2, pp. 499-504, 1988.
8. N. S.V. Rao, On design of measurements for end-to-end delay minimization in wide-area networks, the 9th International Conference on Advanced Computing and Communications, 2001.
9. N. S.V. Rao, NetLets for end-to-end delay minimization in distributed computing over Internet using two-Paths, International Journal of High Performance Computing Applications, 2002, vol. 16, no. 3, 2002.
10. N. S.V. Rao, Overlay networks of in-situ instruments for probabilistic guarantees on message delays in wide-area networks, IEEE Journal on Selected Areas of Communications, vol 22, no. 1, 2004.
11. 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, Computer Communications, vol. 26, no. 8, pp. 834-844, 2003.
12. N. S.V. Rao, S.G. Batsell, Algorithm for minimum end-to-end delay paths, IEEE Communications Letters, 1999.
13. N. S.V. Rao, W. C. Grimmell, Y.C. Bang, S. Radhakrishnan, On algorithms for quickest paths under different routing modes, to appear in IEICE Transations on Communications, 2004.
14. V. Vapnik, Nature of Statistical Learning, Springer-Verlag, 1996.
15. Q. Wu, Control of Transport Dynamics in Overlay Networks, Ph.D. Dissertation, Dept of Computer Science, Louisiana State University, May 2003.
16. Terascale Supernova Initiative, http://tsi.phys.ornl.gov
17. Y. L. Chen and Y. H. Chin, The quickest path problem, Computers and Operations Research, vol. 17, no. 2, pp. 153-161, 1990.