Measurement of flow burstiness by fractal technique

Burstiness is an important network feature. Many studies apply crude methods using “burst” or flow size to diagnose bursty flows, but these approaches cannot reveal traffic details. Using the self-similarity of network flow, the study transforms the time-domain traffic into space-domain data, and adopts the variations of fractal dimensions to determine the variations of burstiness. The resulting variations of burstiness indicate the irregular situation of network. Experimental results show that the variation of the fractal dimension is proportional to the variation of burstiness. Thus, a variation that exceeds a pre-defined threshold indicates irregular traffic. Triggering a simple alarm upon detecting irregular traffic can ameliorate the following traffic. Therefore, the proposed method is an effective gauge for flow monitoring because it watches the fractal dimensions derived from network traffic. The proposed method can help network administrators monitor traffic in detail and better manage their networks.

[1]  T. Nakashima,et al.  Simulation Based Analysis of Queueing Property for Continuous Self-Similar Traffic , 2008, 2008 3rd International Conference on Innovative Computing Information and Control.

[2]  Toshinori Sueyoshi,et al.  Analysis of Queueing Property for Self-Similar Traffic , 2008, 22nd International Conference on Advanced Information Networking and Applications (aina 2008).

[3]  Vern Paxson,et al.  Fast, approximate synthesis of fractional Gaussian noise for generating self-similar network traffic , 1997, CCRV.

[4]  Dietmar Saupe,et al.  Chaos and fractals - new frontiers of science , 1992 .

[5]  Christophe Diot,et al.  Pop-level and access-link-level traffic dynamics in a tier-1 POP , 2001, IMW '01.

[6]  Richard G. Baraniuk,et al.  Connection-level analysis and modeling of network traffic , 2001, IMW '01.

[7]  Larry Peterson,et al.  Inter-AS traffic patterns and their implications , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[8]  Zahir Tari,et al.  Modeling the burstiness of TCP , 2004, The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings..

[9]  Chuang Liu,et al.  Analysis of frame traffic characteristics in IEEE 802.11 networks , 2009, 2009 Fourth International Conference on Communications and Networking in China.

[10]  Benoit B. Mandelbrot,et al.  Fractal Geometry of Nature , 1984 .

[11]  Hartmut Jürgens,et al.  Chaos and Fractals: New Frontiers of Science , 1992 .

[12]  John Heidemann,et al.  On the correlation of Internet flow characteristics , 2003 .

[13]  Qian Du,et al.  A New Box-Counting Method for Estimation of Image Fractal Dimension , 2006, 2006 International Conference on Image Processing.

[14]  B. Mandelbrot.  How Long Is the Coast of Britain? Statistical Self-Similarity and Fractional Dimension , 1967, Science.

[15]  J. Brickmann.  B. Mandelbrot: The Fractal Geometry of Nature, Freeman and Co., San Francisco 1982. 460 Seiten, Preis: £ 22,75. , 1985 .

[16]  Ming Chen,et al.  A Novel Traffic Model for the Analysis of Network Traffic Characteristic , 2007, Second International Conference on Innovative Computing, Informatio and Control (ICICIC 2007).

[17]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[18]  Donald F. Towsley,et al.  Modeling, simulation and measurements of queuing delay under long-tail internet traffic , 2003, SIGMETRICS '03.

[19]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[20]  Kun-Chan Lan,et al.  A measurement study of correlations of Internet flow characteristics , 2006, Comput. Networks.

[21]  Steven H. Low,et al.  Packet Loss Burstiness: Measurements and Implications for Distributed Applications , 2007, 2007 IEEE International Parallel and Distributed Processing Symposium.