1. Worcester Polytechnic Insitute, Worcester, MA, USA1 Traffic Sensitive Active Queue Management for Improved Multimedia Streaming Authors: Vishal Phirke, Mark Claypool and Robert Kinicki Presenter: Choong-Soo Lee

2. Worcester Polytechnic Insitute, Worcester, MA, USA2 Outline Introduction RED-Boston Active Queue Management Evaluation Conclusion

3. Worcester Polytechnic Insitute, Worcester, MA, USA3 Introduction: Application QoS Requirement Throughput Sensitivity Delay Sensitivity FTP, E-mail (Large Queues) Web Applications (Medium Queues) Interactive Multimedia (Small Queues)

4. Worcester Polytechnic Insitute, Worcester, MA, USA4 Introduction: Approach Delay Hints  Queueing delay in milliseconds as source hint  Can be tagged on the IP packet by either the end host or edge router  10 bits -> 0 ms ~ 1024 ms range

5. Worcester Polytechnic Insitute, Worcester, MA, USA5 Outline Introduction RED-Boston Active Queue Management Evaluation Conclusion and Future Work

6. Worcester Polytechnic Insitute, Worcester, MA, USA6 RED-Boston 80 32 Throughput Sensitive Delay Sensitive 80 32 80 32 80 32 80 32 80 32 80 32 80 32 Adaptive RED RED-Boston Throughput Sensitive Delay Sensitive Throughput-Delay Sensitive

7. Worcester Polytechnic Insitute, Worcester, MA, USA7 RED-Boston: Mechanism min th max th Average Queue Size Drop Probability 0 1 Moving Target max p adaptation Delay Sensitive Throughput Sensitive

8. Worcester Polytechnic Insitute, Worcester, MA, USA8 RED-Boston: Delay Hint Based Drop Probability Low Delay Service is NOT free Drop Probability Calculation Delay hint is inversely proportional to drop rate

9. Worcester Polytechnic Insitute, Worcester, MA, USA9 RED-Boston: Weighted Insert A weight is assigned to incoming packets Router’s queue is sorted based on weight  Packets with lower delay hints will be served first Automatic Aging Automatic Protection from Packet Reordering 15 3 32 40 60 70 75 78 55 80

10. Worcester Polytechnic Insitute, Worcester, MA, USA10 RED-Boston: Algorithm For Each Incoming Packet Moving Target Delay Hint Based Drop Probability Weighted Insert C = Link Capacity (bps) D = Delay hint (sec) P = Packet Size (bits)

11. Worcester Polytechnic Insitute, Worcester, MA, USA11 Outline Introduction RED-Boston Active Queue Management Evaluation Conclusion and Future Work

12. Worcester Polytechnic Insitute, Worcester, MA, USA12 Evaluation: Topology R1R1 R2R2 S1S1 S2S2 S 20 D1D1 D2D2 D 20 5Mbps 20ms 20Mbps 15ms 20Mbps 15ms Queue Size : 120 packets min th : 20 packets max th : 80 packets 0 sec100 sec20sec80sec

13. Worcester Polytechnic Insitute, Worcester, MA, USA13 Evaluation: Metrics Throughput (bps) Queueing Delay (ms) QoS for an application at the router

14. Worcester Polytechnic Insitute, Worcester, MA, USA14 Evaluation: Simulation Set 19 15 10 5 1 5 10 15 19 016486496112 Delay Hints (ms) Number of Delay Sensitive Flows Number of Throughput Sensitive Flows 20 Total # of Flows Simulation # 1234512345 8032

15. Worcester Polytechnic Insitute, Worcester, MA, USA15 Evaluation: Queueing Delay

16. Worcester Polytechnic Insitute, Worcester, MA, USA16 Evaluation: Average Queue Size

17. Worcester Polytechnic Insitute, Worcester, MA, USA17 Evaluation: Packet Drop Rate

18. Worcester Polytechnic Insitute, Worcester, MA, USA18 Evaluation: Average Per-Flow Throughput

19. Worcester Polytechnic Insitute, Worcester, MA, USA19 Evaluation: Normalized QoS

20. Worcester Polytechnic Insitute, Worcester, MA, USA20 Evaluation: Normalized QoS

21. Worcester Polytechnic Insitute, Worcester, MA, USA21 Outline Introduction RED-Boston Active Queue Management Evaluation Conclusion and Future Work

22. Worcester Polytechnic Insitute, Worcester, MA, USA22 Conclusion RED-Boston  Fair to delay sensitive flows compared to Adaptive RED  Gives applications flexibility to adjust their delay-throughput tradeoff based on observed performance  Improves QoS to each application in best effort service

23. Worcester Polytechnic Insitute, Worcester, MA, USA23 Future Work Further evaluation of RED-Boston My Research Work  QoS towards fairness among heterogeneous flows  AQM (RED, Blue, CSFQ, REM, PI) modifications