Max-min fairness

Known as: Max-min fair, Max-min fair scheduling 
In communication networks, multiplexing and the division of scarce resources, max-min fairness is said to be achieved by an allocation if and only if… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
Max-Min Fairness is a flexible resource allocation mechanism used in most datacenter schedulers. However, an increasing number of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Often one would like to allocate shared resources in a fair way. A common and well-studied notion of fairness is Max-Min Fairness… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
In this paper, we establish that the rate region of a large class of IEEE 802.11 mesh networks is log-convex, immediately… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2012
Highly Cited
2012
This paper addresses coordinated downlink beamforming optimization in multicell time division duplex (TDD) systems where a small… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 8
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We consider the problem of fair resource allocation in a system containing different resource types, where each user may have… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In this paper, we give the first approximation algorithm for the problem of max-min fair allocation of indivisible goods. An… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
In this paper, it is shown that it is challenging to evaluate service fairness in multi-hop wireless networks due to intra-flow… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We compare the performance of three usual allocations, namely max-min fairness, proportional fairness and balanced fairness, in a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We describe a new algorithm for rate allocation within the individual switches of an ATM network implementing a rate-based… (More)
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This paper studies a simple strategy, proposed independently by Gallager [1] and Katevenis [2], for fairly allocating link… (More)
  • figure 2
  • figure 3
Is this relevant?