Self-Similarity of AQM Filtered Traffic

Self-similarity of network traffic is a well-known paradigm for more than a decade, now. Following the first realization of this property, it has been a popular issue to question if the self-similarity persisted with the changing network architectures and conditions. However, the effects of Active Queue Management (AQM) mechanisms over the self-similarity of network traffic have almost been left uninvestigated. AQM mechanisms are developed to aid congestion control over the network. Recently, they are applied to commercial routers and they have become notable alternatives to droptail queues. It is easy to foretell that their priority aware variants, e.g. RIO, will find application in heterogeneous networks in a nearby future. The main principle of all AQM mechanisms relies on the adaptive congestion control mechanism of Transport Control Protocol (TCP). TCP sources adapt their sending rates to network conditions by decreasing packet transmission rates during congestion. AQM mechanisms notify congestion to TCP sources more effectively than droptail queues where they start dropping packets before the queue actually overflows, in a way taking a precaution before “the disaster happens”. Obviously their different loss pattern will change the statistical properties of the traffic and the degree of selfsimilarity. For this reason we find the joint behavior of TCP and AQM mechanisms worth investigating. In this work, we run simulations in NS-2 to analyze the impacts of queue management mechanisms; droptail, RED and BLUE on the self-similarity of network traffic. The degree of self-similarity is measured by the Hurst parameter (H). We estimate H with three well known methods: Aggregated Variances, Higuchi and R/S methods. We additionally analyze the throughput, goodput, queuing delay and loss rate measurements for these queue management techniques. It is observed that the H estimates are correlated with throughput, goodput, queuing delay and loss rate. We show that droptail RED and BLUE yield different degrees of self-similarity. Furthermore, we examine RED and BLUE under different parameter settings and show that the parameter selection of AQM mechanisms affects the H estimates.

[1]  kc claffy,et al.  The nature of the beast: Recent traffic measurements from an Internet backbone , 1998 .

[2]  Biplab Sikdar,et al.  On reducing the degree of second-order scaling in network traffic , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[4]  T. Higuchi Approach to an irregular time series on the basis of the fractal theory , 1988 .

[5]  Walter Willinger,et al.  On the Self-Similar Nature of Ethernet Traffic ( extended version ) , 1995 .

[6]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[7]  Wu-chang Fengy,et al.  BLUE: A New Class of Active Queue Management Algorithms , 1999 .

[8]  Mel,et al.  Analyzing the Impact of Queue Management Policies on the Self-Similarity of Aggregate Network Traffic , 2004 .

[9]  Donald F. Towsley,et al.  On the autocorrelation structure of TCP traffic , 2002, Comput. Networks.

[10]  Anja Feldmann,et al.  Dynamics of IP traffic: a study of the role of variability and the impact of control , 1999, SIGCOMM '99.

[11]  Melike Erol-Kantarci,et al.  The influence of a single-tone sinusiod over hurst estimators , 2005, 2005 13th European Signal Processing Conference.

[12]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.

[13]  Jan Beran,et al.  Statistics for long-memory processes , 1994 .

[14]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[15]  Vinay J. Ribeiro Queuing analysis of long-range-dependent traffic , 1998 .