Statistical bandwidth sharing
- 27 August 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 31 (4) , 111-122
- https://doi.org/10.1145/383059.383068
Abstract
In this paper we study the statistics of the realized throughput of elastic document transfers, accounting for the way network bandwidth is shared dynamically between the randomly varying number of concurrent flows. We first discuss the way TCP realizes statistical bandwidth sharing, illustrating essential properties by means of packet level simulations. Mathematical flow level models based on the theory of stochastic networks are then proposed to explain the observed behavior. A notable result is that first order performance (e.g., mean throughput) is insensitive with respect both to the flow size distribution and the flow arrival process, as long as "sessions" arrive according to a Poisson process. Perceived performance is shown to depend most significantly on whether demand at flow level is less than or greater than available capacity. The models provide a key to understanding the effectiveness of techniques for congestion management and service differentiation.Keywords
This publication has 15 references indexed in Scilit:
- Fixed point approximations for TCP behavior in an AQM networkPublished by Association for Computing Machinery (ACM) ,2001
- Impact of fairness on Internet performancePublished by Association for Computing Machinery (ACM) ,2001
- Insensitivity results in statistical bandwidth sharingTeletraffic Science and Engineering, 2001
- Dimensioning bandwidth for elastic traffic in high-speed data networksIEEE/ACM Transactions on Networking, 2000
- Characteristics of TCP Connection ArrivalsPublished by Wiley ,2000
- Rate control for communication networks: shadow prices, proportional fairness and stabilityJournal of the Operational Research Society, 1998
- Wide area traffic: the failure of Poisson modelingIEEE/ACM Transactions on Networking, 1995
- Sharing a Processor Among Many Job ClassesJournal of the ACM, 1980
- The multiple phase service network with generalized processor sharingActa Informatica, 1979
- Open, Closed, and Mixed Networks of Queues with Different Classes of CustomersJournal of the ACM, 1975