Deterministic versus probabilistic packet sampling in the Internet

Abstract : 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, volu me, etc. obtained through deterministic 1-out-of-$k$ packet sampling is equivalent to random packe t sampling with rate $p=1/k$. In particular, it is shown that under mild assumptions, the ta il 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 trace show a good agreement with the theoretical results established in this paper.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00130394
Contributor : Philippe Robert <>
Submitted on : Monday, February 12, 2007 - 10:06:50 AM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Wednesday, April 7, 2010 - 2:45:47 AM

Files

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00130394, version 1

Collections

Citation

Yousra Chabchoub, Christine Fricker, Fabrice Guillemin, Philippe Robert. Deterministic versus probabilistic packet sampling in the Internet. 20th International Teletraffic Congress - ITC 20, Jun 2007, Ottawa / Canada. ⟨inria-00130394⟩

Share

Metrics

Record views

208

Files downloads

209