Data networks
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
TCP/IP illustrated (vol. 1): the protocols
TCP/IP illustrated (vol. 1): the protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
IEEE/ACM Transactions on Networking (TON)
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Proceedings of the ACM SIGCOMM '98 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
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A game-theoretic approach towards congestion control in communication networks
ACM SIGCOMM Computer Communication Review
Selfish behavior and stability of the internet:: a game-theoretic analysis of TCP
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fair and efficient router congestion control
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Mathematical Programming: Series A and B
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Prediction, Learning, and Games
Prediction, Learning, and Games
A mathematical model for the TCP tragedy of the commons
Theoretical Computer Science - Game theory meets theoretical computer science
Resource selection games with unknown number of players
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Computer Networks, Fourth Edition: A Systems Approach
Computer Networks, Fourth Edition: A Systems Approach
A game theoretic comparison of TCP and digital fountain based protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
The structure and complexity of Nash equilibria for a selfish routing game
Theoretical Computer Science
Computer Science Review
Round-robin scheduling for max-min fairness in data networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 5.23 |
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. Analytical and experimental results show the relevance of the Window-game to real TCP congestion games and provide interesting insight into the respective Nash equilibria. Furthermore, we propose a new algorithmic queue mechanism, called Prince, which at congestion makes a scapegoat of the most greedy flow. We provide evidence which shows that Prince achieves efficient Nash equilibria while requiring only limited computational resources.