Data networks
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
TCP Vegas: new techniques for congestion detection and avoidance
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Hierarchical packet fair queueing algorithms
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Forward acknowledgement: refining TCP congestion control
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Dynamic queue length thresholds in a shared memory ATM switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Hardware implementation of fair queuing algorithms for asynchronous transfer mode networks
IEEE Communications Magazine
Buffer management schemes for supporting TCP in gigabit routers with per-flow queueing
IEEE Journal on Selected Areas in Communications
A taxonomy for congestion control algorithms in packet switching networks
IEEE Network: The Magazine of Global Internetworking
Feedback control for router congestion resolution
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
A survey on networking games in telecommunications
Computers and Operations Research
An evolutionary game-theoretic approach to congestion control
Performance Evaluation - Performance 2005
A mathematical model for the TCP tragedy of the commons
Theoretical Computer Science - Game theory meets theoretical computer science
Modeling energy constrained routing in selfish ad hoc networks
GameNets '06 Proceeding from the 2006 workshop on Game theory for communications and networks
A game theoretic comparison of TCP and digital fountain based protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stackelberg approach for pricing differentiated services
Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
The evolution of transport protocols: An evolutionary game perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
Transport-independent fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey on networking games in telecommunications
Computers and Operations Research
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
Window-games between TCP flows
Theoretical Computer Science
Game-Theoretic analysis of internet switching with selfish users
WINE'05 Proceedings of the First international conference on Internet and Network Economics
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
Modeling conflict processes on the internet
Cybernetics and Systems Analysis
| Hi-index | 0.00 |
Most of the end-to-end congestion control schemes are "voluntary" in nature and critically depend on end-user cooperation. We show that in the presence of selfish users, all such schemes will inevitably lead to a congestion collapse. Router and switch mechanisms such as service disciplines and buffer management policies determine the sharing of resources during congestion. We show, using a game-theoretic approach, that all currently proposed mechanisms, either encourage the behaviour that leads to congestion or are oblivious to it.We propose a class of service disciplines called the Diminishing Weight Schedulers (DWS) that punish misbehaving users and reward congestion avoiding well behaved users. We also propose a sample service discipline called the Rate Inverse Scheduling (RIS) from the class of DWS schedulers. With DWS schedulers deployed in the network, max-min fair rates constitute a unique Nash and Stackelberg Equilibrium. We show that RIS solves the problems of excessive congestion due to unresponsive flows, aggressive versions of TCP, multiple parallel connections and is also fair to TCP.