Kherani, Arzad A and Kumar, Anurag (2003) Closed Loop Analysis of the Bottleneck Buffer under Adaptive Window Controlled Transfer of HTTP-Like Traffic. In: 22nd Annual Joint Conference on the IEEE Computer and Communications Societies:INFOCOM' 03, Vol.2, Mar 30-Apr 3, San Francisco, CA, United States, pp. 906-915.
We consider an Internet link carrying http-like traffic, i.e., transfer of finite volume files starting at random time instants. These file transfers are controlled by an adaptive window protocol (AWP); an example of such a protocol is TCP. We provide an analysis for the auto-covariance function of the AWP controlled traffic into the link’s buffer; this traffic, in general, is not an on-off process. The analysis establishes that, for Pareto distributed file sizes with infinite second moment, the traffic into the link buffer is long range dependent (LRD). We also develop an analysis for obtaining the stationary distribution of the link buffer occupancy under an AWP controlled transfer of files sampled from some distribution. The analysis provides a necessary and a sufficient condition for the finiteness of the mean link buffer content; these conditions have explicit dependence on the AWP used and the file size distribution. This establishes the sensitivity of the buffer occupancy process to the file size distribution. Combining the results from the above analyses, we provide an example in which the closed loop control of an AWP results in finite mean link buffer occupancy even though the file sizes are Pareto distributed (with infinite second moment), and the traffic into the link buffer is long range dependent. The significance of this work is threefold: (i) it provides a framework for analysing various processes related to the link buffer under AWP controlled transfer of files with a general file size distribution; (ii) it indicates that the buffer behaviour in the Internet may not be as poor as predicted from an open loop analysis of a queue fed with LRD traffic; and (iii) it shows that the buffer behaviour (and hence the throughput performance for finite buffers) is sensitive to the distribution of file sizes.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Keywords:||Long range dependent traffic;Models for TCP;Processor sharing queue|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||25 Aug 2008|
|Last Modified:||19 Sep 2010 04:36|
Actions (login required)