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

Slides:



Advertisements
Similar presentations
1 TCP Vegas: New Techniques for Congestion Detection and Avoidance Lawrence S. Brakmo Sean W. O’Malley Larry L. Peterson Department of Computer Science.
Advertisements

Different TCP Flavors CSCI 780, Fall TCP Congestion Control Slow-start Congestion Avoidance Congestion Recovery Tahoe, Reno, New-Reno SACK.
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.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
TCP Congestion Control Dina Katabi & Sam Madden nms.csail.mit.edu/~dina 6.033, Spring 2014.
Congestion Control: TCP & DC-TCP Swarun Kumar With Slides From: Prof. Katabi, Alizadeh et al.
Router Buffer Sizing and Reliability Challenges in Multicast Aditya Akella 02/28.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
Sizing Router Buffers Guido Appenzeller Isaac Keslassy Nick McKeown Stanford University.
Transport Layer 3-1 outline r TCP m segment structure m reliable data transfer m flow control m congestion control.
Transport Layer 3-1 Fast Retransmit r time-out period often relatively long: m long delay before resending lost packet r detect lost segments via duplicate.
Transport Layer 3-1 Outline r TCP m Congestion control m Flow control.
1 Lecture 10: TCP Performance Slides adapted from: Congestion slides for Computer Networks: A Systems Approach (Peterson and Davis) Chapter 3 slides for.
Buffer Sizing for Congested Internet Links Chi Yin Cheung Cs 395 Advanced Networking.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #7 TCP New Reno Vs. Reno.
1 Internet Networking Spring 2002 Tutorial 10 TCP NewReno.
1 Lecture 9: TCP and Congestion Control Slides adapted from: Congestion slides for Computer Networks: A Systems Approach (Peterson and Davis) Chapter 3.
Sizing Router Buffers (Summary)
Sizing Router Buffers Nick McKeown Guido Appenzeller & Isaac Keslassy SNRC Review May 27 th, 2004.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
The Effect of Router Buffer Size on HighSpeed TCP Performance Dhiman Barman Joint work with Georgios Smaragdakis and Ibrahim Matta.
Reducing the Buffer Size in Backbone Routers Yashar Ganjali High Performance Networking Group Stanford University February 23, 2005
Internet and Intranet Protocols and Applications Section V: Network Application Performance Lecture 11: Why the World Wide Wait? 4/11/2000 Arthur P. Goldberg.
Efficient Internet Traffic Delivery over Wireless Networks Sandhya Sumathy.
Isaac Keslassy (Technion) Guido Appenzeller & Nick McKeown (Stanford)
1 Internet Networking Spring 2004 Tutorial 10 TCP NewReno.
TCP in Heterogeneous Network Md. Ehtesamul Haque # P.
CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 E2E Protocols (point-to-point)
TCP. Learning objectives Reliable Transport in TCP TCP flow and Congestion Control.
TCP Congestion Control
Routers with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University
Adaptive Control for TCP Flow Control Thesis Presentation Amir Maor.
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
Transport Layer 4 2: Transport Layer 4.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
CS144 An Introduction to Computer Networks
Modeling TCP Throughput: A Simple Model and its Empirical Validation Ross Rosemark Penn State University.
Congestion models for bursty TCP traffic Damon Wischik + Mark Handley University College London DARPA grant W911NF
TCP Throughput Collapse in Cluster-based Storage Systems
Raj Jain The Ohio State University R1: Performance Analysis of TCP Enhancements for WWW Traffic using UBR+ with Limited Buffers over Satellite.
Much better than the old TCP Flavours 1Rajon Bhuiyan.
1 MaxNet and TCP Reno/RED on mice traffic Khoa Truong Phan Ho Chi Minh city University of Technology (HCMUT)
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Link Scheduling & Queuing COS 461: Computer Networks
27th, Nov 2001 GLOBECOM /16 Analysis of Dynamic Behaviors of Many TCP Connections Sharing Tail-Drop / RED Routers Go Hasegawa Osaka University, Japan.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Transport Layer3-1 TCP throughput r What’s the average throughout of TCP as a function of window size and RTT? m Ignore slow start r Let W be the window.
Lecture 9 – More TCP & Congestion Control
1 Transport Layer Lecture 10 Imran Ahmed University of Management & Technology.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
1 Analysis of a window-based flow control mechanism based on TCP Vegas in heterogeneous network environment Hiroyuki Ohsaki Cybermedia Center, Osaka University,
TCP transfers over high latency/bandwidth networks & Grid DT Measurements session PFLDnet February 3- 4, 2003 CERN, Geneva, Switzerland Sylvain Ravot
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
CUBIC Marcos Vieira.
COMP 431 Internet Services & Protocols
Transport Protocols over Circuits/VCs
Open Issues in Router Buffer Sizing
Lecture 19 – TCP Performance
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.
IT351: Mobile & Wireless Computing
CS640: Introduction to Computer Networks
Project-2 (20%) – DiffServ and TCP Congestion Control
Review of Internet Protocols Transport Layer
Presentation transcript:

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

Overview ● Problem Description ● Background Information – TCP Reno vs. NewReno – The Rule-of-Thumb – Synchronization ● Experiment Methodology ● Results

Problem Description ● Internet routers buffer packets during times of congestion ● Buffers cause queuing delay ● The fast memory required in core routers is expensive ● Recent studies suggest routers in use today contain buffers larger than necessary 1

Background Information TCP Reno vs. NewReno ● TCP is the protocol in use for many applications such as the web, FTP, and ● There are a number of variants on the TCP protocol ● The studies cited considered only the Reno variant, whereas NewReno is better at recovering from multiple losses 2

Background Information TCP Reno vs. NewReno (2) ● TCP is designed to allow multiple connections to share a congested links bandwidth ● Phases – Slow Start – Congestion Avoidance – Fast Retransmit / Fast Recovery 3

Background Information The Rule-of-Thumb ● B = RTT * C ● Ensures a congested link does not go idle given a single TCP Reno flow ● Core routers today commonly carry in excess of TCP flows 4

Background Information Synchronization ● If the buffer size is large: – All flows tend to lose packets at the same time – So all flows will reduce their sending rate at the same time ● Therefore the sum of all the flows tends to act as a single amplified flow 5 Example: 30 flows through a router with a buffer size of 562 packets

Background Information Synchronization (2) ● If the buffer size is small: – Flows do not all lose packets at the same time – There is no need to buffer packets to keep the link busy as there is no common sending rate reduction ● The queue length will fluctuate rapidly 6 Example: 30 flows through a router with a buffer size of 51 packets

Experiment Methodology ● Simulation tool: ns-2 ● Single congested link ● 45Mb/s data rate on the link ● Constant RTT of 0.1s ● Varied number of flows from 30 to Senders Receivers 45Mb/s Router

Experiment Methodology (2) ● The paper “Sizing Router Buffers” suggests a buffer size B=RTT*C/sqrt(n) ● Our buffer size was determined as multiples of the above rule (½x, 1x, 2x, 3x) ● The resulting utilization was measured for both Reno and NewReno flows 8

The Results ● The rule B=RTT*C/sqrt(n) resulted in high utilization of the congested link ● Additional buffer reductions are possible assuming TCP NewReno flows 9

Thank You Questions?