Making greed work in networks
- 1 October 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 24 (4) , 47-57
- https://doi.org/10.1145/190809.190319
Abstract
This paper discusses congestion control from a game-theoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user behavior depend crucially on the service disciplines implemented in network switches. This effect is investigated in a simple model consisting of a single exponential server shared by many Poisson sources. We discuss the extent to which one can guarantee, through the choice of switch service disciplines, that these selfish operating points will be efficient and fair. We also discuss to what extent the choice of switch service disciplines can ensure that these selfish operating points are unique and are easily and rapidly accessible by simple self-optimization techniques. We show that no service discipline can guarantee optimal efficiency. As for the other properties, we show that the traditional FIFO service discipline guarantees none of these properties, but that a service discipline called Fair Share guarantees all of them. While the treatment utilizes game-theoretic concepts, no previous knowledge of game theory is assumed.Keywords
This publication has 15 references indexed in Scilit:
- Serial Cost SharingEconometrica, 1992
- A game theoretic perspective to flow control in telecommunication networksJournal of the Franklin Institute, 1992
- Uniform externalitiesJournal of Public Economics, 1990
- A theoretical analysis of feedback flow controlPublished by Association for Computing Machinery (ACM) ,1990
- A binary feedback scheme for congestion avoidance in computer networksACM Transactions on Computer Systems, 1990
- A delay-based approach for congestion avoidance in interconnected heterogeneous computer networksACM SIGCOMM Computer Communication Review, 1989
- Congestion avoidance and controlPublished by Association for Computing Machinery (ACM) ,1988
- An asynchronous, distributed flow control algorithm for rate allocation in computer networksIEEE Transactions on Computers, 1988
- An incentive compatible flow control algorithm for rate allocation in computer networksIEEE Transactions on Computers, 1988
- A Condition Guaranteeing the Optimality of Public ChoiceEconometrica, 1981