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, 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Azzouna, N.B., Clérot, F., Fricker, C., Guillemin, F.: A flow-based approach to modeling ADSL traffic on an IP backbone link. Annals of Telecommunications 59(11-12), 1260–1299 (2004)
Azzouna, N.B., Guillemin, F., Poisson, S., Robert, P., Fricker, C., Antunes, N.: Inverting sampled ADSL traffic. In: Proc. ICC 2005, Seoul, Korea (May 2005)
Barbour, A.D., Holst, L., Janson, S.: Poisson approximation, p. 277. The Clarendon Press Oxford University Press, New York (1992)
Chabchoub, Y., Fricker, C., Guillemin, F., Robert, P.: Bounds for packet sampling in the Internet (In preparation)
Choi, B.Y., Park, J., Zhang, Z.L.: Adaptive packet sampling for accurate and scalable flow measurement. In: Proc. Globecom’04, Dallas, TX (December 2004)
Duffield, N., Lund, C., Thorup, M.: Properties and prediction of flow statistics. In: ACM SIGCOMM Internet Measurement Workshop, November 2002, pp. 6–8. ACM Press, New York (2002)
Estan, C., Keys, K., Moore, D., Varghese, G.: Building a better NetFlow. In: Proc. ACM Sigcomm’04, Portland, Oregon, USA, August 30 – September 3 2004, ACM Press, New York (2004)
Estan, C., Varghese, G.: New directions in traffic measurement and accounting. In: Proc. Sigcomm’02, Pittsburgh, Pennsylvania, USA, August 19-23 (2002)
Feller, W.: An introduction to probability theory and its applications. John Wiley and Sons, Chichester (1996)
IETF, IPFIX Working Group. IP flow information export. For information, see the url http://www.ietf.org/html.charters/ipfix-charter.html
IETF, PSAMP Working Group. Packet sampling working group. See the url https://ops.ietf.org/lists/psamp
Papagiannaki, K., Taft, N., Bhattachayya, S., Thiran, P., Salamatian, K., Diot, C.: On the feasibility of identifying elephants in Internet backbone traffic. Technical Report TR01-ATL-110918, Sprint Labs, Sprint ATL (November 2001)
Paxson, V., Floyd, S.: Wide area traffic: The failure of the Poisson assumption. IEEE/ACM Trans. on Networking, 226–244 (1995)
Zseby, T., Molina, M., Duffield, N., Niccolini, S., Raspall, F.: Sampling and filtering techniques for IP packet selection (January 2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chabchoub, Y., Fricker, C., Guillemin, F., Robert, P. (2007). Deterministic Versus Probabilistic Packet Sampling in the Internet. In: Mason, L., Drwiega, T., Yan, J. (eds) Managing Traffic Performance in Converged Networks. ITC 2007. Lecture Notes in Computer Science, vol 4516. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72990-7_60
Download citation
DOI: https://doi.org/10.1007/978-3-540-72990-7_60
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72989-1
Online ISBN: 978-3-540-72990-7
eBook Packages: Computer ScienceComputer Science (R0)