By Topic

Dynamic Resource Allocation Based on Weighted Max-Min Fairness

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yu Sheng ; Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada ; MacGregor, M.H.

In this paper we extend weighted max-min fairness by adding strategies that enable users to modify their fair allocation by sharing and borrowing bandwidth with other users. There is also a mechanism to reclaim bandwidth a user has previously shared. The main focus of our investigation is to develop a method for allocating link bandwidth between multiple users on multiple links of a communication network in the face of changing demands, usage patterns, and priorities while still being guided by max-min allocation. The algorithm is generic and could be applied to settings other than data networks such as process scheduling in operating systems, etc. We have tested the feasibility and performance of the algorithm via simulation. We have also integrated it into a commercial product and tested it in a real-world setting. We present the results from both types of tests in this paper.

Published in:

Communication Networks and Services Research Conference (CNSR), 2011 Ninth Annual

Date of Conference:

2-5 May 2011