Deterministic versus probabilistic packet sampling in the Internet - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Deterministic versus probabilistic packet sampling in the Internet

Yousra Chabchoub
Christine Fricker
  • Function : Author
  • PersonId : 831323

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.
Fichier principal
Vignette du fichier
main.pdf (305.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00130394 , version 1 (12-02-2007)

Identifiers

  • HAL Id : inria-00130394 , version 1

Cite

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⟩
70 View
145 Download

Share

Gmail Facebook X LinkedIn More