Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware Aug 19th / 2004 Rafael Nunez.

Slides:



Advertisements
Similar presentations
Helping TCP Work at Gbps Cheng Jin the FAST project at Caltech
Advertisements

Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.
Computer Networking Lecture 20 – Queue Management and QoS.
WHITE – Achieving Fair Bandwidth Allocation with Priority Dropping Based on Round Trip Time Name : Choong-Soo Lee Advisors : Mark Claypool, Robert Kinicki.
CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
Stability of computer network for the set delay Jolanta Tańcula.
1 Updates on Backward Congestion Notification Davide Bergamasco Cisco Systems, Inc. IEEE 802 Plenary Meeting San Francisco, USA July.
Md. Manzoor MurshedAdaptive RED with Dynamic Threshold Adjustment CprE599: Creative Component Adaptive RED with Dynamic Threshold Adjustment.
PERSISTENT DROPPING: An Efficient Control of Traffic Aggregates Hani JamjoomKang G. Shin Electrical Engineering & Computer Science UNIVERSITY OF MICHIGAN,
The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)
Explicit Congestion Notification (ECN) RFC 3168 Justin Yackoski DEGAS Networking Group CISC856 – TCP/IP Thanks to Namratha Hundigopal.
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.
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Advanced Computer Networks: RED 1 Random Early Detection Gateways for Congestion Avoidance * Sally Floyd and Van Jacobson, IEEE Transactions on Networking,
“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.
Active Queue Management. Fundamental problem: Queues and TCP Queues –Queues are to absorb bursts of packets. –They are required for statistical multiplexing.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, All our slides and papers.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
Networks: Congestion Control1 Congestion Control.
TCP Stability and Resource Allocation: Part I. References The Mathematics of Internet Congestion Control, Birkhauser, The web pages of –Kelly, Vinnicombe,
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.
Improving Adaptability and Fairness in Internet Congestion Control May 30, 2001 Seungwan Ryu PhD Student of IE Department University at Buffalo.
EE689 Lecture 5 Review of last lecture More on HPF RED.
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, TCP Increase/Decrease.
1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Active Queue Management Rong Pan Cisco System EE384y Spring Quarter 2006.
Computer Networking Lecture 17 – Queue Management As usual: Thanks to Srini Seshan and Dave Anderson.
Random Early Detection Gateways for Congestion Avoidance
Promoting the Use of End-to-End Congestion Control & Random Early Detection of Network Congestion.
Rafael C. Nunez - Gonzalo R. Arce Department of Electrical and Computer Engineering University of Delaware May 19 th, 2005 Diffusion Marking Mechanisms.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Kaixin Xu, Mario Gerla University of California, Los Angeles {xkx,
References TCP is Max-Plus Linear, [Single flow] F.Baccelli, D.Hong TCP is Max-Plus Linear, Sigcomm 00 AIMD, Fairness and Fractal Scaling of TCP traffic,
Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware May 19th / 2004 Rafael Nunez.
UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.
Ns Simulation Final presentation Stella Pantofel Igor Berman Michael Halperin
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
Analysis of Active Queue Management Jae Chung and Mark Claypool Computer Science Department Worcester Polytechnic Institute Worcester, Massachusetts, USA.
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,
1 Queue Management Hamed Khanmirza Principles of Networking University of Tehran.
Advanced Computer Networking
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.
Queueing and Active Queue Management Aditya Akella 02/26/2007.
9.7 Other Congestion Related Issues Outline Queuing Discipline Avoiding Congestion.
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.
AQM & TCP models Courtesy of Sally Floyd with ICIR Raj Jain with OSU.
CS 447 Network & Data Communication QoS Implementation for the Internet IntServ and DiffServ Department of Computer Science Southern Illinois University.
Active Queue Management in Internet and Wireless Networks X. Deng, S. Yi, G. Kesidis and C. R. Das The Pennsylvania State University Stabilized queue size.
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.
Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.
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.
Blue: An Alternative Approach to Active Queue Management
Chapter 6 Congestion Avoidance
Router-Assisted Congestion Control
Random Early Detection Gateways for Congestion Avoidance
The University of Adelaide, School of Computer Science
Title: An Adaptive Queue Management Method for Congestion Avoidance in TCP/IP Networks Presented By: Frank Posluszny Vishal Phirke Matt Hartling 12/31/2018.
Max Min Fairness How define fairness?
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Queueing Problem The performance of network systems rely on different delays. Propagation/processing/transmission/queueing delays Which delay is affected.
Presentation transcript:

Diffusion Mechanisms for Active Queue Management Department of Electrical and Computer Engineering University of Delaware Aug 19th / 2004 Rafael Nunez Gonzalo Arce

2 Diffusion Mechanisms for Active Queue Management Image Processing Approaches to AQM: There is an intimate link between printing technologies and Active Queue Management.

3 The Internet Today TCP: de facto congestion control protocol. 90% of Internet traffic.

4 Congestion  Desirable control: distributed, simple, stable and fair.

5 Simplest Congestion Control: Tail Dropping Problems with tail dropping:  Penalizes bursty traffic  Discriminates against large propagation delay connections.  Global synchronization.

6 Active Queue Management (AQM)  Router becomes active in congestion control.  Random Early Detection (Floyd and Jacobson, 1993).  RED has been deployed in some Cisco routers.

7 Random Early Detection (RED)  Random packet drops in queue.  Drop probability based on average queue:  Four parameters: q min q max P max w q (overparameterized)

8 Queue Behavior in RED

9 Queue Behavior in RED (2)  20 new flows every 20 seconds  Wq = 0.01  Wq = 0.001

10 How to overcome these problems…  Adaptive RED, REM, GREEN, BLUE,…  Problems: Over-parameterization Not easy to implement in routers Not much better performance than drop tail

11 REM vs. RED

12 Diffusion Mechanisms: Exploiting Image Processing  Our solution  Based on digital halftoning  Halftoning is a successful printing technique: from newspapers to laser printers

13 Digital Halftoning Original Image Ordered Dither Error Diffusion

14

15 Probability of Marking a Packet  Gentle RED function closely follows: (A)

16 Evolution of the Congestion Window  TCP in steady state: (B)

17 Traffic in the Network Congestion Window = Packets In The Pipe + Packets In The Queue Or: (C)  From (A), (B), (C), and knowing that : where

18 Probability Function

19 AQM Dynamics with nonlinearity

20 Error Diffusion  Packet marking is analogous to halftoning: Convert a continuous gray-scale image into black or white dots Packet marking reduces to quantization  Error diffusion: The error between input (continuous) and output (discrete) is incorporated in subsequent outputs.

21 Diffusion Mechanism ≥

22 Diffusion Mechanism ≥

23 Diffusion Mechanism ≥

24 Diffusion Mechanism ≥

25 Diffusion Mechanism ≥

26 Diffusion Mechanism ≥

27 Diffusion Mechanism ≥

28 Diffusion Mechanism ≥

29 Diffusion Mechanism ≥

30 Diffusion Mechanism ≥

31 Diffusion Mechanism ≥

32 Diffusion Mechanism ≥

33 AQM Dynamics with nonlinearity (2)

34 Algorithm Summary Diffusion Early Marking decides whether to mark a packet or not as: Where: M=2, b 1 =2/3, b 2 =1/3 Remember:

35 Optimizing the Control Mechanism  Adaptive Threshold Control  Dynamic Detection of Active Flows

36 Adaptive Threshold Control  Dynamic changes to the threshold improve the quality of the output.

37 Effects of Threshold Modulation in the Control Mechanism

38 Dynamic Detection of Active Flows  DEM requires the number of active flows  Effect of not-timed out flows and flows in timeout during less than RTT:

39 Dynamic Detection of Active Flows (2)  The number of packets:  The number of active flows:

40 Active Flows Estimate

41 Diffusion Mechanisms for Active Queue Management RESULTS

42 Window Size RED Diffusion Based Larger congestion window  more data!

43 Stability of the Queue  100 long lived connections (TCP/Reno, FTP)  Desired queue size = 30 packets RED Diffusion Based

44 Changing the number of flows  20 new flows every 20 seconds RED Diffusion Based

45 Long lived flows

46 Long lived flows (2)

47 Long lived flows (3)

48 Http flows - model  PackMime traffic model  Internet Traffic Research group at Bell Labs  Traffic controlled by the rate parameter (the average number of new connections started each second)

49 Http flows

50 Http flows (2)

51 Http flows (3)

52 Conclusions  Digital halftoning is a mature technique that can be used in AQM.  Advantages: Increased stability Simpler (only one parameter) Increased throughput  Current Work: Parameter optimization Complete benchmarking Additional traffic control applications

Thank you! Department of Electrical and Computer Engineering University of Delaware Aug 19th / 2004 Rafael Nunez Gonzalo Arce