1 On Maximum Rate Control of Weighted Fair Scheduling Jeng Farn Lee.

Slides:



Advertisements
Similar presentations
CprE 458/558: Real-Time Systems
Advertisements

Scalable QoS Provision Through Buffer Management Roch Guerin Sanjay Kamat Vinod Peris Raju Rajan IBM Thomas J. Watson Research Labs.
1 Network Telecommunication Group University of Pisa - Information Engineering department January Speaker: Raffaello Secchi Authors: Davide Adami.
CS 268: Packet Scheduling Ion Stoica March 18/20, 2003.
CprE 458/558: Real-Time Systems (G. Manimaran)1 CprE 458/558: Real-Time Systems Real-Time Networks – WAN Packet scheduling (contd.)
1 Comnet 2010 Communication Networks Recitation 4 Scheduling & Drop Policies.
Winter 2004 UCSC CMPE252B1 CMPE 257: Wireless and Mobile Networking SET 3f: Medium Access Control Protocols.
1 Weighted Fair Queueing GPS PGPS SCFQ Implementation.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
Tiziana Ferrari Differentiated Services Test: Report1 Differentiated Service Test REPORT TF-TANT Tiziana Ferrari Frankfurt, 1 Oct.
Traffic Shaping Why traffic shaping? Isochronous shaping
Quality of Service Requirements
1.  Congestion Control Congestion Control  Factors that Cause Congestion Factors that Cause Congestion  Congestion Control vs Flow Control Congestion.
Engineering Internet QoS
Abhay.K.Parekh and Robert G.Gallager Laboratory for Information and Decision Systems Massachusetts Institute of Technology IEEE INFOCOM 1992.
Courtesy: Nick McKeown, Stanford 1 Intro to Quality of Service Tahir Azim.
Worst-case Fair Weighted Fair Queueing (WF²Q) by Jon C.R. Bennett & Hui Zhang Presented by Vitali Greenberg.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.
CS 268: Lecture 15/16 (Packet Scheduling) Ion Stoica April 8/10, 2002.
Generalized Processing Sharing (GPS) Is work conserving Is a fluid model Service Guarantee –GPS discipline can provide an end-to-end bounded- delay service.
Service Disciplines for Guaranteed Performance Service Hui Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,”
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Packet Scheduling and QoS Computer Science Division Department of Electrical Engineering and.
Distributed Fair Scheduling in a Wireless LAN Gautam Kulkarni EE206A (Spring 2001) Nitin Vaidya, Paramvir Bahl and Seema Gupta (appeared in Mobicom 2000.
Medium Start in TCP-Friendly Rate Control Protocol CS 217 Class Project Spring 04 Peter Leong & Michael Welch.
Lecture 4#-1 Scheduling: Buffer Management. Lecture 4#-2 The setting.
CSc 461/561 CSc 461/561 Multimedia Systems Part C: 3. QoS.
Proxy-based TCP over mobile nets1 Proxy-based TCP-friendly streaming over mobile networks Frank Hartung Uwe Horn Markus Kampmann Presented by Rob Elkind.
7/15/2015HY220: Ιάκωβος Μαυροειδής1 HY220 Schedulers.
Packet Scheduling From Ion Stoica. 2 Packet Scheduling  Decide when and what packet to send on output link -Usually implemented at output interface 1.
QoS II - Adaptive Virtual Queue - Fair Queueing for Multiple Link 12 th Mar., 2002 Eun-Chan Park CSL, SoEECS, SNU.
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case Abhay K. Parekh, Member, IEEE, and Robert.
An Integrated IP Packet Shaper and Scheduler for Edge Routers MSEE Project Presentation Student: Yuqing Deng Advisor: Dr. Belle Wei Spring 2002.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
Distributed Multimedia March 19, Distributed Multimedia What is Distributed Multimedia?  Large quantities of distributed data  Typically streamed.
Providing Delay Guarantees in Bluetooth Rachid Ait Yaiz and Geert Heijenk International Conference on Distributed Computing Systems Workshops (ICDCSW’03)
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Fair Queueing. 2 First-Come-First Served (FIFO) Packets are transmitted in the order of their arrival Advantage: –Very simple to implement Disadvantage:
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
March 29 Scheduling ?. What is Packet Scheduling? Decide when and what packet to send on output link 1 2 Scheduler flow 1 flow 2 flow n Buffer management.
Uplink Scheduling with Quality of Service in IEEE Networks Juliana Freitag and Nelson L. S. da Fonseca State University of Campinas, Sao Paulo,
Florida State UniversityZhenhai Duan1 BCSQ: Bin-based Core Stateless Queueing for Scalable Support of Guaranteed Services Zhenhai Duan Karthik Parsha Department.
CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.
Nick McKeown Spring 2012 Lecture 2,3 Output Queueing EE384x Packet Switch Architectures.
ECS5365 Lecture 6 ATM Traffic and Network Management
Packet Scheduling: SCFQ, STFQ, WF2Q Yongho Seok Contents Review: GPS, PGPS SCFQ( Self-clocked fair queuing ) STFQ( Start time fair queuing ) WF2Q( Worst-case.
Dynamic Bandwidth Allocation with Fair Scheduling For WCDMA Systems Liang Xu, Xumin Shen, and Jon W. Mark University of Waterloo published in IEEE Wireless.
Scheduling CS 218 Fall 02 - Keshav Chpt 9 Nov 5, 2003 Problem: given N packet streams contending for the same channel, how to schedule pkt transmissions?
Lecture Note on Scheduling Algorithms. What is scheduling? A scheduling discipline resolves contention, “who is the next?” Goal: fairness and latency.
1 Fair Queuing Hamed Khanmirza Principles of Network University of Tehran.
CS Spring 2011 CS 414 – Multimedia Systems Design Lecture 16 – Multimedia Transport (Part 2) Klara Nahrstedt Spring 2011.
Providing QoS in IP Networks
Univ. of TehranIntroduction to Computer Network1 An Introduction Computer Networks An Introduction to Computer Networks University of Tehran Dept. of EE.
Scheduling for QoS Management. Engineering Internet QoS2 Outline  What is Queue Management and Scheduling?  Goals of scheduling  Fairness (Conservation.
OverQos: An Overlay based Architecture for Enhancing Internet Qos L Subramanian*, I Stoica*, H Balakrishnan +, R Katz* *UC Berkeley, MIT + USENIX NSDI’04,
CS244 Packet Scheduling (Generalized Processor Sharing) Some slides created by: Ion Stoica and Mohammad Alizadeh
04/02/08 1 Packet Scheduling IT610 Prof. A. Sahoo KReSIT.
A Strategy to Compute the InfiniBand Arbitration Tables
Team: Aaron Sproul Patrick Hamilton
QoS & Queuing Theory CS352.
Topics discussed in this section:
Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay Sriram Ramabhadran Joseph Pasquale Presented by Sailesh.
Columbia University in the city of New York
CONGESTION CONTROL.
Quality of Service For Traffic Aggregates
Computer Science Division
The Network Layer Congestion Control Algorithms & Quality-of-Service
EECS 122: Introduction to Computer Networks Packet Scheduling and QoS
کنترل جریان امیدرضا معروضی.
Presentation transcript:

1 On Maximum Rate Control of Weighted Fair Scheduling Jeng Farn Lee

2 Outline Introduction Related Work WF2Q with maximum rate control Simulations Conclusions

3 Introduction Current service disciplines provided minimum performance guarantees, but not maximum rate constraint Max-Rate Control is needed Control lease line ’ s maximum services rate Restrict specific applications ’ total traffics to enforce some management policies

4 Introduction (cont ’ d) Ban over-provisioning in a link-sharing environment (e.g. WF 2 Q) Stabilize the throughput to smooth media streaming in order not to overflow receiving buffers or cause packet drop

5 GPS GPS (Generalized Processor Sharing) A fluid system traffic is infinitely divisible all the traffic streams can receive service simultaneously Each session i is assigned a fixed real-valued positive parameter

6 GPS (cont’d) session is idle after time 10

7 Virtual Clock Implementation of PGPS Virtual clock is a clock to keep a normalized time as a standard reference for all sessions/packets.

8 Two-Stage Rate-Control Service Model

9 Two-Stage Rate-Control Service Model (cont’d) Drawbacks When move packets from regulator queue to eligible queue Timer the system must use one interrupt to change the status per packet Time-framing (system accuracy v.s. time granularity) Event-Driven (high uncertainty) It still needs to modify the scheduling algorithm to distribute the excess bandwidth to other sessions

10 Policer-Based Rate-Control Service Model

11 Policer-Based Rate-Control Service Model (cont ’ d) Drawbacks Token bucket Token buffer allows traffic exceed the maximum rate Leaky bucket Not allow traffic burst

12 Simulation environment ns2 Version : ns-allinone2.1b6 WFQ patch 1.1a1 We implement of policer-based rate-control service model and WF 2 Q-M topology

13 Traffic pattern UDP Exponential ON/OFF traffic The packet size of ON period : exponential distribution with mean (1000, 950 and 900 bytes) The maximum rate of the session is 4Mbps

14 Traffic pattern

15 Token bucket with r = 4Mbps, B=0.25Mb Loss rate : 0.211% Over max rate rate : 12.96%

16 Leaky bucket r=4Mbps Loss rate : 58.89%

17 Wf2q-m buffer size 0.25Mb Loss rate : 0.219%

18

19 GPS-M An extension of GPS A session can be “ normal ” session or “ maximum rate constrained ” session. If a maximum rate constrained has shared bandwidth greater than the maximum rate, It receives the maximum rate; GPS-M distributes the excess bandwidth to others weightily WF 2 Q-M use the same link sharing principle as GPS-M

20 GPS-M Resource Allocation ex. 10 packets per second, reserved bandwidth 5:2.5:1.25:1.25 GPS and GPS-M GPS GPS-M Max Rate=4

21 Features of WF 2 Q-M Merge packet eligible time into virtual starting time Only the packets have started receiving service in GPS-M can be selected for transmission Adjust the ticking rate of the system virtual clock to distribute the excess bandwidth from saturated queues to other sessions Use the same real clock/virtual clock ratio to transfer real clock for packets of saturated queues to virtual clock

22 Virtual Clock Adjustment ratio(t)=

23 Marge eligible time into virtual starting time The virtual starting and finishing times of packets of B p (p)

24 WF 2 Q-M: Virtual Times

25 Simulations ns2 Version : ns-allinone2.1b6 WFQ patch 1.1a1 WF 2 Q and WF 2 Q-M topology

26 Simulations (cont’d) Data sending rate : 5Mbps Packet size : Uniform(100,1500) bytes Data type : UDP Maximum rate of session 3 is 3Mbps

27 Simulation Result (WF 2 Q)

28 Simulation Result (WF 2 Q-M) Maximum rate is 3Mbps

29 Conclusions we propose a new service discipline WF 2 Q-M guarantee minimum service rates as WF 2 Q provide maximum service rate constraint merge packet eligible time into its virtual starting time to reduce complexity virtual clock adjustment allows the sharing of excess bandwidth to non saturated sessions WF 2 Q-M performance is bounded by a fluid reference mode

30 Thank You! Jeng Farn Lee