Communications Networks II Design and Algorithms通信网络Ⅱ设计与算法.pptVIP

Outline Fair sharing of network resource Max-min Fairness Proportional Fairness Extension Fair Networks Elastic Users: demand volume NOT fixed greedy users: use up resource if any, e.g. TCP competition resolution? Fairness: how to allocate available resource among network users. capacitated design: resource=bandwidth uncapacitated design: resource=budget Applications rate control, bandwidth reservation link dimensioning Max-Min Fairness: definiation Lexicographical Comparison a n-vector x=(x1,x2, …,xn) sorted in non-decreasing order (x1≤x2 ≤ …≤ xn) is lexicographically greater than another n-vector y=(y1,y2, …,yn) sorted in non-decreasing order if an index k, 0 ≤k ≤n exists, such that xi =yi, for i=1,2,…,k-1 and xk yk (2,4,5) L (2,3,100) Max-min Fairness: an allocation is max-min fair if its lexicographically greater than any feasible allocation Uniqueness? Other Fairness Measures Proportional fairness [Kelly, Maulloo Tan, ’98] A feasible rate vector x is proportionally fair if for every other feasible rate vector y Proposed decentralized algorithm, proved properties Generalized notions of fairness [Mo Walrand, 2000] -proportional fairness: A feasible rate vector x is fair if for any other feasible rate vector y Special cases: : proportional fairness : max-min fairness Capacitated Max-Min Flow Allocation Fixed single path for each demand Proposition: a flow allocation is max-min fair if for each demand d there exists at least one bottle-neck, and at least on one of its bottle-necks, demand d has the highest rate among all demands sharing that bottle-neck link. Max-min Fairness Example Max-min fair flow allocation sessions 0,1,2: flow rate of 1/3 session 3: flow rate of 2/3 Max-Min Fairness: other definitions Definition1: A feasible rate vector is max-min fair if no rate can be increased without decreasing some s.t. Definition2: A feasible