On the statistical characterization of flows in Internet traffic with application to sampling

被引:9
作者
Chabchoub, Yousra [1 ]
Fricker, Christine [1 ]
Guillemin, Fabrice [2 ]
Robert, Philippe [1 ]
机构
[1] INRIA Rocquencourt, RAP Project, F-78153 Le Chesnay, France
[2] Orange Labs, F-22300 Lannion, France
关键词
Flow statistics; Statistical models; Pareto distribution; Poisson approximation;
D O I
10.1016/j.comcom.2009.08.006
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A new method of estimating some statistical characteristics of TCP flows in the Internet is developed in this paper. For this purpose, a new set of random variables (referred to as observables) is defined. When dealing with sampled traffic, these observables can easily be computed from sampled data. By adopting a convenient mouse/elephant dichotomy also dependent on traffic, it is shown how these variables give a reliable statistical representation of the number of packets transmitted by large flows during successive time intervals with an appropriate duration. A mathematical framework is developed to estimate the accuracy of the method. As an application, it is shown how one can estimate the number of large TCP flows when only sampled traffic is available. The algorithm proposed is tested against experimental data collected from different types of IP networks. (c) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:103 / 112
页数:10
相关论文
共 23 条
[1]   Wavelet analysis of long-range-dependent traffic [J].
Abry, P ;
Veitch, D .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :2-15
[2]  
BARAKAT C, 2002, P ACM SIGCOMM INT ME
[3]  
Barbour A.D., 1992, Poisson approximation
[4]  
Ben Azzouna N, 2004, ANN TELECOMMUN, V59, P1260
[5]  
BENAZZOUNA N, 2005, P ICC 2005 SEOUL KOR
[6]  
CHABCHOUB Y, 2007, P ITC 20 JUN
[7]  
*CISCO, INTR CISC IOS NETFLO
[8]  
Crovella M., 1997, IEEE ACM T NETWORK, P835
[9]  
DEUFLHARD P, 2003, TEXTS APPL MATH
[10]   Estimating flow distributions from sampled flow statistics [J].
Duffield, N ;
Lund, C ;
Thorup, M .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (05) :933-946