Publication details for Dr George MertziosEfraimidis, P.S., Tsavlidis, L. & Mertzios, G.B. (2010). Window-games between TCP flows. Theoretical Computer Science 411(31-33): 2798-2817.
- Publication type: Journal Article
- ISSN/ISBN: 0304-3975
- DOI: 10.1016/j.tcs.2010.03.031
- Keywords: Algorithmic game theory, Network games, Nash equilibrium.
- Further publication details on publisher web site
- Durham Research Online (DRO) - may include full text
Author(s) from Durham
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.