April 10, 2006, Northwestern University

Slides:

Advertisements

Similar presentations

Advertisements

CS 4700 / CS 5700 Network Fundamentals

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

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

Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.

PCP a Savior or a Saboteur? Presented by: Ao-Jan Su.

CS 268: Lecture 7 (Beyond TCP Congestion Control) Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences University.

CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.

CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.

Router-assisted congestion control Lecture 8 CS 653, Fall 2010.

Network Border Patrol Celio Albuquerque, Brett J. Vickers and Tatsuya Suda Jaideep Vaidya CS590F Fall 2000.

CS268: Beyond TCP Congestion Control Ion Stoica February 9, 2004.

On Impact of Non-Conformant Flows on a Network of Drop-Tail Gateways Kartikeya Chandrayana Shivkumar Kalyanaraman ECSE Dept., R.P.I. (

Advanced Computer Networking Congestion Control for High Bandwidth-Delay Product Environments (XCP Algorithm) 1.

Ion Stoica, Scott Shenker, and Hui Zhang SIGCOMM’98, Vancouver, August 1998 subsequently IEEE/ACM Transactions on Networking 11(1), 2003, pp Presented.

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.

1 Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Core-Stateless Fair Queueing:

The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP

Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley and Charlie Rohrs SIGCOMM2002 Pittsburgh Presenter – Bob Kinicki.

Congestion Dr. Abdulaziz Almulhem. Almulhem©20012 Congestion It occurs when network resources are becoming scarce High demand Over utilized Offered load.

Networks: Congestion Control1 Congestion Control.

A Poisoning-Resilient TCP Stack Amit Mondal Aleksandar Kuzmanovic Northwestern University

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

Comparison between TCPWestwood and eXplicit Control Protocol (XCP) Jinsong Yang Shiva Navab CS218 Project - Fall 2003.

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

The War Between Mice and Elephants By Liang Guo (Graduate Student) Ibrahim Matta (Professor) Boston University ICNP’2001 Presented By Preeti Phadnis.

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

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

Congestion Control for High Bandwidth-Delay Product Environments Dina Katabi Mark Handley Charlie Rohrs.

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

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.

Transport Layer 4 2: Transport Layer 4.

Link Scheduling & Queuing COS 461: Computer Networks

Advance Computer Networking L-6 TCP & Routers Acknowledgments: Lecture slides are from the graduate level Computer Networks course thought by Srinivasan.

Congestion Control - Supplementary Slides are adapted on Jean Walrand’s Slides.

MaxNet NetLab Presentation Hailey Lam Outline MaxNet as an alternative to TCP Linux implementation of MaxNet Demonstration of fairness, quick.

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

Congestion Control for High Bandwidth-Delay Product Networks D. Katabi (MIT), M. Handley (UCL), C. Rohrs (MIT) – SIGCOMM’02 Presented by Cheng.

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

Un-Cooperative Congestion Control Kartikeya Chandrayana Prof. Shivkumar Kalyanaraman ECSE Dept., R.P.I. (

Analysis of Buffer Size in Core Routers by Arthur Dick Supervisor Anirban Mahanti.

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

PCP: Efficient Endpoint Congestion Control NSDI, 2006 Thomas Anderson, Andrew Collins, Arvind Krishnamurthy and John Zahorjan University of Washington.

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.

1 Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Core-Stateless Fair Queueing:

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

XCP: eXplicit Control Protocol Dina Katabi MIT Lab for Computer Science

Thoughts on the Evolution of TCP in the Internet Sally Floyd PFLDnet 2004 February 16, 2004.

Congestion Avoidance Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.

Masaki Hirabaru (NICT) and Jin Tanaka (KDDI) Impact of Bottleneck Queue on Long Distant TCP Transfer August 25, 2005 NOC-Network Engineering Session Advanced.

Congestion Control for High Bandwidth-Delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Yufei Chen.

Other Methods of Dealing with Congestion

Corelite Architecture: Achieving Rated Weight Fairness

On Queuing, Marking, and Dropping

TCP Vegas Congestion Control Algorithm

Congestion Control for High Bandwidth-Delay Product Networks

CS 268: Lecture 6 Scott Shenker and Ion Stoica

Router-Assisted Congestion Control

Congestion Control and Resource Allocation

TCP Congestion Control

Core-Stateless Fair Queueing: A Scalable Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks Ion Stoica, Scott Shenker, and Hui.

Columbia University in the city of New York

HighSpeed TCP for Large Congestion Windows

Other Methods of Dealing with Congestion

Other Methods of Dealing with Congestion

Max Min Fairness How define fairness?

COMP/ELEC 429/556 Fall 2017 Homework #2

Congestion Control Reasons:

Congestion Control and Resource Allocation

Presentation transcript:

April 10, 2006, Northwestern University eXCP ExCP Offense by Amit April 10, 2006, Northwestern University

Congestion Control Design Space End Point Router Support Try and Backoff TCP, Vegas, RAP, Fast TCP, S-TCP High Speed TCP DecBit, ECN, RED, AQM Request and Set PCP ATM, XCP, WFQ, RCP

Deployment Not end-to-end solution Modification required in routers Anderson et. al. PCP:Efficient Endpoint Congestion control Incremental deployment is infeasible All routers must be XCP enabled What if bottleneck router is not XCP enabled? Loss due to congestion but XCP assumes otherwise

Performance Comparison with TCP-Reno instead of TCP-SACK, TCP-Vegas Only Simulation based evaluation Limitation of sender buffer/receiver window How useful is for short web-traffic? Congestion avoidance vs slow-start

Security Sender Centric vs Receiver Centric Fake H_rtt Fake H_cwnd (H_throughput) Discard H_feedback Compromised/Misbehaving Router Can completely shut-off good flows

Contribution Stoica's CSFQ: Core Stateless Fair Queuing (SIGCOMM '98) Edge routers – per flow management, rate estimation (r) Core routers – fair allocation of bandwidth among flows (f) Each packet of a flow with arrival rate r is forwarded with probability p = min(1, f/r) Core routers estimate fair allocation of b/w using iterative algorithm XCP – modification of CSFQ, worse from the perspective that it cannot detect misbehaving hots nor can do policy enforcement