An Asynchronous, Distributed Flow Control Algorithm for Rate Allocation in Computer Networks
IEEE Transactions on Computers
An Incentive Compatible Flow Control Algorithm for Rate Allocation in Computer Networks
IEEE Transactions on Computers
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A delay-based approach for congestion avoidance in interconnected heterogeneous computer networks
ACM SIGCOMM Computer Communication Review
A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
A theoretical analysis of feedback flow control
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A Game Theoretic Approach to Decentralized Flow Control of Markovian Queueing Networks
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Efficient Network Allocations with Selfish Users
Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Journal of the ACM (JACM)
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Determining end-to-end delay bounds in heterogeneous networks
Multimedia Systems - Special issue on the fifth workshop on network and operating system support for digital audio and video 1995 (NOSSDAV)
Hierarchical packet fair queueing algorithms
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the first international conference on Information and computation economies
The impact of multicast layering on network fairness
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Competitive analysis of incentive compatible on-line auctions
Proceedings of the 2nd ACM conference on Electronic commerce
TCP congestion control with a misbehaving receiver
ACM SIGCOMM Computer Communication Review
The impact of multicast layering on network fairness
IEEE/ACM Transactions on Networking (TON)
A game-theoretic approach towards congestion control in communication networks
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
Protection of Fairness for Multimedia Traffic Streams in a Non-cooperative Wireless LAN Setting
PROMS 2001 Proceedings of the 6th International Conference on Protocols for Multimedia Systems
Competitive analysis of incentive compatible on-line auctions
Theoretical Computer Science
Robust packet scheduling in wireless cellular networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
Distributed resource management with heterogeneous linear controls
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network QoS games: stability vs optimality tradeoff
Journal of Computer and System Sciences
Fair Bandwidth Sharing in Distributed Systems: A Game-Theoretic Approach
IEEE Transactions on Computers
A survey on networking games in telecommunications
Computers and Operations Research
A mathematical model for the TCP tragedy of the commons
Theoretical Computer Science - Game theory meets theoretical computer science
Transport-independent fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on networking games in telecommunications
Computers and Operations Research
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Noncooperative channel contention in ad hoc wireless LANs with anonymous stations
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
| Hi-index | 0.00 |
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.