Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed Information (1992)
| Venue: | IN PROC. 2ND ORSA TELECOMMUNICATIONS CONFERENCE |
| Citations: | 15 - 1 self |
BibTeX
@INPROCEEDINGS{Korilis92whyis,
author = {Yannis A. Korilis and Aurel A. Lazar},
title = {Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed Information},
booktitle = {IN PROC. 2ND ORSA TELECOMMUNICATIONS CONFERENCE},
year = {1992},
publisher = {}
}
OpenURL
Abstract
Flow control has been studied since the early stages of research in telecommunication networks. In these early studies the term flow control has been used to describe almost any type of network control. With the rapid growth of telecommunication networks control and management, flow control has evolved as a distinct class of algorithms and substantial research effort has been devoted to its study. An extensive survey of the most representative of these efforts is presented in this paper. The motivation for this work is the need for of a thorough, deep understanding of the flow control problem in gigabit, multiclass networks. A broad class of flow control schemes, namely optimal flow control, is considered within a game theoretic framework. The class of adaptive flow control mechanisms is not presented extensively, but valuable insight about the performance of such schemes can be gained from the study of optimal flow control policies. A number of important efforts to define and study fa...







