Title: An Adaptive Queue Management Method for Congestion Avoidance in TCP/IP Networks Presented By: Frank Posluszny Vishal Phirke Matt Hartling 12/31/2018.

Slides:



Advertisements
Similar presentations
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
Advertisements

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
 Liang Guo  Ibrahim Matta  Computer Science Department  Boston University  Presented by:  Chris Gianfrancesco and Rick Skowyra.
CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
5/17/20151 Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented.
Md. Manzoor MurshedAdaptive RED with Dynamic Threshold Adjustment CprE599: Creative Component Adaptive RED with Dynamic Threshold Adjustment.
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Max Min Fairness How define fairness? “ Any session is entitled to as much network use as is any other ” ….unless some sessions can use more without hurting.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-6600: Internet Protocols Informal Quiz #05: SOLUTIONS Shivkumar Kalyanaraman: GOOGLE: “Shiv.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.
The Power of Explicit Congestion Notification Aleksandar Kuzmanovic Northwestern University
ICN01 Colmar, France July 10, A Performance Study of Explicit Congestion Notification (ECN) with Heterogeneous TCP Flows Robert Kinicki and Zici.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, All our slides and papers.
Explicit Congestion Notification ECN Tilo Hamann Technical University Hamburg-Harburg, Germany.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Networks: Congestion Control1 Congestion Control.
6/16/20151 On Designing Improved Controllers for AQM Routers Supporting TCP flows By C.V Hollot, Vishal Mishra, Don Towsley and Wei-Bo Gong Presented by.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Low Delay Marking for TCP in Wireless Ad Hoc Networks Choong-Soo Lee, Mingzhe Li Emmanuel Agu, Mark Claypool, Robert Kinicki Worcester Polytechnic Institute.
RAP: An End-to-End Rate-Based Congestion Control Mechanism for Realtime Streams in the Internet Reza Rejai, Mark Handley, Deborah Estrin U of Southern.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
1 Traffic Sensitive Quality of Service Controller Masters Thesis Submitted by :Abhishek Kumar Advisors: Prof Mark Claypool Prof Robert Kinicki Reader:
1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp
A Real-Time Video Multicast Architecture for Assured Forwarding Services Ashraf Matrawy, Ioannis Lambadaris IEEE TRANSACTIONS ON MULTIMEDIA, AUGUST 2005.
Random Early Detection Gateways for Congestion Avoidance
Rafael C. Nunez - Gonzalo R. Arce Department of Electrical and Computer Engineering University of Delaware May 19 th, 2005 Diffusion Marking Mechanisms.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware Aug 19th / 2004 Rafael Nunez.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.
Advanced Computer Networks : RED 1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
B 李奕德.  Abstract  Intro  ECN in DCTCP  TDCTCP  Performance evaluation  conclusion.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
Worcester Polytechnic Insitute, Worcester, MA, USA1 Traffic Sensitive Active Queue Management for Improved Multimedia Streaming Authors: Vishal Phirke,
The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.
15744 Course Project1 Evaluation of Queue Management Algorithms Ningning Hu, Liu Ren, Jichuan Chang 30 April 2001.
AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.
Spring 2003CS 3321 Congestion Avoidance. Spring 2003CS 3322 Congestion Avoidance TCP congestion control strategy: –Increase load until congestion occurs,
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.
Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for AQM By Srisankar Kunniyur & R. Srikant Presented by Hareesh Pattipati.
ECEN 619, Internet Protocols and Modeling Prof. Xi Zhang Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions.
Congestion Avoidance Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
CS492B Project #2 TCP Tutorial # Jin Hyun Ju.
Real-time Transport for Assured Forwarding: An Architecture for both Unicast and Multicast Applications By Ashraf Matrawy and Ioannis Lambadaris From Carleton.
1 Tuning RED for Web Traffic SIGCOMM 2000 Paper by M. Christiansen, K. Jeffray, D. Ott, F.D. Smith, UNC – Chapel Hill CS 590 F Fall 2000 Paper presentation.
Corelite Architecture: Achieving Rated Weight Fairness
CS 268: Computer Networking
Blue: An Alternative Approach to Active Queue Management
Chapter 3 outline 3.1 transport-layer services
Chapter 6 Congestion Avoidance
Congestion Control: The Role of the Routers
Router-Assisted Congestion Control
Advance Computer Networking
EE 122: Router Support for Congestion Control: RED and Fair Queueing
Analysis of Congestion Control Mechanisms in Congestion Control
Random Early Detection Gateways for Congestion Avoidance
FAST TCP : From Theory to Experiments
COS 461: Computer Networks
Max Min Fairness How define fairness?
RAP: Rate Adaptation Protocol
The War Between Mice & Elephants by, Matt Hartling & Sumit Kumbhar
Project-2 (20%) – DiffServ and TCP Congestion Control
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Adaptive RED: An Algorithm for Increasing the Robustness of RED’s Active Queue Management or How I learned to stop worrying and love RED Presented by:
Queueing Problem The performance of network systems rely on different delays. Propagation/processing/transmission/queueing delays Which delay is affected.
Designing a Relative Delay Estimator for Multipath Transport
Presentation transcript:

