Window-games between TCP flows

Efraimidis, P.S.; Tsavlidis, L.; Mertzios, G.B.

Abstract

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.

Citation

Efraimidis, P., Tsavlidis, L., & Mertzios, G. (2010). Window-games between TCP flows. Theoretical Computer Science, 411(31-33), 2798-2817. https://doi.org/10.1016/j.tcs.2010.03.031

• Journal Article Type: Article
• Publication Date: Jun 28, 2010
• Deposit Date: Dec 8, 2011
• Journal: Theoretical Computer Science
• Print ISSN: 0304-3975
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 411
• Issue: 31-33
• Pages: 2798-2817
• DOI: https://doi.org/10.1016/j.tcs.2010.03.031
• Keywords: Algorithmic game theory, Network games, Nash equilibrium.
• Public URL: https://durham-repository.worktribe.com/output/1501755