Theory and practice of non-intrusive active network measurements

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

[1]  D. P. Gaver,et al.  First-order autoregressive gamma sequences and point processes , 1980, Advances in Applied Probability.

[2]  Mary Baker,et al.  Measuring link bandwidths using a deterministic model of packet delay , 2000, SIGCOMM 2000.

[3]  Wei Wei,et al.  Classification of access network types: Ethernet wireless LAN, ADSL, cable modem or dialup? , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[4]  Jia Wang,et al.  Locating internet bottlenecks: algorithms, measurements, and implications , 2004, SIGCOMM 2004.

[5]  Paul Barford,et al.  Network radar: tomography from round trip time measurements , 2004, IMC '04.

[6]  Peter Steenkiste,et al.  Evaluation and characterization of available bandwidth probing techniques , 2003, IEEE J. Sel. Areas Commun..

[7]  Gennady Samorodnitsky,et al.  Long Range Dependence , 2007, Found. Trends Stoch. Syst..

[8]  Anees Shaikh,et al.  An empirical evaluation of wide-area internet bottlenecks , 2003 .

[9]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM 2000.

[10]  Aleksandar Kuzmanovic,et al.  Measuring service in multi-class networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[11]  Parameswaran Ramanathan,et al.  What do packet dispersion techniques measure? , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  M. Gerla,et al.  CapProbe: a simple and accurate capacity estimation technique , 2004, SIGCOMM.

[13]  Darryl Veitch,et al.  Active probing using packet quartets , 2002, IMW '02.

[14]  A. Pasztor,et al.  The packet size dependence of packet pair like methods , 2002, IEEE 2002 Tenth IEEE International Workshop on Quality of Service (Cat. No.02EX564).

[15]  Srinivasan Keshav,et al.  Packet-Pair Flow Control , 2003 .

[16]  Manish Jain,et al.  Ten fallacies and pitfalls on end-to-end available bandwidth estimation , 2004, IMC '04.

[17]  Raj Jain,et al.  A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks , 1989, CCRV.

[18]  Dmitri Loguinov,et al.  What signals do packet-pair dispersions carry? , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[19]  Jean-Chrysotome Bolot End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM 1993.

[20]  Vern Paxson,et al.  Strategies for sound internet measurement , 2004, IMC '04.

[21]  Richard G. Baraniuk,et al.  Multifractal Cross-Traffic Estimation , 2000 .

[22]  Robert B. Cooper,et al.  Queueing systems, volume II: computer applications : By Leonard Kleinrock. Wiley-Interscience, New York, 1976, xx + 549 pp. , 1977 .

[23]  Van Jacobson,et al.  A tool to infer characteristics of internet paths , 1997 .

[24]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

[25]  Leonard Kleinrock,et al.  Queueing Systems: Volume I-Theory , 1975 .

[26]  C. J. Stone,et al.  A Course in Probability and Statistics , 1995 .

[27]  Vern Paxson End-to-end internet packet dynamics , 1999, TNET.

[28]  Konstantina Papagiannaki,et al.  Bridging router performance and queuing theory , 2004, SIGMETRICS '04/Performance '04.

[29]  François Baccelli,et al.  Elements Of Queueing Theory , 1994 .

[30]  Manish Jain,et al.  End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput , 2003, IEEE/ACM Trans. Netw..

[31]  R. Durrett Probability: Theory and Examples , 1993 .

[32]  Saikat Guha,et al.  Utilizing spare network bandwidth to improve TCP performance , 2004 .

[33]  Ward Whitt,et al.  On Arrivals That See Time Averages , 1990, Oper. Res..

[34]  Paul Glasserman,et al.  Gradient Estimation Via Perturbation Analysis , 1990 .

[35]  Arun Venkataramani,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tcp Nice: a Mechanism for Background Transfers , 2022 .

[36]  Ashok K. Agrawala,et al.  Study of Network Dynamics , 1993, Comput. Networks ISDN Syst..

[37]  Sridhar Machiraju,et al.  The role of PASTA in network measurement , 2006, SIGCOMM 2006.

[38]  Patrice Abry,et al.  Cluster processes: a natural language for network traffic , 2003, IEEE Trans. Signal Process..

[39]  D. Andersen,et al.  Resilient overlay networks , 2002, CCRV.

[40]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[41]  Darryl Veitch,et al.  On the scope of end-to-end probing methods , 2002, IEEE Communications Letters.

[42]  Daryl J. Daley,et al.  An Introduction to the Theory of Point Processes , 2013 .

[43]  Jitendra Padhye,et al.  Bandwidth estimation in broadband access networks , 2004, IMC '04.

[44]  Dmitri Loguinov,et al.  Multi-hop probing asymptotics in available bandwidth estimation: stochastic analysis , 2005, IMC '05.

[45]  Ratul Mahajan,et al.  User-level internet path diagnosis , 2003, SOSP '03.

[46]  Donald F. Towsley,et al.  Inferring network characteristics via moment-based estimators , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[47]  Vern Paxson End-to-end routing behavior in the internet , 2006, Comput. Commun. Rev..

[48]  S. Brumelle On the relation between customer and time averages in queues , 1971 .

[49]  Larry Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994, SIGCOMM 1994.

[50]  Vern Paxson,et al.  An architecture for large-scale Internet measurement , 1998, IEEE Commun. Mag..

[51]  Yin Zhang,et al.  On the constancy of internet path properties , 2001, IMW '01.

[52]  Mats Björkman,et al.  A new end-to-end probing and analysis method for estimating bandwidth bottlenecks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[53]  Mary Baker,et al.  Measuring bandwidth , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[54]  Karl Petersen Ergodic Theory , 1983 .

[55]  Vern Paxson,et al.  On estimating end-to-end network path properties , 2001, SIGCOMM LA '01.

[56]  Mark Crovella,et al.  Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.

[57]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[58]  Lixia Zhang,et al.  NETBLT: a high throughput transport protocol , 1987, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication.

[59]  Vern Paxson,et al.  Experiences with NIMI , 2002, Proceedings 2002 Symposium on Applications and the Internet (SAINT) Workshops.

[60]  Dmitri Loguinov,et al.  Single-hop probing asymptotics in available bandwidth estimation: sample-path analysis , 2004, IMC '04.

[61]  David L. Black,et al.  An Architecture for Differentiated Service , 1998 .

[62]  Mostafa H. Ammar,et al.  Poisson versus periodic path probing (or, does PASTA matter?) , 2005, IMC '05.

[63]  M. Frans Kaashoek,et al.  A measurement study of available bandwidth estimation tools , 2003, IMC '03.

[64]  George Varghese,et al.  The measurement manifesto , 2004, Comput. Commun. Rev..