1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“

Slides:



Advertisements
Similar presentations
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Advertisements

February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Shi Bai, Weiyi Zhang, Guoliang Xue, Jian Tang, and Chonggang Wang University of Minnesota, AT&T Lab, Arizona State University, Syracuse University, NEC.
QoS in ad hoc nets: distributed fair scheduling SCOPE: Self-coordinating Localized FQ H. Luo et al “A Self-Coordinating Approach to Distributed FairQueueing.
Interconnect throughput modeling. Important network performance metrics Throughput – Point to point (link bandwidth + end host software overheads) – Aggregate.
Designing An g Ad-hoc Network for Multimedia Communication Chung-Wei Lee & Jonathan C.L. Liu Presented By: Mahendra Kumar.
Abhay.K.Parekh and Robert G.Gallager Laboratory for Information and Decision Systems Massachusetts Institute of Technology IEEE INFOCOM 1992.
Data and Computer Communications Ninth Edition by William Stallings Chapter 12 – Routing in Switched Data Networks Data and Computer Communications, Ninth.
End-to-End Fair Bandwidth Allocation in Multi-hop Wireless Ad Hoc Networks Baochun Li Department of Electrical and Computer Engineering University of Toronto.
O ptimal routingpower allocation full-duplex o ptimal routing and power allocation for wireless networks with imperfect full-duplex nodes David Ramírez.
Wenye Wang Xinbing Wang Arne Nilsson Department of Electrical and Computer Engineering, NC State University March 2005 A New Admission Control Scheme under.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Lecture 9. Unconstrained Optimization Need to maximize a function f(x), where x is a scalar or a vector x = (x 1, x 2 ) f(x) = -x x 2 2 f(x) = -(x-a)
1 Internet Networking Spring 2002 Tutorial 9 Max-Min Fairness.
Charge-Sensitive TCP and Rate Control Richard J. La Department of EECS UC Berkeley November 22, 1999.
Bandwidth sharing: objectives and algorithms Jim Roberts France Télécom - CNET Laurent Massoulié Microsoft Research.
1 Internet Networking Spring 2004 Tutorial 9 Max-Min Fairness.
Network Bandwidth Allocation (and Stability) In Three Acts.
Jerry Chou and Bill Lin University of California, San Diego
Lecture 10. TCP flow Control Used for data transfer Every successful packet is acknowledged One can not have more than W unacknowledged packets, where.
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
6/28/2015CSC82601 Radio-resource sharing for adhoc Networking with UWB. by Francesca Cuomo, Cristina Martello, Andrea Baiocchi, and Fabrizio Capriotti.
Interference Minimization and Uplink Relaying For a 3G/WLAN Network Ju Wang Virginia Commonwealth University May, 2005.
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case Abhay K. Parekh, Member, IEEE, and Robert.
1 EL736 Communications Networks II: Design and Algorithms Class2: Network Design Problems -- Notation and Illustrations Yong Liu 09/12/2007.
Adaptive QoS Management for IEEE Future Wireless ISPs 通訊所 鄭筱親 Wireless Networks 10, 413–421, 2004.
Multicast Scheduling in Cellular Data Networks Katherine Guo, Arun Netravali, Krishan Sabnani Bell-Labs Research Hyungsuk Won, Han Cai, Do Young Eun, Injong.
Lecture 16 Maximum Matching. Incremental Method Transform from a feasible solution to another feasible solution to increase (or decrease) the value of.
Interconnect Performance Modeling. Performance modeling Given an interconnect topology, routing, and other parameters, predict the interconnect performance.
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
End-to-End Performance and Fairness in Multihop Wireless Backhaul Networks V. Gambiroza, B. Sadeghi, and E. Knightly Department of Electrical and Computer.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
Covilhã, 30 June Atílio Gameiro Page 1 The information in this document is provided as is and no guarantee or warranty is given that the information is.
Data Communications and Networking Chapter 11 Routing in Switched Networks References: Book Chapters 12.1, 12.3 Data and Computer Communications, 8th edition.
Network Flow. Network flow formulation A network G = (V, E). Capacity c(u, v)  0 for edge (u, v). Assume c(u, v) = 0 if (u, v)  E. Source s and sink.
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks 1 Bo Ji, 2 Changhee Joo and 1 Ness B. Shroff 1 Department of ECE, The Ohio State University.
Downlink Scheduling With Economic Considerations to Future Wireless Networks Bader Al-Manthari, Nidal Nasser, and Hossam Hassanein IEEE Transactions on.
Localized Algorithm for Aggregate Fairness in Wireless Sensor Networks Authors : Shigang Chen, Zhan Zhang CISE university of Florida CISE university of.
STUMP: Exploiting Position Diversity in the Staggered TDMA Underwater MAC Protocol Kurtis Kredo II, Petar Djukic, Prasant Mohapatra IEEE INFOCOM 2009.
TCP-Cognizant Adaptive Forward Error Correction in Wireless Networks
June 4, 2003EE384Y1 Demand Based Rate Allocation Arpita Ghosh and James Mammen {arpitag, EE 384Y Project 4 th June, 2003.
The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem Thanks to Jim Orlin & MIT OCW.
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
William Stallings Data and Computer Communications 7th Edition
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Real-Time Networks – WAN Packet Scheduling.
We used ns-2 network simulator [5] to evaluate RED-DT and compare its performance to RED [1], FRED [2], LQD [3], and CHOKe [4]. All simulation scenarios.
Receiver Driven Bandwidth Sharing for TCP Authors: Puneet Mehra, Avideh Zakor and Christophe De Vlesschouwer University of California Berkeley. Presented.
Quality of Service Schemes for IEEE Wireless LANs-An Evaluation 主講人 : 黃政偉.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
ComNets, RWTH Aachen University Relays in CDMA2000 Martha Clavijo Chair of Communication Networks RWTH Aachen University, Germany FFV 2007, ,
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
D. AriflerCMPE 548 Fall CMPE 548 Routing and Congestion Control.
1 Transport Bandwidth Allocation 3/29/2012. Admin. r Exam 1 m Max: 65 m Avg: 52 r Any questions on programming assignment 2 2.
William Stallings Data and Computer Communications
Water Resources Planning and Management Daene McKinney
Authors: Sajjad Rizvi, Xi Li, Bernard Wong, Fiodar Kazhamiaka
Traffic Engineering with AIMD in MPLS Networks
CSCI 3160 Design and Analysis of Algorithms Tutorial 8
Lecture 16 Maximum Matching
Provision of Multimedia Services in based Networks
Lecture 19-Problem Solving 4 Incremental Method
Pradeep Kyasanur Nitin H. Vaidya Presented by Chen, Chun-cheng
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Maximum Flow Neil Tang 4/8/2008
EMIS 8374 Maximum Concurrent Flow Updated 3 April 2008
Maximum Flow Problems in 2005.
CSCI 465 Data Communications and Networks Lecture 16
Presentation transcript:

1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“ IEEE Infocom 2000, Sec. II.B.1, III.C.3. –J-Y Le Boudec, “Rate adaptation, congestion control and fairness: a tutorial,” Nov. 2005, 1.2.1, 1.4. –MIT OpenCourseWare, Reading for next lecture: –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“ IEEE Infocom 2000.

2 Control functions in communication networks X X X X congestion control rate control admission control error control delay control medium access control scheduling (congestion control) (error control) (admission control) fairness concept

3 Fairness Scheduling: means to achieve fairness on a single link –E.g., GPS provides max-min fairness Networks? –How to define fairness –How to achieve fairness

4 Fairness - objectives How to share the network resources among the competing flows? (“parking lot scenario”) Maximum network throughput (Th=n would be nice): 1 0 n Equal rate:Equal network resource: l 0 *r 0 =l i *r i, l i is the path length

5 Fairness - objectives and algorithms Step 1: what is the “optimal” share? –What is optimal – a design decision –Fairness definitions –Centralized algorithms to calculate fair shares Step 2: how to ensure fair shares? –Traffic control at the network edges (congestion or rate control) –Scheduling at the network nodes This lecture: –max-min fairness definition and allocation algorithm –proportional fairness, other fairness definitions Student presentation: –distributed control for fairness

6 Max-Min Fairness Simplest case: –without requirements on minimum or maximum rate –constraints are the link bandwidths Definition: Maximize the allocation for the most poorly treated sessions, i.e., maximize the minimum. Equivalent definition: allocation is max-min fair if no rates can be increased without decreasing an already smaller rate

7 Max-Min Fairness Formal description: –allocated rate for session p: r p, r={r p } (maximum and minimum rate requirements not considered) –allocated flow on link a: F a =∑ pa r p –capacity of link a: C a Feasible allocation r: r p 0, F a ≤C a Max-min fair allocation r: –consider r max-min fair allocation and r* any feasible allocation –for any feasible r*r for which r* p >r p (if in r* there is a session that gets higher rate) –there is a p’ with r p’ ≤r p and r* p’ <r p’ (then there is a session that has minimum rate in r and has even smaller rate in r*.)

8 Max-Min Fairness Simple algorithm to compute max-min fair rate vector r –Idea: filling procedure 1.increase rates for all sessions until one link gets saturated (the link with highest number of sessions if there are no max. rates) 2. consider only sessions not crossing saturated links, go back to 1 –Formal algorithm in B-G p.527 –Note, it is a centralized algorithm, it requires information about all sessions.

9 Max-Min Fairness Filling procedure: 1. increase rates for all sessions until one link gets saturated (the link with highest number of sessions if there are no max. rates) 2. consider only sessions not crossing saturated links, go back to 1

10 Max-Min Fairness 1.All sessions get rate of 1/3, link(2,3) saturated, r2=r3=r5=1/3 2.Sessions 1 and 4 get rate increment of 1/3, link(3,5) saturated, r1=2/3 3.Session 4 gets rate increment of 1/3, link(4,5) saturated, r4=1 What happens with the rates if session 2 leaves?

11 Max-Min Fairness Proposition: Allocation is max-min fair if and only if each session has a bottleneck link Def: a is a bottleneck link for p if F a =C a and r p r p’ for all p’≠p Find the bottleneck links for p1,p2,p3,p4,p r2=r3=r5=1/3, r1=2/3, r4=1 * : bottleneck link

12 Max-Min Fairness Proposition: Allocation is max-min fair if and only if each session has a bottleneck link 1.If r is max-min fair then each session has a bottleneck link 2.If each session has a bottleneck link then r is max-min fair Why do we like this proposition: given allocation r it is easy to check if a session has a bottleneck link or not, and this way we can see if r is max-min fair or not.

13 Max-Min Fairness Proof: 1.If r is max-min fair then each session has a bottleneck link Def: a is a bottleneck link for p if F a =C a and r p r p’ for all p’≠p Proof with contradiction: assume max-min, but p does not have bottleneck link. –For all link a on the path, define  a : –if F a =C a, then there is at least one session with rate r pa higher than r p, and let  a = r pa -r p and –if F a <C a, then the link is not saturated, and let  a = C a -F a. Possible to increase r p with min( a ) without decreasing rates lower than r p. This contradicts the max-min fairness definition F a =C a,  a = r pa -r p F a <C a,  a = C a -F a

14 Max-Min Fairness Proof: 2.If each session has a bottleneck link then r is max-min fair Proof: consider the following for each session. –Consider session p with bottleneck link a (F a =C a ) – Due to the definition of bottleneck link r pa  r p and consequently r p can not be increased without decreasing a session with lower rate. –This is true for all sessions, thus the allocation is max-min fair

15 Utility function Utility function: to describe the value of a resource. E.g., Application requires fixed rate: r* Allocated rate: r Utility of allocated rate: u(r)=0 if r =r* Typical utility functions: Linear u(r)=r Logarithmic u(r)=log r Step function – as above

16 Rate-proportional fairness Name: rate proportional or proportional fairness Note! Change in notation! Rate:, flow: r, set of flows: R Def1: Allocation  ={ r } is proportionally fair if for any ’ ={’ r } : thus, for all other allocation the sum of proportional rate changes with respect to  are negative. Def2: The proportionally far allocation maximizes ∑ R log r – maximizes the overall utility of rate allocations with a logarithmic utility function.

17 Rate-proportional fairness Example: parking lot scneario L links, R 0 crosses all links, others only one link 1 0 L

18 Rate-proportional fairness Long routes are penalized The same as the “equal resources scenario on the first slides.

19 Rate-proportional fairness – equivalence of definitions Let { i *} be the optimal rate allocation and an other { i ’} allocation.

20 Other fairness definitions L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“ IEEE Infocom 2000, sections I and II. Max-min Proportional Potential delay minimization Weighted shares for various fairness definitions

21 Fairness - summary What is a fair allocation? –E.g., max throughput allocation may be very unfair, equal rate allocation may lead to low throughput Max-min fairness –Definition 1: Maximize the smallest allocated rate –Definition 2: No rates can be increased without decreasing an already smaller one –Proposition: allocation max-min fair iff all sessions have a bottleneck link Utility based fairness definitions Rate proportional fairness –for all other allocation the some of relative changes is negative –maximizes the sum of log(r)

22 Home reading Bertsekas, Gallager, Data networks, 6.5 L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“ IEEE Infocom 2000, sections I and II.

23 Fairness – distributed control We have seen a number of fairness definitions. Fair allocation for a given set of flows can be calculated (filling, or solving the related optimization problem). How can fair allocation be provided in a distributed way?

24 Traffic control for max-min fairness GPS provides max-min fairness for a single node. What happens in networks with GPS nodes but without any end-to-end control? Is max-min fairness achieved? Multiple node example: –1 flow from S1 to D1 –10 flows from S2 to D2 Calculate the max-min fair rates for the entire network. Flow to D1: 10 Flows to D2: 0.1 S1 S2 XY D2 D1 C=11 C=10 C=1 C=∞

25 Traffic control for max-min fairness GPS provides max-min fairness for a single node. What happens in networks with GPS nodes but without any rate control? Is max-min fairness achieved? Multiple node example: –1 flow from S1 to D1 –10 flows from S2 to D2 Calculate the per flow rates on the links when node X and Y provides GPS, independently from each other. (X considers the traffic that arrives to it from S1 and S2, Y considers the traffic arriving from X.) S1 S2 XY D2 D1 C=11 C=10 C=1 C=∞

26 Traffic control for max-min fairness GPS provides max-min fairness for a single node. What happens in networks with GPS nodes but without any rate control? Is max-min fairness achieved? Multiple node example: –1 flow from S1 to D1 –10 flows from S2 to D2 Without rate control: –X: rate 1 to all flows –Y: rate 0.1 to flows to D2 –Result: –Flow to D1: 1 –Flows to D2: 0.1 Fair rates would be: –Flows to D1: 10 –Flows to D2: 0.1 S1 S2 XY D2 D1 C=11 C=10 C=1 C=∞ Thus, max-min fairness is not achieved without end-to-end control.

27 Traffic control for fairness Student presentation on how to achieve fairness with distributed control –

28 Traffic control for fairness How to achieve fairness with distributed control – other results from Massoulie and Roberts With fixed window size: –FIFO achieves proportional fairness –longest queue first achieves maximum throughput –service proportional to the square root of the buffer content achieves minimum potential delay With dynamic window: –additive increase multiplicative decrease achieves proportional fair allocation (case of TCP) –logarithmic increase multiplicative decrease achieves minimum potential delay –max-min fair rate can not be achieved with increase- decrease algorithms

29 Fairness - objectives and algorithms - summary Step 1: what is the “optimal” share? –What is optimal – a design decision –Fairness definitions: max-min, proportional fair, etc. –Centralized algorithms to calculate fair shares Step 2: how to ensure fair shares? –Traffic control at the network edges (congestion or rate control) –Scheduling at the network nodes –E.g: –fixed window based congestion control + GPS: max-min –AIMD + FIFO: proportional fair