Raj Jain The Ohio State University 1 98-0876R1: Performance Analysis of TCP Enhancements for WWW Traffic using UBR+ with Limited Buffers over Satellite.

Slides:



Advertisements
Similar presentations
Michele Pagano – A Survey on TCP Performance Evaluation and Modeling 1 Department of Information Engineering University of Pisa Network Telecomunication.
Advertisements

TCP Variants.
LOGO Transmission Control Protocol 12 (TCP) Data Flow.
The Effects of Wide-Area Conditions on WWW Server Performance Erich Nahum, Marcel Rosu, Srini Seshan, Jussara Almeida IBM T.J. Watson Research Center,
Simulation-based Comparison of Tahoe, Reno, and SACK TCP Kevin Fall & Sally Floyd Presented: Heather Heiman September 10, 2002.
1 TCP Vegas: New Techniques for Congestion Detection and Avoidance Lawrence S. Brakmo Sean W. O’Malley Larry L. Peterson Department of Computer Science.
TCP Vegas: New Techniques for Congestion Detection and Control.
Different TCP Flavors CSCI 780, Fall TCP Congestion Control Slow-start Congestion Avoidance Congestion Recovery Tahoe, Reno, New-Reno SACK.
1 End to End Bandwidth Estimation in TCP to improve Wireless Link Utilization S. Mascolo, A.Grieco, G.Pau, M.Gerla, C.Casetti Presented by Abhijit Pandey.
Presentation by Joe Szymanski For Upper Layer Protocols May 18, 2015.
1 TCP - Part II. 2 What is Flow/Congestion/Error Control ? Flow Control: Algorithms to prevent that the sender overruns the receiver with information.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
Vijay Vasudevan, Amar Phanishayee, Hiral Shah, Elie Krevat David Andersen, Greg Ganger, Garth Gibson, Brian Mueller* Carnegie Mellon University, *Panasas.
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
Transport Layer3-1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much.
1 Lecture 10: TCP Performance Slides adapted from: Congestion slides for Computer Networks: A Systems Approach (Peterson and Davis) Chapter 3 slides for.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 TCP Congestion Control: AIMD and Binomial Shivkumar Kalyanaraman Rensselaer Polytechnic Institute.
CS215 TCP Westwood Control Model Development and Stability Analysis Hu, Kunzhong Dong, Haibo Mentor: Wang, Ren Professor:
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 Minseok Kwon and Sonia Fahmy Department of Computer Sciences Purdue University {kwonm, TCP Increase/Decrease.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
MULTIMEDIA TRAFFIC MANAGEMENT ON TCP/IP OVER ATM-UBR By Dr. ISHTIAQ AHMED CH.
Data Communication and Networks
1 Internet Networking Spring 2004 Tutorial 10 TCP NewReno.
CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 E2E Protocols (point-to-point)
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
Copyright © 2005 Department of Computer Science CPSC 641 Winter Tutorial: TCP 101 The Transmission Control Protocol (TCP) is the protocol that sends.
All rights reserved © 2006, Alcatel Accelerating TCP Traffic on Broadband Access Networks  Ing-Jyh Tsang 
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
Lect3..ppt - 09/12/04 CIS 4100 Systems Performance and Evaluation Lecture 3 by Zornitza Genova Prodanoff.
1 EE 122: Advanced TCP Ion Stoica TAs: Junda Liu, DK Moon, David Zats (Materials with thanks to Vern Paxson,
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.
TCP Throughput Collapse in Cluster-based Storage Systems
COMT 4291 Communications Protocols and TCP/IP COMT 429.
Improving TCP Performance over Mobile Networks Zahra Imanimehr Rahele Salari.
Understanding the Performance of TCP Pacing Amit Aggarwal, Stefan Savage, Thomas Anderson Department of Computer Science and Engineering University of.
Principles of Congestion Control Congestion: informally: “too many sources sending too much data too fast for network to handle” different from flow control!
Transport over Wireless Networks Myungchul Kim
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.
Computer Networking TCP (cont.). Lecture 16: Overview TCP congestion control TCP modern loss recovery TCP interactions TCP options TCP.
HighSpeed TCP for High Bandwidth-Delay Product Networks Raj Kettimuthu.
Paper Review: Latency Evaluation of Networking Mechanisms for Game Traffic Jin, Da-Jhong.
1 TCP - Part II Relates to Lab 5. This is an extended module that covers TCP data transport, and flow control, congestion control, and error control in.
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.
Analysis of Buffer Size in Core Routers by Arthur Dick Supervisor Anirban Mahanti.
Lecture 9 – More TCP & Congestion Control
TCP Behavior Inference Tool Jitendra Padhye, Sally Floyd Presented by Songjie Wei.
1 CS 4396 Computer Networks Lab TCP – Part II. 2 Flow Control Congestion Control Retransmission Timeout TCP:
1 Sonia FahmyPurdue University TCP Congestion Control Sonia Fahmy Department of Computer Sciences Purdue University
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
1 TCP - Part II. 2 What is Flow/Congestion/Error Control ? Flow Control: Algorithms to prevent that the sender overruns the receiver with information.
1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
@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.
Performance of TCP over ATM How best to manage TCP’s segment size, window management and congestion control… …at the same time as ATM’s quality of service.
@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.
Karn’s Algorithm Do not use measured RTT to update SRTT and SDEV Calculate backoff RTO when a retransmission occurs Use backoff RTO for segments until.
COMP 431 Internet Services & Protocols
TCP Vegas: New Techniques for Congestion Detection and Avoidance
Transmission Control Protocol (TCP)
SCTP v/s TCP – A Comparison of Transport Protocols for Web Traffic
TCP Westwood(+) Protocol Implementation in ns-3
TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.
Computer Science Division
Evaluation of Objectivity/AMS on the Wide Area Network
Presentation transcript:

Raj Jain The Ohio State University R1: Performance Analysis of TCP Enhancements for WWW Traffic using UBR+ with Limited Buffers over Satellite Links Mukul Goyal, Rohit Goyal, Raj Jain, Bobby Vandalore, Sonia Fahmy The Ohio State University Tom vonDeak, Kul Bhasin Nasa Lewis Research Center Sastri Kota, Norm Butts Lockheed Martin Telecommunications

Raj Jain The Ohio State University 2 q Goals q TCP over UBR+ q Previous Work q WWW Model q Simulation and Analysis Overview

Raj Jain The Ohio State University 3 Goals q TCP Performance over UBR+ for satellite networks q TCP Mechanisms m Slow start and congestion avoidance m Fast retransmit and recovery (Reno) m New Reno m Selective Acknowledgements q UBR+ m EPD m Per-VC accounting q Satellite: WAN, MEO, GEO latencies.

Raj Jain The Ohio State University 4 TCP over UBR+ TCP End System Policies ATM Switch Drop Policies Early Packet Discard Per-VC Accounting : Selective Drop/FBA Minimum Rate Guarantees : per-VC queuing Tail Drop Vanilla TCP : Slow Start and Congestion Avoidance TCP Reno: Fast Retransmit and Recovery Selective Acknowledgments TCP over UBR+

Raj Jain The Ohio State University 5 TCP Mechanisms q Vanilla TCP m Slow start and congestion avoidance q TCP Reno m Fast retransmit and recovery (FRR) q TCP New Reno m Fast recovery phase q TCP SACK m Fast recovery phase m Selective acknowledgements

Raj Jain The Ohio State University 6 TCP NewReno q Receive 3 dupacks: enter fast recovery phase q All lost packets acked: exit fast recovery phase q Each partial ACK: send next lost segment q Every 2 duplicate ACKS: send 1 new segment (flywheel) q Recovers from N packet losses in N RTTs q Implementation based completely on ns2-l b3. q [FLOYD98]: Additional mechanism to avoid multiple retransmits, NOT IMPLEMENTED

Raj Jain The Ohio State University 7 UBR+ Buffer Management q X i = Per-VC buffer occupancy. X =  X i q Na = Number of active connections q Early Packet Discard m Drop threshold (R) = 0.8 * Buffer size m Packet is dropped if X > R q Selective Drop m Drop threshold (R) = 0.8 * Buffer size m Fairness threshold (Z) = 0.8 m Packet is dropped if q X > R and X i > Z*X/Na

Raj Jain The Ohio State University 8 Previous Results q Persistent TCP over UBR+ q Low delay: Switch improvements (PPD, EPD, SD, FBA) have more impact than end-system improvements (Slow start, FRR, New Reno, SACK). SACK can hurt under extreme congestion. q Satellite networks: End-system improvements have more impact than switch-based improvements. SACK helps significantly. q Fairness depends upon the switch drop policies and not on end-system policies

Raj Jain The Ohio State University 9 SPECWeb 96 WWW Model q Majority of traffic on the Internet is WWW q Developed by Standard Performance Evaluation Corporation (SPEC), a consortium similar to the ATM Forum for performance benchmarking q SPECMark, SPEC CPU95, SPECInt95, SPEC SFS q SPECWeb96 is for benchmarking WWW servers q Ref:

Raj Jain The Ohio State University 10 Modified SPECWeb96 q Each web page consists of one index page and 4 images. q First column: Index page (p = 1/5) q Other columns: p = 0.8

Raj Jain The Ohio State University 11 Modified SPECWeb 96 q Average file size = KB q Bandwidth per client = 0.48 Mbps  HTTP 1.1  All components of a web page are fetched in one TCP connection. q A client makes on average 5 requests every 10s. Client Server Think Time Requests Responses

Raj Jain The Ohio State University 12 N Client-Server Configuration q 1 client per server, N clients and servers, N=100 q RTTs for WAN,multiple-hop LEO/Single-hop MEO and GEO link: 10ms, 200ms and 550ms q Inter-switch link Bandwidth: 45 Mbps (T3) q Simulation Time = 100secs i.e. 10 cycles of client requests

Raj Jain The Ohio State University 13 TCP Parameters q MSS = 1024 (WAN), 9180 (LEO/MEO, GEO) bytes q RCV_WND > RTT  Bandwidth q "Silly Window Syndrome Avoidance" disabled q Initial SS_THRESH = RTT  Bandwidth [HOE96] q TCP delay ACK timer is NOT set q TCP max window scaled using window scaling option q TCP timer granularity = 100 ms

Raj Jain The Ohio State University 14 Switch Parameters

Raj Jain The Ohio State University 15 Performance Metrics q Efficiency m x i = achieved TCP throughput. N = 100 m C = max possible TCP throughput q Fairness m e i = max-min fair throughput for server i

Raj Jain The Ohio State University 16 Analysis Technique q Separate analysis for Efficiency and Fairness results.

Raj Jain The Ohio State University 17 Analysis Technique (contd.) q Overall Mean: Mean of all values q Overall Variation: Variation in the above mean q Main Effects: Means of a particular level and factor q First Order Interactions: Interactions between 2 levels of any two factors. q Allocation of Variations: What percentage of the overall variation can be explained by each main effect? q Confidence Intervals of Main Effects: Is the main effect significant?

Raj Jain The Ohio State University 18 Analysis Technique (contd.) q Goals: m To explain how much of the variation of the mean is explained by each factor? m What are the first order interactions? m What are the contributions of each level to the particular factor?

Raj Jain The Ohio State University 19 Results: WAN Efficiency q TCP type is most important factor (57% of variation) m NewReno and SACK show best performance m SACK is worse for low buffer (high congestion) q Buffer size is next important factor (30% of variation) m Increase in buffer size increases efficiency m More room for improvement for Vanilla and Reno m Buffer size of 1 RTT is sufficient. This may be related to the number of TCP connections. q Drop policies have little effect m For small buffer, SD is better than EPD

Raj Jain The Ohio State University 20 Results: WAN Fairness q Buffer size most important (53 % of variation) m Fairness increase significant for 1 RTT. q TCP type is also important (21% of variation) m NewReno has best fairness m SACK is very aggressive. Can reduce fairness. q Drop policy not important for WANs unless buffer size is small

Raj Jain The Ohio State University 21 Results: MEO Efficiency q TCP explains 57% of variation m SACK clearly show best performance q Buffer size is next important factor (22% of variation) m Increase in buffer size increases efficiency m More room for improvement for Vanilla and Reno m Buffer size of 0.5 RTT is sufficient q Drop policies have little effect

Raj Jain The Ohio State University 22 Results: MEO Fairness q Fairness values are high for buffer sizes of 0.5 RTT or more. q TCP flavor, and drop policy do not have much effect.

Raj Jain The Ohio State University 23 Results: GEO Efficiency q TCP explains 61% of variation m SACK clearly show best performance q Buffer size is next important factor (14% of variation) m Increase in buffer size increases efficiency m More room for improvement for Vanilla and Reno m Buffer size of 0.5 RTT is sufficient q Drop policies have little effect

Raj Jain The Ohio State University 24 Results: GEO Fairness q Fairness values are high for buffer sizes of 0.5 RTT or more. q TCP flavor, and drop policy do not have much effect.

Raj Jain The Ohio State University 25 Overall Results: Efficiency q End system policies have more effect as delay inccreases m SACK is generally best esp. for long delay m NewReno may be better for lower delay and severe congestion q Drop policies have more effect on lower delays. q Buffer size: Larger buffers improve performance. 0.5 RTT to 1 RTT buffers sufficient. Optimal buffer size may be related to number of TCPs.

Raj Jain The Ohio State University 26 Overall Results: Fairness q End system policies: m SACK hurts fairness for lower delay and extreme congestion q Drop policies do not hae much effect unless delay is lower and buffers are small. q Buffer size has more effect on longer delays m Increase in buffer size increases fairness.

Raj Jain The Ohio State University 27 Summary q WWW TCP over UBR+ for WAN and satellite delays q TCP: Vanilla, Reno, NewReno, SACK q UBR+: EPD, SD q Buffer Size: 0.5 RTT, 1 RTT, 2 RTT q RTT: 10 ms (WAN), 200 ms (MEO), 550 ms (GEO) q WWW model using modified SpecWeb96

Raj Jain The Ohio State University 28 Summary (contd.) q As delay increases, end system policies have more effect than drop policies or larger buffers. q SACK is generally best m Exception: Lower delay and high congestion -- NewReno is best in these cases. q Drop policies only have an effect for low delays and small buffers. q Buffer size of 0.5 RTT to 1 RTT is sufficient for the experiments performed. Buffer size may be related to the number of TCP connections.

Raj Jain The Ohio State University 29 WAN Efficiency/Fairness

Raj Jain The Ohio State University 30 WAN Allocation of Variation

Raj Jain The Ohio State University 31 WAN Confidence Intervals

Raj Jain The Ohio State University 32 MEO Efficiency/Fairness

Raj Jain The Ohio State University 33 MEO Allocation of Variation

Raj Jain The Ohio State University 34 MEO Confidence Intervals

Raj Jain The Ohio State University 35 GEO Efficiency/Fairness

Raj Jain The Ohio State University 36 GEO Allocation of Variation

Raj Jain The Ohio State University 37 GEO Confidence Intervals

Raj Jain The Ohio State University 38 Thank You!