Abstract
Round trip delays constitute the basic network measure that can be obtained by end systems without any network support. Our aim is to design measurement-based admission control strategies for streaming applications based on such minimal feedback on network state. To this end we discuss simple statistical models of packet round trip delays accross either local or wide area networks. We observe that the delay component due to queueing scales like the reciprocal of the spare capacity, at least in a ‘heavy traffic’ regime where spare capacity is scarce. Our models also allow to capture the correlations between consecutive measurements. Based on these results we propose a two-stage strategy for inferring spare capacity along a network path. We show consistency of this estimate, and analyse its asymptotic variance when the number of samples becomes large. We have experimented these strategies in a local network environment. We observe a good match between theory and practice for switched Ethernets. Surprisingly, the match deteriorates only slightly when the network path comprises hubs, although the theoretical models seem to be less applicable to such technology.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Alouf, P. Nain and D. Towsley, Inferring Network Characteristics via Moment-Based Estimators, Proceedings of IEEE Infocom, 2001.
D. Bertsekas and R. Gallager, Data Networks. Prentice Hall 1992.
L. Breslau, E. Knightly and S. Shenker, Endpoint Admission Control: Architectural Issues and Performance, Proceedings of ACM Sigcomm, 2000.
R. Davidson and J.G. MacKinnon, Estimation and Inference in Econometrics, Oxford University Press, 1993.
M. Harrison, Brownian Motion and Stochastic Flow Systems, John Wiley and Sons, New York, 1985.
V. Jacobson, “pathchar”. Available at ftp://ftp.ee.lbl.gov/pathchar/.
M. Jain and C. Dovrolis, End-to-End Available Bandwidth: Measurement, Dynamics and Relation with TCP Throughput, Proceedings of ACM Sigcomm, 2002.
H. Jiang and C. Dovrolis, Passive Estimation of TCP Round-Trip Times, Sigcomm Computer Communication Review, Vol. 32, No. 1, 2002.
F. Kelly, Reversibility and Stochastic Networks, Wiley, Chichester, 1979.
F. Kelly, P. Key and S. Zachary, Distributed Admission Control, IEEE Journal on Selected Areas in Communications, Vol. 18, No. 12, 2000.
S. Keshav, Packet-pair flow control. Available at http://www.cs.cornell.edu/skeshav/doc/94/2-17.ps, 1994.
K. Lai and M. Baker, Nettimer: a tool for measuring bottleneck link bandwidth. Available at http://mosquitonet.stanford.edu/~laik/projects/nettimer.
T. Liggett, Interacting Particle Systems, Springer, Berlin, 1985.
K. Matoba, S. Ata and M. Murata, Improving Accuracy of Bandwidth Estimation for Internet Links by Statistical Methods, IEICE Transactions on Communications, Vol. E00-B, No. 6 June 2001.
K. Park and W. Willinger (Eds), Self-Similar Network Traffic and Performance Evaluation, Wiley, 2000.
M. Reiman, Open queueing networks in heavy traffic, Mathematics of Operations Research, Vol. 9, No. 3, pp. 441–458, 1984.
V. Ribeiro, M. Coates, R. Riedi, S. Sarvotham, B. Hendricks and R. Baraniuk, Multifractal Cross-Traffic Estimation, In Proceedings ITC Specialists Seminar, Monterey 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gunawardena, D., Key, P., Massoulié, L. (2003). Network Characteristics: Modelling, Measurements, and Admission Control. In: Jeffay, K., Stoica, I., Wehrle, K. (eds) Quality of Service — IWQoS 2003. IWQoS 2003. Lecture Notes in Computer Science, vol 2707. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44884-5_1
Download citation
DOI: https://doi.org/10.1007/3-540-44884-5_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40281-7
Online ISBN: 978-3-540-44884-6
eBook Packages: Springer Book Archive