Efraimidis, P.S. and Tsavlidis, L. and Mertzios, G.B. (2010) 'Window-games between TCP flows.', Theoretical computer science., 411 (31-33). pp. 2798-2817.
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.
|Keywords:||Algorithmic game theory, Network games, Nash equilibrium.|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||http://dx.doi.org/10.1016/j.tcs.2010.03.031|
|Record Created:||15 Dec 2011 17:05|
|Last Modified:||08 Sep 2014 10:50|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|