A Game-Theoretic Approach Towards Congestion Control in Communication Networks

A Game-Theoretic Approach Towards Congestion Control in Communication Networks (2002)

Cached

Download Links

[www.cse.iitd.ernet.in]
[www.cse.iitd.ernet.in]

Other Repositories/Bibliography

DBLP

by Rahul Garg , Abhinav Kamra , Varun Khurana

Venue:	COMPUTER COMMUNICATION REVIEW
Citations:	14 - 0 self

Versions

Version History

Metadata Version 4

User correction supplied by mph

Datum	Value	Source
TITLE	A Game-Theoretic Approach Towards Congestion Control in Communication Networks	user correction - Legacy Corrections
AUTHOR NAME	Rahul Garg	user correction
AUTHOR NAME	Abhinav Kamra	user correction
AUTHOR NAME	Varun Khurana	user correction
ABSTRACT	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.	user correction
YEAR	2002	INFERENCE
VENUE	COMPUTER COMMUNICATION REVIEW	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	47--61	INFERENCE
VOLUME	32	INFERENCE
CITATIONS	32 found	ParsCit 1.0