A Unified Framework for Max -Min and Min-Max Fairness with application Bozidar Radunoic, Member,...
-
Upload
imogen-hall -
Category
Documents
-
view
230 -
download
2
Transcript of A Unified Framework for Max -Min and Min-Max Fairness with application Bozidar Radunoic, Member,...
A Unified Framework forMax -Min and Min-Max
Fairness with application
Bozidar Radunoic, Member, IEEE, and
Jean-Yves Le Boudec, Fellow, IEEE
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 15, NO. 5, OCTOBER 2007
R96725005 謝友仁R96725025 王猷順R96725037 陳冠瑋
指導老師:林永松 老師
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 2 / 43
Author
Bozidar RadunoicReceived the B.S. degree in electrical engineering from the University of Belgrade, Serbia, in 1999, and the Doctorate in 2005 from EPFL, Switzerland.
Participated in the Swiss NCCR project terminodes.org.
His interests are in the architecture and performance of wireless ad-hoc networks.
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 3 / 43
Author
Jean-Yves Le BoudecGraduated from Ecole Normale Superieure de Saint-Cloud, Paris, and received the Doctorate in 1984 from the University of Rennes, France.
In 1987, he joined Bell Northern Research, Ottawa, Canada.
In 1988, he joined the IBM Zurich Research Laboratory.
In 1994, he became a Professor at EPFL, where he is now a full Professor.
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 4 / 43
Abstract
Max-min fairness is widely usedBased on the notion of bottlenecksA unifying treatment of max-min fairness
First, we observe that the existence of max-min fairnessA geometric property of the set of feasible allocations
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 5 / 43
Abstract (cont’d)
Second, we give a general purpose centralized algorithmMax-min ProgrammingComplexity is the order of N linear programming
steps in RN
Free disposal property and Water Filling AlgorithmMutatis mutandis to min-max fairness
Agenda
1. Introduction
2. Max-min and Min-max Fairness
3. Max-min Programming and Water-filling
4. Example Scenarios
5. Conclusion
Agenda
1. Introduction
2. Max-min and Min-max Fairness
3. Max-min Programming and Water-filling
4. Example Scenarios
5. Conclusion
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 8 / 43
Max-Min Fairness
Allocating as much as possible to users with low rates
78
3
x1
x2
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 9 / 43
Microeconomic Approaches to Fairness
Max-min fairness is closely related to leximin ordering.
Free disposal propertyA bottleneck argument can be made
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 10 / 43
Bottleneck and Water-Filling
If each flow has a bottleneck link, then the rate allocation is max-min fair.
The bottleneck argument is often used to prove the existence of max-min fairness.
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 11 / 43
Water-filling algorithm (WF)
Rates of all flows are increased at the same pace, until one or more links are saturated.
0.5
1
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 12 / 43
When Bottleneck and Water-Filling Become Less Obvious
Point-to-point multi-path routing scenario.All links have capacity 1.
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 13 / 43
When Bottleneck and Water-Filling Become Less Obvious (cont’d)
Re-interpret the original multi-path problem as a virtual single path problem.
x1, x2, y1, y2≥0, x1=y1+y2, y2+x2≤1, y1≤1x2≤1, x1+x2≤2
y1
y2
x2
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 14 / 43
When Bottleneck and Water-Filling Do Not Work
Equalize load on the servers while satisfying the capacity constraints.
Min-max fairCannot decrease a load on a server without
increasing a load of another server that already has a higher load.
7
3
8
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 15 / 43
Our Findings
The existence of max-min fairnessOn algorithms to locate the max-min fair
allocationMax-min Programming (MP)
Relation between the general MP algorithm and the existing WF algorithmFree disposal propertyForm of feasible set
Agenda
1. Introduction
2. Max-min and Min-max Fairness
3. Max-min Programming and Water-filling
4. Example Scenarios
5. Conclusion
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 17 / 43
Definitions and Uniqueness
If is a min-max fair vector on , then is max-min fair on and vice versa
If a max-min fair vector exists on a set , then it is unique
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 18 / 43
Max-Min Fairness and Leximin Ordering
Leximin maximum is not necessarily unique, if a vector is leximin maximal, it is also Pareto optimal
If a max-min fair vector exists on a set , then it is the unique leximin maximal vector on
it follows that the max-min fair vector, if it exists, is Pareto optimal
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 19 / 43
Existence and Max-Min Achievable Sets
Max-min fair vector does not exist on all feasible setsA set is max-min achievable if there exists a max-min
fair vector on
In the example on the left, both points (1, 3) and (3, 1) are leximin maximal in this example.In the example on the right, point (3, 1) is the single leximin maximal point.
Agenda
1. Introduction
2. Max-min and Min-max Fairness
3. Max-min Programming and Water-filling
4. Example Scenarios
5. Conclusion
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 21 / 43
The Max-Min Programming (MP) Algorithm
finds the smallest component of the max-min fair vectorby maximizing the minimal coordinateminimal coordinate is fixed, and the dimension
corresponding to the minimal coordinate is removedRepeated until all coordinates are fixed
vector obtained in such way is indeed the max-min fair one
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 22 / 43
The Max-Min Programming (MP) Algorithm (Cont’d)
finds the smallest component
minimal coordinate is fixed
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 23 / 43
The Max-Min Programming (MP) Algorithm (Cont’d)
maximizes the minimal coordinate in each step until all coordinates are processed
If is compact and max-min achievable, the above algorithm terminates and finds the max-min fair vector on in at most steps.
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 24 / 43
Max-Min Programming Numerical Example 1
Step 1:
Step 2:
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 25 / 43
Max-Min Programming Numerical Example 2
The min-max fair rate allocation is thus (4,3)
Step 1:
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 26 / 43
Max-Min Programming with Max-min does not exist
max-min fair allocation does not exist
Step 1:
This point is neither leximin maximal, nor Pareto optimal
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 27 / 43
The Water-Filling (WF) Algorithm
free disposal applies to sets where each coordinate is independently lower-bounded
Let be a max-min achievable set that satisfies the free disposal property. Then, at every step, the solutions to problems and are the same
WF terminates and returns the same result as MP, namely the max-min fair vector if it exists
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 28 / 43
The Water-Filling (WF) Algorithm (Cont’d)
set each xi to be the smallestcomponent or its original minimum
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 29 / 43
The Water-Filling (WF) Algorithm (Cont’d)
m1 = 0.5
m2 = 1
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 30 / 43
Water-Filling Algorithm Numerical Example
Free disposal property is a sufficient but not a necessary condition for MP to degenerate to WF
C1 = 3, C2 = 3, C3 = 4, X1 + X2 ≥ 3
same shape and orientation as in Fig. 4, but it is translated to the left such that it touches both X2 and X1 axes
Without the free disposal property, still solved by WF in the single step
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 31 / 43
Complexity of the Algorithms in Case of Linear Constraints
Χ is a n-dimensional feasible set defined by m linear inequalities
Max-Min Programming Complexitythe overall complexity is O(nLP(n,m))LP(n,m) is the complexity of linear programming
Linear programmingthe worst case: exponential complexitymost practical cases: polynomial complexity
Water-Filling Algorithm ComplexityN steps, each of complexity O(m), overall O(nm)
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 32 / 43
Complexity of the Algorithms in Case of Linear Constraints
Χ is defined implicitly, with an ι–dimensional slack variable (ex: multi-path case)
Max-Min Programming on implicit setsThe complexity is O(nLP(n,m))
Water-Filling Algorithm on implicit setsit might be possible to construct an implicitly defined
feasible set that cannot be converted to an explicit form in a polynomial time
paper interested in explicitly finding the values of the slack variables at the max-min fair vector, and the complexity is O(nm)
Agenda
1. Introduction
2. Max-min and Min-max Fairness
3. Max-min Programming and Water-filling
4. Example Scenarios
5. Conclusion
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 34 / 43
Example Scenarios
Load Distribution in P2P Systemsa minimal rate a user needs to achievean upper bound on each flow given by a network
topology and link capacities
Maximum Lifetime Sensor Networksto minimize the average transmitting powers of
sensorswe look for min-max fair vector of average power
consumptions of sensors.
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 35 / 43
Load Distribution in P2P Systems
represent the feasible rate set as
be the total loads on the servers the flows from the servers to clients the total traffic received by clients the capacities of links the minimum required rates of the flows where A, B, C ≥ 0 are arbitrary matrices defined by network
topology and routing.
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 36 / 43
Load Distribution in P2P Systems
Each server is interested in minimizing its own load It is natural to look for the min-max fair vectorSince set is convex, it is min-max achievableUse Max-min Programming to solve this problem
Y2
Y1
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 37 / 43
Maximum Lifetime Sensor Networks
A network has a certain minimal amount of data to convey to a sink consider different scheduling and routing strategies
that achieve this goal Each of these strategies yields different average
power consumptions
Look for min-max fair vector of average power consumptions of sensors
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 38 / 43
Maximum Lifetime Sensor Networks
The maximum rate of information can achieve is
Denote with the average rate of sd link throughout a schedule
Χ is a set of feasible , that is such that there exists a schedule and power allocations that achieve those rates
calculate the average power dissipated by a node during a schedule
RateTime Power
Total interference
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 39 / 43
Maximum Lifetime Sensor Networks
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 40 / 43
Maximum Lifetime Sensor Networks
P = 1
N = 1
hS1D1 = 1
hS1D2 = 1
hS2D1 = 10
hS2D2 = 0.7
M1 = 0.6
M2 = 0.4
P1=0, P2= -0.62; min(P1, P2)=-0.62
Agenda
1. Introduction
2. Max-min and Min-max Fairness
3. Max-min Programming and Water-filling
4. Example Scenarios
5. Conclusion
112/04/20 A Unified Framework for Max -Min and Min-Max Fairness with application 42 / 43
Conclusion
We have elucidated the role of bottleneck arguments in the water-filling algorithm, and explained the relation to the free disposal property
We have given a general purpose algorithm (MP) for computing the max-min fair vector whenever it exists, and showed that it degenerates to the classical water-filling algorithm, when free disposal property holds
We have focused on centralized algorithms for calculating max-min and min-max fair allocations
Thanks for your listening