200 likes | 309 Vues
This paper investigates the performance of Transmission Control Protocol (TCP) in various network settings, focusing on both individual and aggregate behaviors under multiple competing flows. It evaluates TCP-Reno's mechanisms, such as slow start and congestion avoidance, and assesses throughput and goodput impacts based on network topology, including parameters like bandwidth and delay. Through extensive simulations, the study identifies performance discrepancies influenced by connection numbers and round-trip times, providing insights valuable for network provisioning. Future work aims to validate findings through Internet experiments.
E N D
On Individual and Aggregate TCP Performance Lili Qiu Yin Zhang Srinivasan Keshav Cornell University 7th International Conference on Network ProtocolsToronto, Canada, October 31 - November 3, 1999
Talk Outline • Introduction & Motivation • Brief Overview of TCP-Reno • Related Work • Aggregate TCP performance • Summary and future work
Introduction • Understanding TCP performance is critical • Our knowledge is still insufficient • TCP performance under many competing flows is not sufficiently explored • Unclear about the impact of network topology • Goal • Investigate both individual and aggregate TCP behavior under many competing connections • Investigate the impact of network topology • Approach • Extensive simulation
Overview of TCP-Reno • Slow start • Congestion avoidance • Loss recovery • Time out • Fast retransmission
Related Work • TCP analytical model [Padhye et al 98] • Models the throughput of an individual TCP conn • Our simulation evaluation shows the model is reasonably accurate • Doesn’t consider aggregate performance • TCP Behavior with many TCP Flows [Morris 97] • TCP-Taheo under RED dropping policy • Only studies the impact of different # conns • Doesn’t consider other network parameters
Aggregate TCP Performance • Motivation • Useful for network provisioning • Goal • Aggregate TCP behavior for a large number of connections • Impact of network topology
Network Model • Network parameters • Bandwidth • Prop delay • Buffer size • Total number of connections • TCP-Reno • Dropping tail • Notation • = bottleneck bandwidth * propagation delay • = + bottleneck buffer
Simulation Methodology • Three sets of simulations • Same RTT • With random processing time • Two RTT’s
Simulation 1: With Same RTT • TCP exhibits wide range of behaviors depending on • Case 1: (Large Pipe) • Case 2: (Small Pipe) • Case 3: (Medium Pipe)
Simulation 1: With Same RTTCase 1 ( ) • Global synchronization • Fair
Simulation 1: With Same RTTCase 2 ( ) • Shut-off connections
Simulation 1: With Same RTTCase 3: ( ) • Local synchronization
Simulation 1: With Same RTTPerformance Results • Throughput • Close to 1 if buffer > Wopt or # conn is large • Goodput • Decreases with # conn • Decreasing rate depends on bottleneck bandwidth • Loss probability • Small # conn: Quadratic • Large # conn: Hyperbolic
Simulation 2: With Random Processing Time • Case 1 ( ) • Global synchronization breaks down • Case 2 ( ) • Discrimination less severe • Fewer shut-off connections • Case 3 ( ) • Local synchronization disappears
Simulation 2: With Random Processing TimePerformance Results • Aggregate Throughput • Aggregate Goodput • Loss Probability • Small # conns: linear increase • Large # conns: hyperbolic as before
Simulation 3: Different RTTs • It’s well-known that TCP has bias against long roundtrip time connections • Goal: Quantify the discrimination • Simulation Topology:
Summary and Future Work • Evaluate the analytical model for individual TCP connection • Study aggregate TCP performance • With same RTT • With random processing time • With two RTT’s and random processing time • Future directions • Use Internet experiments to verify the results • Further explore TCP performance under different RTT’s