A survey on statistical bandwidth sharing
The paper provides a survey of recent results on the performance of a network handling elastic data traffic under the assumption that flows are generated as a random process. We notably highlight the insensitivity results allowing a relatively simple expression of performance when bandwidth sharing realizes so-called balanced fairness. In normal load conditions flow throughput mainly depends on the users' access line rate. There is little scope for optimizing performance, by means of size-dependent scheduling on network links, for instance. In overload, performance deteriorates rapidly. Pro-active admission control is then an arguably necessary traffic control to preserve performance. This paper is written as a tribute to the author's friend Olga Casals.
balanced fairness admission control internet traffic theory elastic traffic processor sharing