Making greed work in networks: a game-theoretic analysis of switch service disciplines
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 3 (6) , 819-831
- https://doi.org/10.1109/90.477727
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Congestion avoidance in computer networks with a connectionless network layer: concepts, goals and methodologyPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the existence of equilibria in noncooperative optimal flow controlJournal of the ACM, 1995
- A game theoretic perspective to flow control in telecommunication networksJournal of the Franklin Institute, 1992
- A theoretical analysis of feedback flow controlPublished by Association for Computing Machinery (ACM) ,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 incentive compatible flow control algorithm for rate allocation in computer networksIEEE Transactions on Computers, 1988
- Fast switching and fair control of congested flow in broadband networksIEEE Journal on Selected Areas in Communications, 1987
- Strategy-Proof Allocation Mechanisms at Differentiable PointsThe Review of Economic Studies, 1981
- Bottleneck Flow ControlIEEE Transactions on Communications, 1981