SANS 2001John Kristoff - DePaul University1 Avoiding Network Capacity Collapse John Kristoff +1 312 362-5878 DePaul University Chicago,

Slides:



Advertisements
Similar presentations
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advertisements

CSIT560 Internet Infrastructure: Switches and Routers Active Queue Management Presented By: Gary Po, Henry Hui and Kenny Chong.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
IS333, Ch. 26: TCP Victor Norman Calvin College 1.
24.1 Chapter 24 Congestion Control and Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
CS 4700 / CS 5700 Network Fundamentals Lecture 13: Middleboxes and NAT (Duct tape for IPv4) Revised 3/9/2013.
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
CS 408 Computer Networks Congestion Control (from Chapter 05)
Leon-Garcia & Widjaja: Communication Networks Copyright ©2000 The McGraw Hill Companies A Little More on Chapter 7 And Start Chapter 8 TCP/IP.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
Explicit Congestion Notification (ECN) RFC 3168 Justin Yackoski DEGAS Networking Group CISC856 – TCP/IP Thanks to Namratha Hundigopal.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.
TDC365 Spring 2001John Kristoff - DePaul University1 Internetworking Technologies Transmission Control Protocol (TCP)
Networks: Congestion Control1 Congestion Control.
Criticisms of I3 Jack Lange. General Issues ► Design ► Performance ► Practicality.
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168) Limited Transmit (RFC 3042)
Security Forum 2001John Kristoff - DePaul University1 Network Firewalls John Kristoff DePaul University Chicago, IL
ISOC-Chicago 2001John Kristoff - DePaul University1 Journey to the Center of the Internet John Kristoff DePaul University.
Directors Meeting John Kristoff - DePaul University 1 Internet Traffic Report 2002 John Kristoff DePaul University Chicago,
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168)
ACN: Congestion Control1 Congestion Control and Resource Allocation.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #8 Explicit Congestion Notification (RFC 3168) Limited Transmit.
Autumn 2000John Kristoff1 Congestion Control Computer Networks.
Day15 IP Space/Setup. IP Suite of protocols –TCP –UDP –ICMP –GRE… Gives us many benefits –Routing of packets over internet –Fragmentation/Reassembly of.
Data Transfer Case Study: TCP  Go-back N ARQ  32-bit sequence # indicates byte number in stream  transfers a byte stream, not fixed size user blocks.
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Oppenheimer.
Link Scheduling & Queuing COS 461: Computer Networks
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
Congestion Control - Supplementary Slides are adapted on Jean Walrand’s Slides.
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
1 Congestion Control Computer Networks. 2 Where are we?
Copyright 2008 Kenneth M. Chipps Ph.D. Controlling Flow Last Update
Denial of Service DoS attacks try to deny legimate users access to services, networks, systems or to other resources. There are DoS tools available, thus.
CS 447 Network & Data Communication QoS Implementation for the Internet IntServ and DiffServ Department of Computer Science Southern Illinois University.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
Lecture Network layer -- May Congestion control Algorithms.
Explicit Allocation of Best-Effort Service Goal: Allocate different rates to different users during congestion Can charge different prices to different.
Data Transfer Case Study: TCP  Go-back N ARQ  32-bit sequence # indicates byte number in stream  transfers a byte stream, not fixed size user blocks.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
Networking (Cont’d). Congestion Control l Is achieved by informing nodes along a route that congestion has occurred and asking them to reduce their packet.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Cisco I Introduction to Networks Semester 1 Chapter 6 JEOPADY.
Implementing Cisco IP Routing (ROUTE v2.0)
Other Methods of Dealing with Congestion
The Transport Layer Implementation Services Functions Protocols
Internet Networking recitation #9
Topics discussed in this section:
Top-Down Network Design Chapter Thirteen Optimizing Your Network Design Copyright 2010 Cisco Press & Priscilla Oppenheimer.
Chapter 6 Congestion Avoidance
Queue Management Jennifer Rexford COS 461: Computer Networks
TCP Transport layer Er. Vikram Dhiman LPU.
Cisco Real Exam Dumps IT-Dumps
EE 122: Router Support for Congestion Control: RED and Fair Queueing
Analysis of Congestion Control Mechanisms in Congestion Control
So far, On the networking side, we looked at mechanisms to links hosts using direct linked networks and then forming a network of these networks. We introduced.
Other Methods of Dealing with Congestion
Other Methods of Dealing with Congestion
Congestion Control (from Chapter 05)
Internet Networking recitation #10
Congestion Control, Quality of Service, & Internetworking
Figure Areas in an autonomous system
The problem with fragments in 6lo mesh networks
Chapter 11. Frame Relay Background Frame Relay Protocol Architecture
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Presentation transcript:

SANS 2001John Kristoff - DePaul University1 Avoiding Network Capacity Collapse John Kristoff DePaul University Chicago, IL 60604

SANS 2001John Kristoff - DePaul University2 Capacity Collapse • Scarcity of capacity • (Dropped Traffic / Offered Traffic) increases • Goodput decreases (approaches zero) • Response time increases • Very little or no real work gets done

SANS 2001John Kristoff - DePaul University3 Statistical Multiplexing • A primary advantage of data networks • Available capacity can be used by anyone • Share capacity on first in, first out basis • Build network based on average usage • But IP is arbitarily bursty • Hence, will probably have some congestion • How do you prevent capacity collapse?

