Controlling High- Bandwidth Flows at the Congested Router Ratul Mahajan, Sally Floyd, David Wetherall AT&T Center for Internet Research at ICSI (ACIRI)

Slides:

Advertisements

Similar presentations

Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.

Advertisements

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

1 Specifying New Congestion Control Algorithms Sally Floyd and Mark Allman draft-floyd-cc-alt-00.txt November 2006 TSVWG Slides:

Florin Dinu T. S. Eugene Ng Rice University Inferring a Network Congestion Map with Traffic Overhead 0 zero.

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

Sungwon Yi, Xidong Deng, George Kesidis, and Chita R. Das Department of Computer Science and Engineering, The Pennsylvania State University Abstract Introduction.

Transport Layer3-1 TCP AIMD multiplicative decrease: cut CongWin in half after loss event additive increase: increase CongWin by 1 MSS every RTT in the.

Bayesian Piggyback Control for Improving Real-Time Communication Quality Wei-Cheng Xiao 1 and Kuan-Ta Chen Institute of Information Science, Academia Sinica.

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.

The War Between Mice and Elephants LIANG GUO, IBRAHIM MATTA Computer Science Department Boston University ICNP (International Conference on Network Protocols)

TFRC for Voice: the VoIP Variant Sally Floyd, Eddie Kohler. March 2005, presentation to AVT draft-ietf-dccp-tfrc-voip-01.txt.

On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory　 Hisamatu Hiroyuki Department of Infomatics.

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

One More Bit Is Enough Yong Xia, RPI Lakshminarayanan Subramanian, UCB Ion Stoica, UCB Shivkumar Kalyanaraman, RPI SIGCOMM’05, August 22-26, 2005, Philadelphia,

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.

Improving RPR Fairness Convergence Speaker: Chun-Hung Chen Author: Chuan-Gang Liu, Jung-Shian Li The 2004 IEEE Asia Pacific Conference on Circuits and.

Jinho Promoting the Use of End-To-End Congestion Control in the Internet IEEE/ACM Transaction on Networking Vol.7 No.4 August 1999 Sally Floyd and Kevin.

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

High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.

WPI - Advanced Computer Network 1 Promoting the Use of End-to-End Congestion Control in the Internet IEEE/ACM Transactions on Networking, May Sally.

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

Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.

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

The Effect of Router Buffer Size on HighSpeed TCP Performance Dhiman Barman Joint work with Georgios Smaragdakis and Ibrahim Matta.

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

Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.

FTDCS 2003 Network Tomography based Unresponsive Flow Detection and Control Authors Ahsan Habib, Bharat Bhragava Presenter Mohamed.

Random Early Detection Gateways for Congestion Avoidance

Estimating Congestion in TCP Traffic Stephan Bohacek and Boris Rozovskii University of Southern California Objective: Develop stochastic model of TCP Necessary.

Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs.

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.

UCB Improvements in Core-Stateless Fair Queueing (CSFQ) Ling Huang U.C. Berkeley cml.me.berkeley.edu/~hlion.

Diffusion Early Marking Department of Electrical and Computer Engineering University of Delaware May / 2004 Rafael Nunez Gonzalo Arce.

Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Fair Queueing requires per flow state: too costly in high speed core routers Yet, some.

Receiver-driven Layered Multicast Paper by- Steven McCanne, Van Jacobson and Martin Vetterli – ACM SIGCOMM 1996 Presented By – Manoj Sivakumar.

Whither Congestion Control? Sally Floyd E2ERG, July

Kamal Singh, Árpád Huszák, David Ros, César Viho and Jeney Gábor

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

CS 447 Network & Data Communication QoS (Quality of Service) & DiffServ Introduction Department of Computer Science Southern Illinois University Edwardsville.

ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.

27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.

High-speed TCP  FAST TCP: motivation, architecture, algorithms, performance (by Cheng Jin, David X. Wei and Steven H. Low)  Modifying TCP's Congestion.

1 Modeling and Performance Evaluation of DRED (Dynamic Random Early Detection) using Fluid-Flow Approximation Hideyuki Yamamoto, Hiroyuki Ohsaki Graduate.

1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO

Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.

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

The Impact of Active Queue Management on Multimedia Congestion Control Wu-chi Feng Ohio State University.

Detecting the Long-Range Dependence in the Internet Traffic with Packet Trains Péter Hága, Gábor Vattay Department Of Physics of Complex Systems Eötvös.

Analysis of QoS Arjuna Mithra Sreenivasan. Objectives Explain the different queuing techniques. Describe factors affecting network voice quality. Analyse.

Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.

1 1 July 28, Goal of this session is too have a discussion where we learn about the relevant data to help us understand the problem and design.

Hybrid Modeling of TCP Congestion Control João P. Hespanha, Stephan Bohacek, Katia Obraczka, Junsoo Lee University of Southern California.

Improving our Evaluation of Transport Protocols Sally Floyd Hamilton Institute July 29, 2005.

Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE-ACAM Transactions on Networking, 馬儀蔓.

Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.

Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,

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.

Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.

Time-Dependent Dynamics in Networked Sensing and Control Justin R. Hartman Michael S. Branicky Vincenzo Liberatore.

Chapter 11.4 END-TO-END ISSUES. Optical Internet Optical technology Protocol translates availability of gigabit bandwidth in user-perceived QoS.

Internet research Needs Better Models Sally Floyd, Eddie Kohler ISCI Center for Internet Research, Berkeley, California Presented by Max Podlesny.

1 Sheer volume and dynamic nature of video stresses network resources PIE: A lightweight latency control to address the buffer problem issue Rong Pan,

Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.

Corelite Architecture: Achieving Rated Weight Fairness

Impact of New CC on Cross Traffic

Empirically Characterizing the Buffer Behaviour of Real Devices

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:

Presentation transcript:

Controlling High- Bandwidth Flows at the Congested Router Ratul Mahajan, Sally Floyd, David Wetherall AT&T Center for Internet Research at ICSI (ACIRI) and AT&T Labs Research Presented by Yan Gao

Oscillation Paper used below method to reduce oscillation  The reduction in the dropping probability is bounded by a max_decrease in one step; The oscillation can also be caused by reaction delay and imprecision of using a flow’s packet drop history as an estimate of its arrival rate.  Changes to the dropping probability are not make until a certain time period. How to set this certain time period? The paper did not explore the potential for oscillations in the average queue size, in particular for scenarios with large propagation delays and long-lived traffic.  In practical, the average queue size varies significantly.

Mechanism It can be only applied for non-burst packet drop behavior.  How about burst packet drop case? Detecting unresponsive flows is tricky in variable demand environments

Mechanism Since fast memory is not required for storing the drop history, does it affect the speed of online operation? This paper didn’t show the precise state requirements and fairness tradeoffs under various traffic scenarios. RED-PD’s test for unresponsiveness can have false positives and false negatives.  What are the results of their evaluation?

Parameter setting Changes in the network might expose the importance of different parameters.  The parameters have proved important in the past, so it should provide observations of their values on the Internet, and describe expected effects of other values. How could they set these parameters? Do they have some recommendation for different network? (such as K, M)

Evaluation The authors only did some very small level simulation by NS-2 (10Mbps), how about the behavior on large scale network (such as 10Gbps) ???  The paper did not investigate performance for a range of link bandwidths for the congested link. Whether the approach will reduce totally bandwidth waste is still unknown.  Bandwidth is wasted by delivering packets through the network that are dropped before reaching their ultimate destination;  There is no good way for responding to unresponsive flows.