We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Window-games between TCP flows.

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.

Item Type:Article
Keywords:Algorithmic game theory, Network games, Nash equilibrium.
Full text:Full text not available from this repository.
Publisher Web site:
Date accepted:No date available
Date deposited:No date available
Date of first online publication:June 2010
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar