Improving Individual Flow Performance with Multiple Queue Fair Queuing Author: Manfred Georg, Christoph Jechlitschek, Sergey Gorinsky Publisher: Quality.

Slides:

Advertisements

Similar presentations

A Switch-Based Approach to Starvation in Data Centers Alex Shpiner and Isaac Keslassy Department of Electrical Engineering, Technion. Gabi Bracha, Eyal.

Advertisements

RED-PD: RED with Preferential Dropping Ratul Mahajan Sally Floyd David Wetherall.

Computer Networking Lecture 20 – Queue Management and QoS.

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

1 GPS Example 2: Arrivals o Eleven Sources. First source gets 0.5. Other 10 sources get 0.05 each. First source sends 11 cells send one each at t=0.

Deficit Round Robin Scheduler. Outline Introduction Ordinary Problems Deficit Round Robin Latency of DRR Improvement of latencies.

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.

Network and Communications Hongsik Choi Department of Computer Science Virginia Commonwealth University.

Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.

Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.

CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.

CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.

1 Scalable Network Architectures for Providing Per-flow Service Guarantees Jasleen Kaur Department of Computer Science University of North Carolina at.

Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.

Ion Stoica, Scott Shenker, and Hui Zhang SIGCOMM’98, Vancouver, August 1998 subsequently IEEE/ACM Transactions on Networking 11(1), 2003, pp Presented.

1 Core Stateless Fair Queueing Ion Stoica Hui Zhang Scott Shenker CMU CMU Xerox PARC CMU CMU Xerox PARC.

By Sam Rossoff. The Red Police Controlling High- Bandwidth Flows at the Congested Router By Ratul Mahajan Sally Floyd and David Wetherall.

1 Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Core-Stateless Fair Queueing:

1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, All our slides and papers.

DigiComm II Scheduling and queue management. DigiComm II Traditional queuing behaviour in routers Data transfer: datagrams: individual packets no recognition.

Scheduling CS 215 W Keshav Chpt 9 Problem: given N packet streams contending for the same channel, how to schedule pkt transmissions?

Service Disciplines for Guaranteed Performance Service Hui Zhang, “Service Disciplines for Guaranteed Performance Service in Packet-Switching Networks,”

15-744: Computer Networking L-11 Queue Management.

Network Delays, Statistical Multiplexing

CS 268: Lecture 8 (Router Support for Congestion Control) Ion Stoica February 19, 2002.

1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,

Promoting the Use of End-to- End Congestion Control in the Internet Sally Floyd and Kevin Fall Presented by Scott McLaren.

Stochastic Fair Traffic Management for Efficient and Robust IP Networking Jae Chung Airvana Inc. Chelmsford, MA Mark Claypool, Robert Kinicki WPI.

1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.

Computer Networking Lecture 17 – Queue Management As usual: Thanks to Srini Seshan and Dave Anderson.

Performance and Robustness Testing of Explicit-Rate ABR Flow Control Schemes Milan Zoranovic Carey Williamson October 26, 1999.

1 Copyright © Monash University ATM Switch Design Philip Branch Centre for Telecommunications and Information Engineering (CTIE) Monash University

1 Queue Management Hamed Khanmirza Principles of Networking University of Tehran.

ACN: CSFQ1 CSFQ Core-Stateless Fair Queueing Presented by Nagaraj Shirali Choong-Soo Lee ACN: CSFQ1.

CS 268: Computer Networking L-6 Router Congestion Control.

ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.

1. Performance Guarantees Introduction –by asking sources about flow behavior it is possible to construct networks that could guarantee performance for.

Worcester Polytechnic Insitute, Worcester, MA, USA1 Traffic Sensitive Active Queue Management for Improved Multimedia Streaming Authors: Vishal Phirke,

Presented by: Peng Wang EE Department University of Delaware A Probabilistic Approach for Achieving Fair Bandwidth Allocation in CSFQ.

Stochastic Fair Blue: A Queue Management Algorithm for Enforcing Fairness W. Feng, D. Kandlur, D. Saha, and K. Shin Presented by King-Shan Lui.

Queueing and Active Queue Management Aditya Akella 02/26/2007.

Network Design and Analysis-----Wang Wenjie Queuing Theory III: 1 © Graduate University, Chinese academy of Sciences. Network Design and Performance Analysis.