Title: An Adaptive Queue Management Method for Congestion Avoidance in TCP/IP Networks Presented By: Frank Posluszny Vishal Phirke Matt Hartling 12/31/2018

Outline Background Network Power Simulation Topology Weakness of RED - Motivation Algorithm Simulations & Comparisons RED Vs READ READ Tuning Conclusions and Future Work 12/31/2018

Background (1) Goals: Show drawbacks of RED with ECN Propose new AQM: Random Early Adaptive Detection 12/31/2018

Background (2) TCP congestion control Congestion Control vs. Avoidance RED ECN 12/31/2018

Background (3) ECN: Binary feedback scheme Router sets a bit in packet to “mark” instead of drop ACK mirrors the marking back to receiver 12/31/2018

Outline Background Network Power Simulation Topology Weakness of RED - Motivation Algorithm Simulations & Comparisons RED Vs READ READ Tuning Conclusions and Future Work 12/31/2018

Throughput optimized N/W What’s Power?? Throughput Delay Throughput optimized N/W -Great throughput- Takes 15minutes to view a web page. Delay optimized N/W -Low Delays – But the web page is missing a lot of information.…. Throughput Response Time Power = 12/31/2018

Outline Background Network Power Simulation Topology Weakness of RED - Motivation Algorithm Simulations & Comparisons RED Vs READ READ Tuning Conclusions and Future Work 12/31/2018

Simulation Topology Bottleneck Queue Size = 60 pkts Pkt Size = 512 bytes MINth= 15 MAXth= 45 12/31/2018

Outline Background Network Power Simulation Topology Weakness of RED - Motivation Algorithm Simulations & Comparisons RED Vs READ READ Tuning Conclusions and Future Work 12/31/2018

Weakness of RED - Motivation 12/31/2018

Weakness of RED - Motivation 12/31/2018

Weakness of RED - Motivation 10 flows Weakness of RED - Motivation 12/31/2018

Weakness of RED - Motivation 60 flows Weakness of RED - Motivation 12/31/2018

Weakness of RED - Motivation 20 flows 12/31/2018

Outline Background Network Power Simulation Topology Weakness of RED - Motivation Algorithm Simulations & Comparisons RED Vs READ READ Tuning Conclusions and Future Work 12/31/2018

Random Early Adaptive Detection Exponentially Weighted Moving Averages Avgt+1 = (1-wq) avgt + wq qt Old weighted average Instantaneous queue Slt+1 = (1-wsl) slt + wsl (avgt+1 – avgt) Old weighted slope Instantaneous slope 12/31/2018

Random Early Adaptive Detection At each change of MIN (MAX + MIN) 2 level = if(level > buffer * 0.52) p = p + INC INC = 0.02 if(level < buffer * 0.48) DEC = 0.002 p = p - DEC 12/31/2018

Outline Background Network Power Simulation Topology Weakness of RED - Motivation Algorithm Simulations & Comparisons RED Vs READ READ Tuning Conclusions and Future Work 12/31/2018

Fig 5: Throughput Vs. Delay 12/31/2018

READ Vs. RED (1) RED: Lower Drop probability = Higher Throughput & Higher Delay Higher Drop probability = Lower Delay & Lower Throughput READ: Always Lower Delay and Higher Throughput 12/31/2018

Fig 6: Power (alpha=1) 12/31/2018

Fig 7: Power (alpha = 2) 12/31/2018

READ Vs. RED (2) RED: Performance varies with maxp and number of flows Performs worse than Drop Tail under certain conditions READ: Always performs better than RED and Drop Tail 12/31/2018

Table 1: Throughput For Mixed Traffic 12/31/2018

Fig 8 & 9: Adaptation to Changes in Network Conditions 12/31/2018

READ Vs. RED (3) RED: Large variation in instantaneous and average queue size Large variation in marking probability Marking probability varies with queue size READ: Less variation in marking probability and queue size Large, periodic fluctuations 12/31/2018

Outline Background Network Power Simulation Topology Weakness of RED - Motivation Algorithm Simulations & Comparisons RED Vs READ READ Tuning Conclusions and Future Work 12/31/2018

Fig 10: READ Tuning 12/31/2018

Outline Background Network Power Simulation Topology Weakness of RED - Motivation Algorithm Simulations & Comparisons RED Vs READ READ Tuning Conclusions and Future Work 12/31/2018

Conclusions and Future Work RED can fail & too aggressive READ – reliable CA; higher power levels Current & Future Work: Examine different increase/decrease algorithms READ with different Network Topologies 12/31/2018