Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
New directions in traffic measurement and accounting
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Properties and prediction of flow statistics from sampled packet streams
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A comparative study of different heavy tail index estimators of the flow size from sampled data
Proceedings of the first international conference on Networks for grid applications
On the statistical characterization of flows in Internet traffic with application to sampling
Computer Communications
Exploiting packet-sampling measurements for traffic characterization and classification
International Journal of Network Management
ACM SIGCOMM Computer Communication Review
| Hi-index | 0.00 |
Under the assumption that packets are sufficiently interleaved and the sampling rate is small, we show in this paper that those characteristics of flows like the number of packets, volume, etc. obtained through deterministic 1-out-of-k packet sampling is equivalent to random packet sampling with rate p = 1/k. In particular, under mild assumptions, the tail distribution of the total number of packets in a given flow can be estimated from the distribution of the number of sampled packets. Explicit theoretical bounds are then derived by using technical tools relying on bounds of Poisson approximation (Le Cam's Inequality) and refinements of the central limit theorem (Berry-Essen bounds). Experimental results from an ADSL traffic trace show good agreement with the theoretical results established in this paper.