DocumentCode
806519
Title
Priority service and max-min fairness
Author
Marbach, Peter
Author_Institution
Dept. of Comput. Sci., Univ. of Toronto, Ont., Canada
Volume
11
Issue
5
fYear
2003
Firstpage
733
Lastpage
746
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.
Keywords
bandwidth allocation; game theory; minimax techniques; packet switching; telecommunication networks; telecommunication traffic; bandwidth allocation; game equilibrium; noncooperative game; packet based networks; priority service; traffic priority; weighted max-min fairness; Channel allocation; Communication system traffic control; Diffserv networks; Game theory; Pricing; Quality of service; Resource management; Telecommunication traffic; Throughput; Traffic control;
fLanguage
English
Journal_Title
Networking, IEEE/ACM Transactions on
Publisher
ieee
ISSN
1063-6692
Type
jour
DOI
10.1109/TNET.2003.818196
Filename
1237451
Link To Document