Sciweavers

1195 search results - page 12 / 239
» On allocations that maximize fairness
Sort
View
INFOCOM
2002
IEEE
14 years 20 days ago
User Fair Queing: Fair Allocation of Bandwidth for Users
—User Fairness aims at fairly distributing the network resources among users, where a user is an entity that can possibly send different flows through different paths. In this p...
Albert Banchs
WINE
2010
Springer
189views Economy» more  WINE 2010»
13 years 5 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...
QUESTA
2006
100views more  QUESTA 2006»
13 years 7 months ago
A queueing analysis of max-min fairness, proportional fairness and balanced fairness
We compare the performance of three usual allocations (max-min fairness, proportional fairness and balanced fairness) in a communication network whose resources are shared by a ra...
Thomas Bonald, Laurent Massoulié, Alexandre...
NCA
2005
IEEE
14 years 1 months ago
A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ
The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by d...
Peng Wang, David L. Mills
JSAC
2008
118views more  JSAC 2008»
13 years 7 months ago
Auction-Based Resource Allocation for Cooperative Communications
Abstract--Distributed and efficient resource allocation is critical for fully realizing the benefits of cooperative communications in large scale communication networks. This paper...
Jianwei Huang, Zhu Han, Mung Chiang, H. Vincent Po...