The effect of router buffer size on the TCP performance K.E. Avrachenkov*, U.Ayesta**, E.Altman, P.Nain,C.Barakat* *INRIA - Sophia Antipolis, France.

Slides:

Advertisements

Similar presentations

Interconnection Networks: Flow Control and Microarchitecture.

Advertisements

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.

Computer Networks Performance Metrics Computer Networks Term B10.

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

Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.

Playback-buffer Equalization for Streaming Media using Stateless Transport Prioritization Dan Tan, HPL, Palo Alto Weidong Cui, UC Berkeley John Apostolopoulos,

Ahmed El-Hassany CISC856: CISC 856 TCP/IP and Upper Layer Protocols Slides adopted from: Injong Rhee, Lisong Xu.

Copyright © 2005 Department of Computer Science 1 Solving the TCP-incast Problem with Application-Level Scheduling Maxim Podlesny, University of Waterloo.

Simulating Large Networks using Fluid Flow Model Yong Liu Joint work with Francesco LoPresti, Vishal Misra Don Towsley, Yu Gu.

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.

1 Multi-layer Active Queue Management and Congestion Control for Scalable Video Streaming Kang, S.-R.; Zhang, Y.; Dai, M.; Loguinov, D.; Distributed Computing.

Receiver-driven Layered Multicast S. McCanne, V. Jacobsen and M. Vetterli SIGCOMM 1996.

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

Networks: Sample Performance Problems 1 Sample Network Performance Problems.

Computer Networks Computer Networks Term B10 Network Delay Network Delay Performance Problems.

“On Designing Improved Controllers for AQM Routers Supporting TCP Flows” The PI Controller Presented by Bob Kinicki.

Modeling of Web/TCP Transfer Latency Yujian Peter Li January 22, 2004 M. Sc. Committee: Dr. Carey Williamson Dr. Wayne Eberly Dr. Elena Braverman Department.

Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.

Computer Science ROMA: Reliable Overlay Multicast with Loosely Coupled TCP Connections Gu-In Kwon and John Byers Computer Science Dept. Boston University.

Designing Networks with Little or No Buffers or Can Gulliver Survive in Lilliput? Yashar Ganjali High Performance Networking Group Stanford University.

Reduced TCP Window Size for Legacy LAN QoS II Niko Färber Sept. 20, 2000.

1 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, TCP Increase/Decrease.

Measuring Queuing and System Delay Using Click Modular Router By Caroline Williams.

UCB Implementing QoS Jean Walrand EECS. UCB Outline What? Bandwidth, Delay Where? End-to-End, Edge-to-Edge, Edge-to-End, Overlay Mechanisms Access Control.

1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,

ACN: AVQ1 Analysis and Design of an Adaptive Virtual Queue (AVQ) Algorithm for Active Queue Managment Srisankar Kunniyur and R. Srikant SIGCOMM’01 San.

And now … Graphs simulation input file parameters 10,000 requests 4 categories of file sizes 1K- 80% frequency 4K – 15% 16K – 4% 64K –1% poisson arrival.

Networks:Sample Performance Problems 1 Sample Network Performance Problems.

Networks: Performance Measures1 Network Performance Measures.

Networks: Sample Performance Problems 1 Sample Network Performance Problems.

Setting TCP Window Size for Legacy LAN VoIP Niko Färber January 10, 2001.

Module 2.0: Modeling of Network Components. Queueing theory  Basics : average number of packets 1/  : mean service time per packet [s] arriving per.

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.

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,

Advanced Computer Networks 1 Sample Network Performance Problems.

Discriminating Congestion Losses from Wireless Losses using Inter- Arrival Times at the Receiver By Saad Biaz,Nitin H.Vaidya Texas A&M University IEEE.

1 Performance Evaluation of Ring- based Peer-to-Peer Virtual Private Network (RING-P2P-VPN) Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.

Open Issues in Buffer Sizing Amogh Dhamdhere Constantine Dovrolis College of Computing Georgia Tech.

Advanced Network Architecture Research Group 2001/11/149 th International Conference on Network Protocols Scalable Socket Buffer Tuning for High-Performance.

TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.

Congestion models for bursty TCP traffic Damon Wischik + Mark Handley University College London DARPA grant W911NF

TFRC: TCP Friendly Rate Control using TCP Equation Based Congestion Model CS 218 W 2003 Oct 29, 2003.

Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.

