Abstract

We study a priority service where users are free to choose the priority of their traffic, but are charged accordingly by the network. We assume that each user chooses priorities to maximize its own net benefit, and model the resulting interaction among users as a noncooperative game. We show that there exists an unique equilibrium for this game and that in equilibrium the bandwidth allocation is weighted max-min fair.

Citations

1517	Data Network - Bertsekas, Gallager - 1992
1093	Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability - Kelly, Maulloo, et al. - 1998
971	Analysis and Simulation of a Fair Queueing Algorithm - Demers, Keshav, et al. - 1989
411	Optimization flow control, I: basic algorithm and convergence - Low, Lapsley - 1999
362	Fair end-to-end window-based congestion control - Mo, Walrand - 1998
307	Some theoretical aspects of road traffic research - Wardrop - 1952
290	Principles of Mathematical Analysis - Rudin - 1976
215	Pricing the Internet - MacKie-Mason, Varian - 1995
183	Pricing in Computer Networks: Motivation, Formulation and Example - Cocchi, Shenker, et al. - 1993
119	Game Theory for Applied Economists - Gibbons - 1992
94	Round-robin scheduling for MaxMin fairness in data networks - Hahne - 1991
90	Paris metro pricing for the internet - Odlyzko - 1999
85	The Impact of Multicast Layering on Network Fairness - RUBENSTEIN, KUROSE, et al.
75	Assured forwarding PHB group - Heinanen, Baker, et al. - 1999
74	An Algorithm for Rate Allocation in a Packet-Switching Network with Feedback - Charny - 1994
66	Pricing the internet,” Public Access to the Internet - Varian, Mackie-Mason - 1994
59	Utility-based rate control in the Internet for elastic traffic - La, Anantharam - 2002
55	On the relationship between Nash-Cournot and Wardrop equilibria - Haurie, Marcotte - 1985
53	On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation - Huang, Bensaou - 2001
41	Quality of service provision in noncooperative networks with diverse user requirements”, Decis - Park, Sitharam, et al. - 2000
38	Metro Pricing: The minimalist differentiated services solution - Odlyzko, “Paris
34	Fast Switching and Fair Control of Congested Flow in Broad-Band Networks - Katevenis - 1987
26	An architecture for noncooperative QoS provision in many-switch systems - Chen, Park - 1999
25	Anantharam,"Charge-Sensitive TCP and Rate Control in the Internet - La, V - 2000
18	Steinberg,”Congestion Pricing and User Adaptation - Ganesh, Laevens, et al.
12	Pricing Priority Classes in a Differentiated Services Network - Marbach - 1999
8	A game theoretic framework for rate allocation and charging of available bit rate (abr) connections in atm networks - Yaïche, Mazumdar, et al. - 1998
3	Optimization flow control—Part I: Basic algorithms and convergence - Low, Lapsley - 1999
1	Maxmin scheduling in wireless networks - Tassiulas, Sarkar
1	Peter Marbach was born in Lucerne, Switzerland. He received the Eidg. Dipl. El.-Ing. degree from the ETH - London - 1974