1 / 14

Improving Individual Flow Performance with Multiple Queue Fair Queuing

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. Overview. Previous Work

lenci
Download Presentation

Improving Individual Flow Performance with Multiple Queue Fair Queuing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 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 Flow 1 Flow 2 Incoming Packets Outgoing Packets Flow 3

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

  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

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

  8. Deficit Round Robin • Each Queue Maintains a Deficit • Quantum added to deficit and then spent Quantum Blue 3 3 1 Orange 4 2 2 4 1 Green 2 2 Outgoing Link Gray

  9. Probability of Flow Interference MQFQ Partial SFQ Complete MQFQ 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 1 1 1 1 1 1

  11. 50 TCP Flows

  12. 49 TCP flows + Misbehaving CBR

  13. 50 CBR Flows

  14. Many Hash Functions (TCP Flows)‏

More Related