Thomas Karagiannis, Mart Molle, and Michalis Faloutsos
Self-similarity and scaling phenomena have dominated Internet traffic analysis for the past decade.With the identification of long-range dependence (LRD) in network traffic, the research community has undergone a mental shift from Poisson and memory-less processes to LRD and bursty processes. Despite its widespread use, though, LRD analysis is hindered by our difficulty in actually identifying dependence and estimating its parameters unambiguously.The authors outline LRD findings in network traffic and explore the current lack of accuracy and robustness in LRD estimation. In addition, the authors present recent evidence that packet arrivals appear to be in agreement with the Poisson assumption in the Internet core.
In IEEE Internet Computing
Publisher IEEE Computer Society
Copyright © 2007 IEEE. Reprinted from IEEE Computer Society. This material is posted here with permission of the IEEE. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.