SANS 2001John Kristoff - DePaul University4 IP Type of Service Field "The Type of Service provides an indication of the abstract parameters of the quality of service desired." - RFC 791, September 1981 Twenty years later and still no Internet QoS!

SANS 2001John Kristoff - DePaul University5 TCP Congestion Avoidance • TCP cannot control congestion • It can react based on implicit network signals • Assumes packet loss is due to congestion • TCP is quite good - maybe too good • Tries to fully utilize network - it can go very fast • Want TCP to go slow? Drop packets! • Dropping packets reduces goodput

SANS 2001John Kristoff - DePaul University6 ICMP, UDP and Multicast • Some protocols unresponsive to congestion • Luckily TCP accounts for ~90% of the traffic • Congestion control is needed • A function of the network • How do we do it? is the question • RED and ECN • Scheduling and rate limiting • Price incentives

SANS 2001John Kristoff - DePaul University7 What about IPv6, ATM, MPLS... • Are these ubiquituous in your network? • Thought so. • Probably wouldn't be a panacea anyway • Next slide please...

SANS 2001John Kristoff - DePaul University8 (D)DoS Attacks are Related • But we won't talk specifically about them • Congestion control ideas may help us • With some added features • Probably only a temporary capacity collapse • Include this in capacity management plan

SANS 2001John Kristoff - DePaul University9 Let's Get More Capacity • LAN capacity is cheap, we can overprovision • Leased WAN links can be costly • Internet service can definitely be costly • Operational versus capital costs • Ugh... provisioning problems and lead times • Need simple, cheap and fast • We only get to pick one, maybe two if lucky

SANS 2001John Kristoff - DePaul University10 Access Blocking • DNS black holing • IP router filters • Null routes • Site blocking

SANS 2001John Kristoff - DePaul University11 Rate Limiting • IP, UDP and TCP based - usually • IP addresses • Protocol ports • Strict limits • Dynamic limits

SANS 2001John Kristoff - DePaul University12 UIUC Rate Limiting Experiment • Allow full capacity access by default • "Out-of-profile" users are rate limited • Increasingly aggressive limits if necessary • Analyzing cflowd data to determine usage • Dynamically upload CAR configs once/hour • Scaling issues - a tad scary

SANS 2001John Kristoff - DePaul University13 Active Queue Management • One way to control congestion in the network • Tail drop (FIFO queueing) • Random Early Detection (RED) • Explicit Congestion Notification (ECN) • Probably coupled with RED • Ongoing experimentation and research • Implementations available

SANS 2001John Kristoff - DePaul University14 Tail Drop Illustrated

SANS 2001John Kristoff - DePaul University15 RED Illustrated

SANS 2001John Kristoff - DePaul University16 Scheduling • Alter transmission order of packets • Can be based on: • IP Addresses • Priority (e.g. ToS bits) • Protocols (e.g. SSH) • Flow characteristics • Must define capacity/weight for queues

SANS 2001John Kristoff - DePaul University17 Traffic Shaping • TCP rate control • Alter TCP receiver window on the fly • ACK pacing • Slow or spread out ACKs to control sender • Packeteer (middlebox) does this • Yes, it can be a little scary • Can be implemented in end host stacks

SANS 2001John Kristoff - DePaul University18 Caching • Transparent • It is there, but users don't know it • Voluntary • It is there, but users must know to use it • Probably only buys a short amount of time

SANS 2001John Kristoff - DePaul University19 Private Peering • There is such a thing as a free lunch! • Well, OK not really • Involves some routing complexity • Startup cost might be high • You may have a choice of transit provider • If you can get to an exchange, do so!

SANS 2001John Kristoff - DePaul University20 Private Peering Illustrated

SANS 2001John Kristoff - DePaul University21 Monitoring • Some tools: • MRTG, RRDTool, cflowd • Some things to watch: • Queue depth • Packet drops • Link utilization • Buffer utilization • Latency versus throughput

SANS 2001John Kristoff - DePaul University22 Consortia • Some nice things in your own back yard? • Might be free, low cost or subsidized • May at least be lots of capacity • Might also be worth what you pay • Examples: • Internet2 • Illinois Century Network • STAR TAP

SANS 2001John Kristoff - DePaul University23 Proxy Servers • Lots of opportunity for control • Can do lots of the capacity solutions at once • Not sure that you want them to • Lots of middlebox issues

SANS 2001John Kristoff - DePaul University24 Content Distribution • Content providers move data closer to you • Maybe setup up your own Red Hat mirror • Akamai is well known in this space • A form of load balancing

SANS 2001John Kristoff - DePaul University25 Content Subscription • Obtain local copies of data for distribution • Sort of like a library service • You do not own the content • May help alleviate copyright issues • iBEAM is popular in this space

SANS 2001John Kristoff - DePaul University26 Network Address Translation (NAT) • Intended as solution to IP address shortage • Has a number of well documented problems • Probably not your capacity solution • Probably wouldn't help much anyway • In fact, it would probably hurt you more • Not recommended if you have addresses • Bad Juju

SANS 2001John Kristoff - DePaul University27 What Would I Do? (Bias Slide) • Oversubscription before CoS/QoS • Preserve End-to-end model • Get to an exchange and peer • Get into a consortium like Internet2 • Do lots of monitoring (understand traffic) • Be wary of silicon snake oil • Be willing to research and test anything

SANS 2001John Kristoff - DePaul University28 References