Maxmin Fair Scheduling in Wireless Networks：（最大最小公平调度无线网络）.pdfVIP

Maxmin Fair Scheduling in Wireless Networks 1 2 Leandros Tassiulas and Saswati Sarkar , 1 Department of Electrical and Computer Engineering, leandros@ University of Maryland, College Park, 2 Department of Electrical Engineering, University of Pennsylvania Philadelphia, swati@ Abstract—We consider scheduling policies for maxmin fair allocation of performance for a broad class of these functions. Max-min fair bandwidth in wireless adhoc networks. We formalize the maxmin fair ob- allocation of bandwidth is one such objective. jective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on The basic idea behind maxmin fairness is to first allocate equal the congestion in the neighborhood and schedule the flows which constitute bandwidth to all contending users. If a user can not utilize its a maximum weighted matching. It is possible to analytically prove that this bandwidth, because of constraint elsewhere, then the residual policy attains both short term and long term fairness. We consider more generalized fairness notions, and suggest mechanisms to attain these objec- bandwidth is distributed among others. Thus, no user is pe- tives. nalized excessively, and a certain minimum quality of service is