Fundamental bounds on the accuracy of network performance measurements

This paper considers the basic problem of "how accurate can we make Internet performance measurements". The answer is somewhat counter-intuitive in that there are bounds on the accuracy of such measurements, no matter how many probes we can use in a given time interval, and thus arises a type of Heisenberg inequality describing the bounds in our knowledge of the performance of a network. The results stem from the fact that we cannot make independent measurements of a system's performance: all such measures are correlated, and these correlations reduce the efficacy of measurements. The degree of correlation is also strongly dependent on system load. The result has important practical implications that reach beyond the design of Internet measurement experiments, into the design of network protocols.

[1]  S. Wittevrongel,et al.  Queueing Systems , 2019, Introduction to Stochastic Processes and Simulation.

[2]  Darryl Veitch,et al.  Understanding end-to-end Internet traffic dynamics , 1998, IEEE GLOBECOM 1998 (Cat. NO. 98CH36250).

[3]  W. Whitt,et al.  Transient behavior of the M/M/1 queue via Laplace transforms , 1988, Advances in Applied Probability.

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

[5]  George S. Fishman,et al.  Statistical Analysis for Queueing Simulations , 1973 .

[6]  Tijana Timotijevic,et al.  Accuracy of measurement techniques supporting QoS in packet-based intranet and extranet VPNs , 2004 .

[7]  Anindya Basu,et al.  Routing using potentials: a dynamic traffic-aware routing algorithm , 2003, SIGCOMM '03.

[8]  W. Whitt.  Planning queueing simulations , 1989 .

[9]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[10]  Matthew J. Zekauskas,et al.  A One-way Delay Metric for IPPM , 1999, RFC.

[11]  Van Jacobson,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[12]  Matthew J. Zekauskas,et al.  A Round-trip Delay Metric for IPPM , 1999, RFC.

[13]  Vern Paxson,et al.  Measurements and analysis of end-to-end Internet dynamics , 1997 .

[14]  Donald F. Towsley,et al.  Estimation and removal of clock skew from network delay measurements , 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).

[15]  Ward Whitt,et al.  Transient behavior of the M/M/l queue: Starting at the origin , 1987, Queueing Syst. Theory Appl..

[16]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[17]  Tijana Timotijevic,et al.  Evaluating the Accuracy of Active Measurement of Delay and Loss in Packet Networks , 2003, MMNS.

[18]  W. D. Ray.  Queueing Systems. Vol. II—Computer Applications , 1977 .

[19]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[20]  Paul Barford,et al.  A Comparison of Probe-based and Router-based Methods for Measuring Packet Loss , 2003 .

[21]  Ward Whitt,et al.  Transient Behavior of the M/G/1 Workload Process , 1994, Oper. Res..

[22]  I. Richer,et al.  A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..

[23]  Matthew J. Zekauskas,et al.  A One-way Packet Loss Metric for IPPM , 1999, RFC.

[24]  Vern Paxson,et al.  IPPM Metrics for Measuring Connectivity , 1999, RFC.

[25]  Philip M. Morse,et al.  Stochastic Properties of Waiting Lines , 1955, Oper. Res..

[26]  George S. Fishman,et al.  The Analysis of Simulation-Generated Time Series , 1967 .

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

[28]  Scott Shenker,et al.  On the characteristics and origins of internet flow rates , 2002, SIGCOMM.

[29]  Ward Whitt,et al.  Asymptotic Formulas for Markov Processes with Applications to Simulation , 1992, Oper. Res..

[30]  Averill M. Law.  Efficient estimators for simulated queueing systems , 1974 .

[31]  Jan Beran,et al.  Statistics for long-memory processes , 1994 .

[32]  Jeffrey D. Case,et al.  Simple Network Management Protocol (SNMP) , 1990, RFC.

[33]  Lester Lipsky,et al.  Long-lasting transient conditions in simulations with heavy-tailed workloads , 1997, WSC '97.

[34]  R. Butterworth,et al.  Queueing Systems, Vol. II: Computer Applications. , 1977 .

[35]  Matthew Roughan,et al.  Measuring long-range dependence under changing traffic conditions , 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).

[36]  George S. Fishman,et al.  Estimating Sample Size in Computing Simulation Experiments , 1971 .

[37]  Vern Paxson,et al.  Framework for IP Performance Metrics , 1998, RFC.

[38]  Leonard Kleinrock,et al.  Theory, Volume 1, Queueing Systems , 1975 .

[39]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

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

[41]  Walter Willinger,et al.  Applications of Fractals in Engineering for Realistic Traffic Processes , 1994 .

[42]  W. Whitt,et al.  The correlation functions of rbm and m/m/1 , 1988 .