Window-Games between TCP Flows

DOI10.1007/978-3-540-79309-0_10zbMATH Open1136.91350OpenAlexW1744441305MaRDI QIDQ5459975FDOQ5459975

Authors: Pavlos S. Efraimidis, Lazaros Tsavlidis 

Publication date: 2 May 2008

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_10

Recommendations

• Window-games between TCP flows
• DYNAMIC BEHAIVIOR OF TCP-LIKE WINDOW CONTROL AND THROUGHPUT PERFORMANCE
• On the long time behavior of the TCP window size process
• Transient Moments of the TCP Window Size Process
• A game theoretic comparison of TCP and digital fountain based protocols
• WINTRAC: a TCP window adjustment scheme for bandwidth management
• An Improved Link Model for Window Flow Control and Its Application to FAST TCP

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of game theory (91A80) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Cites Work

• A class of games possessing pure-strategy Nash equilibria
• Probabilistic methods for algorithmic discrete mathematics
• Potential games
• Selfish unsplittable flows
• Congestion games with player-specific payoff functions
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• Robust game theory
• Algorithms, games, and the internet

Cited In (2)

• Window-games between TCP flows
• A game theoretic comparison of TCP and digital fountain based protocols

This page was built for publication: Window-Games between TCP Flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459975)