Window-games between TCP flows

DOI10.1016/J.TCS.2010.03.031MaRDI QIDQ982652zbMATH OpenOpenAlexFDO

Authors Pavlos S. Efraimidis, Lazaros Tsavlidis, George B. Mertzios

Publication date 7 July 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.03.031

zbMATH Keywords

algorithmic game theoryNash equilibriumnetwork games

Mathematics Subject Classification ID

Network protocols (68M12) Games involving graphs (91A43) Applications of game theory (91A80)

Recommendations

• Window-Games between TCP Flows
• Congestion Pricing and Noncooperative Games in Communication Networks
• Fair and efficient router congestion control
• TCP is competitive with resource augmentation
• A game theoretic perspective to flow control in telecommunication networks

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A game theoretic comparison of TCP and digital fountain based protocols
• A mathematical model for the TCP tragedy of the commons
• Algorithms, games, and the internet
• Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
• Congestion games with player-specific payoff functions
• Fair and efficient router congestion control
• scientific article; zbMATH DE number 571346 (Why is no real title available?)
• Potential games
• Prediction, Learning, and Games
• Probabilistic methods for algorithmic discrete mathematics
• Robust game theory
• Selfish unsplittable flows
• The price of selfish routing
• The structure and complexity of Nash equilibria for a selfish routing game
• Worst-case equilibria

Cited in

(2)

• Window-Games between TCP Flows
• A game theoretic comparison of TCP and digital fountain based protocols

Describes a project that uses

Uses Software

• ns-2

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 Q982652)