DocumentCode
1863880
Title
Is fair allocation always inefficient
Author
Tang, Ao ; Wang, Jidntao ; Low, Steven H.
Author_Institution
California Inst. of Technol., Pasadena, CA, USA
Volume
1
fYear
2004
fDate
7-11 March 2004
Lastpage
45
Abstract
This paper describes the tradeoff between fairness criteria of different allocation policies and throughput in a general network. A class of utility functions parameterized by a scalar defines a bandwidth allocation policy. An allocation is fair if the scalar is large and efficient if the aggregate source rate is large. The conjecture depends on the network topology in terms of routing and link capacities. A fairer allocation is always more efficient.
Keywords
Internet; telecommunication network routing; telecommunication network topology; aggregate source rate; bandwidth allocation policy; fair allocation policy; link capacity; network throughput; network topology; routing; utility function; Aggregates; Channel allocation; Costs; Delay; Internet; Protocols; Resource management; Routing; Sufficient conditions; Throughput;
fLanguage
English
Publisher
ieee
Conference_Titel
INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies
ISSN
0743-166X
Print_ISBN
0-7803-8355-9
Type
conf
DOI
10.1109/INFCOM.2004.1354479
Filename
1354479
Link To Document