Fluid-based Analysis of a Network of AQM Routers Supporting TCP Flows with an Application to RED Vishal Misra Wei-Bo Gong Don Towsley University of Massachusetts,

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

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

Advanced Network Architecture Research Group 2001/11/74 th Asia-Pacific Symposium on Information and Telecommunication Technologies Design and Implementation.

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

1 Aggregate Traffic Performance with Active Queue Management and Drop from Tail Christophe Diot, Gianluca Iannaccone, Martin May Sprint ATL, Università.

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

1 On Scalable Edge-based Flow Control Mechanism for VPN Tunnels --- Part 2: Scalability and Implementation Issues Hiroyuki Ohsaki Graduate School of Information.

1 On Dynamic Parallelism Adjustment Mechanism for Data Transfer Protocol GridFTP Takeshi Itou, Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.

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.

1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)

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

1 Transport Control Protocol for Wireless Connections ElAarag and Bassiouni Vehicle Technology Conference 1999.

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.

Data Transport Challenges for e-VLBI Julianne S.O. Sansa* * With Arpad Szomoru, Thijs van der Hulst & Mike Garret.

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.

Tango1 Considering End-to-End QoS Constraints in IP Network Design and Planning M.Ajmone Marsan, M. Garetto, E. Leonardi. M. Mellia, E. Wille Dipartimento.

@Yuan Xue A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their.

A special acknowledge goes to J.F Kurose and K.W. Ross Some of the slides used in this lecture are adapted from their original slides that accompany the.

1 Stochastic Ordering for Internet Congestion Control Han Cai, Do Young Eun, Sangtae Ha, Injong Rhee, and Lisong Xu PFLDnet 2007 February 7, 2007.

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

Open Issues in Router Buffer Sizing

Amogh Dhamdhere, Hao Jiang and Constantinos Dovrolis

Max Min Fairness How define fairness?

Presentation transcript:

The effect of router buffer size on the TCP performance K.E. Avrachenkov*, U.Ayesta**, E.Altman*, P.Nain*,C.Barakat* *INRIA - Sophia Antipolis, France ** FT R&D - Sophia Antipolis, France TELECOMMUNICATION NETWORKS AND TELETRAFFIC THEORY Thursday, January 31, 2002 Saint Petersburg, Russia

2 + Is there an optimal value for the buffer size in IP routers? Outline +Persistent TCP connections: Average sending rate and goodput. + Short TCP connections: Latency TCP IP packet loss prob sending rate delay propagation +Fixed Point Approach.

3 Simulated Scenario + Persistent Connections: 100 connections. 100Mbps, 2ms 10Mbps, 1ms 10Mbps, 11ms +Short Transfers: New sessions arrive according to a Poisson distribution.

4 Persistent TCP Connections: Fixed Point (I) For the formula for see for example: J.Padhye, V.Firoiu,D. Towsley, and J. Kurose, « Modeling TCP Throughput: a Simple Model and its Empirical Validation », in Proceedings of ACM SIGCOMM ’1998 conference. Prop Delay Mean queueing delay

5 Persistent TCP Connections: Fixed Point (II) Solved iteratively Substituting we get the values for p,RTT i and T i.

6 Persistent TCP connections: Result (I) Buffer size (packets) Rate (bps)

7 Persistent TCP connections: Result (II) Buffer size (packets) Rate (bps)

8 Short TCP Transfers: Fixed Point (I) Solved iteratively

9 Short TCP Transfers: Fixed Point (II) *) B. Sikdar et. al. An integrated model for the latency and steady-state throughput of TCP connections. Perf.Eval. 01 Substituting we get the values for RTTi and Latency.

10 Short TCP Transfers: Result Buffer size (packets) Latency (bps)

11 Conclusions + Persistent TCP connections has poor sending rate and goodput in the cases of small and large buffer sizes. Consequently there is an optimal value of the buffer size. +Short TCP transfers. There seems not to be an optimal value for the IP router buffer size. The larger the buffer size, the better. + Fairness improves with increasing buffer size. Connections with large propagation delays get more bandwith and those with short propagation delays less.

12 Future work + More sophisticated network topologies with several bottleneck links. +Formula of Sikdar et al. Does not work well in the case of large number of packet losses.

13 Formula for the Sending rate