We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problem of network congestion caused by the competing flows. Analytical and experimental results show the relevance of the Window-game to the real TCP game and provide interesting insight on Nash equilibria of the respective network games. Furthermore, we propose a new algorithmic queue mechanism, called Prince, which at congestion makes a scapegoat of the most greedy flow. Preliminary evidence shows that Prince achieves efficient Nash equilibria while requiring only limited computational resources. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Efraimidis, P. S., & Tsavlidis, L. (2008). Window-games between TCP flows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4997 LNCS, pp. 95–108). https://doi.org/10.1007/978-3-540-79309-0_10
Mendeley helps you to discover research relevant for your work.