Abstract
Routing in the Internet is based on the best-effort mechanism, wherein a router forwards a packet to minimize the number of hops to the destination. Also in the Internet, all packets are treated the same independent of their size. We propose the framework of NetLets to enable the applications to send data packets to the destination with certain guarantees on the end-to-end delay. NetLets employ built-in instruments to measure the bandwidths and propagation delays on the links, and compute the minimum end-to-end delay paths for data packets of various sizes. Based on our experiments, the paths selected by our system using the measurements are indeed the minimum end-toend delay paths, and our method outperformed the best-effort mechanism based on the hop count.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Active networks, http://www.sds.lcs.mit.edu/activeware
Y. C. Bang, S. Radhakrishnan, N. S. V. Rao, and S. G. Batsell, “On update algorithms for quickest paths,” Computer Communications, vol. 23, no. 11, pp. 1064–1068, 2000.
B. E. Carpenter and D. D. Kandlur, Diversifying Internet delivery, IEEE Spectrum, Nov 1999, pp. 57–61.
Y. L. Chen and Y. H. Chin, “The quickest path problem,” Computers and Operations Research, vol. 17 no. 2, pp. 153–161, 1990.
A. Collins, “The Detour Framework for Packet Rerouting,” Technical Report, University of Washington, October 1998.
A. Dutta-Roy, The cost of quality in Internet-style networks, IEEE Spectrum, September 2000, pp. 57–62.
V. Paxson, “End-to-End Routing Behavior in the Internet,” IEEE/ACM Transactions on Networking, vol. 5, no. 5, pp. 601–615, October 1997.
V. Paxson, G. Almes, J. Mahdavi, and M. Mathis, “Framework for IP Performance Metrics,” Network Working Group, RFC 2330, May 1998.
L. Peterson and B. Davie, “Computer Networks: A Systems Approach,” Second Edition, Morgan Kaufmann Publishers, 2000.
N. S. V. Rao and S. G. Batsell, “Algorithm for minimum end-to-end delay paths,” IEEE Communication Letters, vol. 1, no. 5, pp. 152–154, 1997.
N. S. V. Rao and S. G. Batsell, “On routing algorithms with end-to-end delay guarantees,” in the proceedings of IC3N: International Conference on Computer Communications and Networks, pp. 162–167, 1998.
N. S. V. Rao and S. G. Batsell, “QoS routing via multiple paths using bandwidth reservation,” in the proceedings of IEEE INFOCOM98: The Conference on Computer Communications, volume 1, pp. 11–18, 1998.
N. S. V. Rao, W. C. Grimmell, S. Radhakrishan and Y. C. Bang, Quickest paths for different network router mechanisms, Tech. Rep. ORNL-TM-2000/208, Oak Ridge National Laboratory, June 2000.
N. S. V. Rao, NetLets: End-to-end QoS mechanisms for distributed computing in wide-area networks using two-paths, http://saturn.epm.ornl.gov/~nrao.
N. S. V. Rao, End-to-end delay guarantees in computer networks: Analysis and NetLet implementation, ORNL Draft, http://saturn.epm.ornl.gov/~nrao.
J. B. Rosen, S. Z. Sun, and G. L. Xue, “Algorithms for the quickest path problem and the enumeration of quickest paths,” Computers and Operations Research, vol.18, no. 6, pp. 579–584, 1991.
S. Savage, T. Anderson, A. Aggarwal, D. Becker, N. Cardwell, A. Collins, E. Hoffman, J. Snell, A. Vahdat, G. Voelker, and J. Zahorjan, “Detour: Informed Internet Routing and Transport,” IEEE Micro, vol. 19. no. 1, pp. 50–59, January1999.
Web100 Concept Paper, http://www.web100.org
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rao, N.S.V., Radhakrishnan, S., Choel, BY. (2001). NetLets: Measurement-Based Routing for End-to-End Performance over the Internet. In: Lorenz, P. (eds) Networking — ICN 2001. ICN 2001. Lecture Notes in Computer Science, vol 2093. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47728-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-47728-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42302-7
Online ISBN: 978-3-540-47728-0
eBook Packages: Springer Book Archive