By Topic

On the limitations of the variance-time test for inference of long-range dependence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Krunz, M. ; Dept. of Electr. & Comput. Eng., Arizona Univ., Tucson, AZ, USA

The objective of this paper is to demonstrate the limitations of the variance-time (VT) test as a statistical tool for inferring long-range dependence (LRD) in network traffic. Since the early Bellcore studies, LRD has been in the center of a continuous debate within the teletraffic community. The controversy is typically focused on the utility of LRD models to predict the performance at network buffers. Our work here is not meant to advocate one modeling approach over another, but to point out (experimentally and theoretically) to the caveats in using the VT test as a tool for detecting LRD. We do that by deriving simple analytical expressions for the slope of the aggregated variance in three autocorrelated traffic models: M/G/∞ process (short-range dependent (SRD) but non-Markovian), the discrete autoregressive of order one model (SRD Markovian), and the fractional ARIMA process (LRD). Our main result is that the VT test often indicates, falsely, the existence of an LRD structure (i.e., H>0.5) in synthetically generated traces from the two SRD models. The bias in the VT test, however, diminishes monotonically with the length of the trace. We provide some guidelines on selecting the minimum trace length so that the bias is negligible

Published in:

INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE  (Volume:3 )

Date of Conference: