Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Making greed work in networks: a game-theoretic analysis of switch service disciplines
IEEE/ACM Transactions on Networking (TON)
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Approximate fairness through differential dropping: (summary)
ACM SIGCOMM Computer Communication Review
A Game Theoretic Approach to Decentralized Flow Control of Markovian Queueing Networks
Performance '87 Proceedings of the 12th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Controlling High-Bandwidth Flows at the Congested Router
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
General AIMD Congestion Control
General AIMD Congestion Control
The complexity of massive data set computations
The complexity of massive data set computations
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On selfish routing in internet-like environments
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 9th annual international conference on Mobile computing and networking
Exploiting the efficiency and fairness potential of AIMD-based congestion avoidance and control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Assessing and Improving TCP Rate Shaping over Edge Gateways
IEEE Transactions on Computers
DOMINO: a system to detect greedy behavior in IEEE 802.11 hotspots
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Uncooperative congestion control
Proceedings of the joint international conference on Measurement and modeling of computer systems
Experiences applying game theory to system design
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Near rationality and competitive equilibria in networked systems
Proceedings of the ACM SIGCOMM workshop on Practice and theory of incentives in networked systems
Distributed resource management with heterogeneous linear controls
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-management in chaotic wireless deployments
Proceedings of the 11th annual international conference on Mobile computing and networking
Fair Bandwidth Sharing in Distributed Systems: A Game-Theoretic Approach
IEEE Transactions on Computers
BAR fault tolerance for cooperative services
Proceedings of the twentieth ACM symposium on Operating systems principles
Overcoming free-riding behavior in peer-to-peer systems
ACM SIGecom Exchanges
A mathematical model for the TCP tragedy of the commons
Theoretical Computer Science - Game theory meets theoretical computer science
Preface: A brief overview of network algorithms
Journal of Computer and System Sciences - Special issue on network algorithms 2005
DOMINO: Detecting MAC Layer Greedy Behavior in IEEE 802.11 Hotspots
IEEE Transactions on Mobile Computing
On selfish routing in internet-like environments
IEEE/ACM Transactions on Networking (TON)
A game-theoretic study of CSMA/CA under a backoff attack
IEEE/ACM Transactions on Networking (TON)
A two-time-scale design for edge-based detection and rectification of uncooperative flows
IEEE/ACM Transactions on Networking (TON)
Loss-cognizant pricing in networks with greedy users
Computer Networks: The International Journal of Computer and Telecommunications Networking
Selfish Grids: Game-Theoretic Modeling and NAS/PSA Benchmark Evaluation
IEEE Transactions on Parallel and Distributed Systems
A game theoretic comparison of TCP and digital fountain based protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On designing collusion-resistant routing schemes for non-cooperative wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Self-management in chaotic wireless deployments
Wireless Networks
Journal of Computer Security - Special Issue on Security of Ad-hoc and Sensor Networks
A game-theoretic analysis of wireless access point selection by mobile users
Computer Communications
Equilibrium analysis through separation of user and network behavior
Computer Networks: The International Journal of Computer and Telecommunications Networking
Window-Games between TCP Flows
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Transport-independent fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Cooperative power-aware scheduling in grid computing environments
Journal of Parallel and Distributed Computing
Towards behavioral control in multi-player network games
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Stochastic Stability in Internet Router Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Information security economics - and beyond
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Window-games between TCP flows
Theoretical Computer Science
Incentive compatibility and dynamics of congestion control
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A collusion-resistant routing scheme for noncooperative wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Game theory as a tool for modeling cross-layer interactions
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Game-Theoretic analysis of internet switching with selfish users
WINE'05 Proceedings of the First international conference on Internet and Network Economics
How many parallel TCP sessions to open: a pricing perspective
ICQT'06 Proceedings of the 5th international conference on Internet Charging and QoS Technologies: performability has its Price
Game-theoretic analysis of Internet switching with selfish users
Theoretical Computer Science
Contention issues in congestion games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
TCP ex machina: computer-generated congestion control
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Hi-index | 0.01 |
For years, the conventional wisdom [7, 22] has been that the continued stability of the Internet depends on the widespread deployment of "socially responsible" congestion control. In this paper, we seek to answer the following fundamental question: If network end-points behaved in a selfish manner, would the stability of the Internet be endangered?.We evaluate the impact of greedy end-point behavior through a game-theoretic analysis of TCP. In this "TCP Game" each flowattempts to maximize the throughput it achieves by modifying its congestion control behavior. We use a combination of analysis and simulation to determine the Nash Equilibrium of this game. Our question then reduces to whether the network operates efficiently at these Nash equilibria.Our findings are twofold. First, in more traditional environments -- where end-points use TCP Reno-style loss recovery and routers use drop-tail queues -- the Nash Equilibria are reasonably efficient. However, when endpoints use more recent variations of TCP (e.g., SACK) and routers employ either RED or drop-tail queues, the Nash equilibria are very inefficient. This suggests that the Internet of the past could remain stable in the face of greedy end-user behavior, but the Internet of today is vulnerable to such behavior. Second, we find that restoring the efficiency of the Nash equilibria in these settings does not require heavy-weight packet scheduling techniques (e.g., Fair Queuing) but instead can be done with a very simple stateless mechanism based on CHOKe [21].