Packet Scheduling and Buffer Management Switches S.Keshav: “ An Engineering Approach to Networking”

15744 Course Project1 Evaluation of Queue Management Algorithms Ningning Hu, Liu Ren, Jichuan Chang 30 April 2001.

Opportunistic Traffic Scheduling Over Multiple Network Path Coskun Cetinkaya and Edward Knightly.

CS640: Introduction to Computer Networks Aditya Akella Lecture 20 - Queuing and Basics of QoS.

AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.

Packet Scheduling: SCFQ, STFQ, WF2Q Yongho Seok Contents Review: GPS, PGPS SCFQ( Self-clocked fair queuing ) STFQ( Start time fair queuing ) WF2Q( Worst-case.

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.

1 Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Core-Stateless Fair Queueing:

1 Routing and Resilience in Future Optical Broadband Telecommunications Networks 21 st January 2004 Andrew S. T. Lee Supervisor: Dr. David Harle Broadband.

Stochastic Fair Blue An Algorithm For Enforcing Fairness Wu-chang Feng (OGI/OHSU) Dilip Kandlur (IBM) Debanjan Saha (Tellium) Kang Shin (University of.

Queue Scheduling Disciplines

Adaptive Inverse Multiplexing for Wide-Area Wireless Networks Alex C. Snoeren MIT Laboratory for Computer Science IEEE Globecom ’99 Rio de Janeiro, December.

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.

Columbia University in the city of New York

EE 122: Router Support for Congestion Control: RED and Fair Queueing

Variations of Weighted Fair Queueing

Scheduling Algorithms in Broad-Band Wireless Networks

ns-2 simulation of TCP + CBR traffic

The University of Adelaide, School of Computer Science

Native Simulation of Round-Robin Queuing

Variations of Weighted Fair Queueing

Advanced Computer Networks

Congestion Control Reasons:

Introduction to Packet Scheduling

Introduction to Packet Scheduling

Presentation transcript:

Improving Individual Flow Performance with Multiple Queue Fair Queuing Author: Manfred Georg, Christoph Jechlitschek, Sergey Gorinsky Publisher: Quality of Service, 2007 Fifteenth IEEE International Workshop on Presenter: Chun-Yi Li Date: 2008/10/29

2 Overview  Previous Work Protecting Flow Performance Fair Queuing Stochastic Fair Queuing (SFQ)  Multiple Queue Fair Queuing Introduction Deficit Round Robin Avoid Reordering  Performance

3 Protecting Flow Performance  Per-Flow Fair Queuing Poor scalability  Aggregate Fair Queuing (SFQ, SFB) ‏ No protection within aggregate  Identify and Limit (CHOKe, AFD) ‏ Delayed reaction Difficult to detect some flows  Multiple Queue Fair Queuing (MQFQ) ‏ Per-aggregate fair queuing with backup queue for each flow

4 Fair Queuing  Each Flow Has Different Queue Serve queues independently Incoming Packets Outgoing Packets Flow 1 Flow 3 Flow 2

5 1 Stochastic Fair Queuing  Fixed Number of Queues Hash function maps flow to queue Blue Orange Gray Green Hash Function Flow 1 and 3 Interfere

6 Multiple Queue Fair Queuing (MQFQ) ‏  Fixed Number of Queues  Two Hash Functions  Protection of Individual Flows in Aggregate Queuing  Surrender Some Capacity to Misbehavers  No Packet Reordering Within Flow

Multiple Queue Fair Queuing (MQFQ) ‏  Two Hash Functions Place packet in queue with fastest service Avoid misbehavior Blue Orange Gray Green Hash Function 1 Hash Function Quantum Partial Interference Between Flows 1 and Complete Interference Between Flows 1 and 4

8 Deficit Round Robin  Each Queue Maintains a Deficit Quantum added to deficit and then spent Outgoing Link Quantum Blue Orange Gray Green

9 Probability of Flow Interference MQFQ Partial MQFQ Complete SFQ Complete (k)‏

10 Avoid Reordering  MQFQ Can Reorder Different Length Packets by at Most One Round  Split Packets Into Constant Sized Cells All packets have same possibilities Cells generally used in multi-stage switches

11 50 TCP Flows

12 49 TCP flows + Misbehaving CBR

13 50 CBR Flows

14 Many Hash Functions (TCP Flows) ‏