Theory and practice of non-intrusive active network measurements

作者: Randy H. Katz , Sridhar Machiraju

DOI:

关键词:

摘要: Today's data networks are highly distributed and enormous in scale. The ability to measure them is vital both network operators end-users. Network measurement methods can broadly be classified into passive that rely on collected at routers, active based observations of actively-injected probe packets. Active measurements, the focus this dissertation, attractive end-users who, under current architecture, cannot access any routers. use measurements because they easy conduct, have low overhead and, contrast collection methods, exactly what normal packets experience. most significant disadvantage limited accuracy has typically been achievable using them. One main reasons for need non-intrusive, thus leaving measured systems uninfluenced by observation, fundamentally affecting accuracy. In we rigorous theoretical analysis understand impact non-intrusiveness investigate how theory translates practice. Our investigation consists three parts. In first, sampling-related issues, i.e., when do send why? starting point conventional wisdom says "Poisson Arrivals See Time Averages (PASTA)" principle implies Poisson probing. We show PASTA does not imply probing optimal it ignores bias caused intrusiveness estimation variance. Using simulations, motivate rare probing, preferably so-called mixing epochs, as a sound practical strategy. second part, if observed delays (non-intrusive) pairs used estimate cross-traffic properties single-hop case. inability prior works [SKK03] without hard-to-achieve timing control. derive estimated, theory, that, well-motivated assumption, non-intrusive entire distribution an intra-pair interval. third part motivated apparent difficulty designing robust multi-hop queueing effects; experience first-hand with our estimators. novel hop-dependent priority primitives design Measurement-Friendly Networks (MFNs), which accurate effects, performed. only simplify management tasks but also easily deployable. exploring MFNs, find nonpreemption persistence cause unavoidable inaccuracies represent, sense, fundamental limitations measurements.

参考文章(67)
V. Jacobson, Pathchar : A Tool to Infer Characteristics of Internet Paths ftp://ftp.ee.lbl.gov/pathchar. ,(1997)
François Baccelli, Pierre Brémaud, Elements of queueing theory ,(1994)
Srinivasan Keshav, Packet-Pair Flow Control ,(2003)
Paul Glasserman, Yu-Chi Ho, Gradient Estimation Via Perturbation Analysis ,(1990)
Xilian Liu, K. Ravindran, D. Loguinov, What signals do packet-pair dispersions carry? international conference on computer communications. ,vol. 1, pp. 281- 292 ,(2005) , 10.1109/INFCOM.2005.1497899
Rudolf H. Riedi, Shriram Sarvotham, Richard G. Baraniuk, Mark J. Coates, Vinay Joseph Ribeiro, Brent Hendricks, Multifractal Cross-Traffic Estimation ITC Conference on IP Traffic, Modeling and Management. ,(2000)
Les Cottrell, pathChirp: Efficient available bandwidth estimation for network paths Proc. Passive and Active Measurements Workshop, Apr. 2003. ,(2003) , 10.2172/813038
B. Melander, M. Bjorkman, P. Gunningberg, A new end-to-end probing and analysis method for estimating bandwidth bottlenecks global communications conference. ,vol. 1, pp. 415- 420 ,(2000) , 10.1109/GLOCOM.2000.892039
R Carter, Measuring bottleneck link speed in packet-switched networks Performance Evaluation. ,vol. 27, pp. 297- 318 ,(1996) , 10.1016/0166-5316(96)00036-3
Z. Wang, M. Carlson, W. Weiss, D. Black, S. Blake, E. Davies, An Architecture for Differentiated Service RFC 2475. ,vol. 2475, pp. 1- 36 ,(1998)