Abstract-This paper develops a simple and accurate stochastic model for the steady-state throughput of a TCP NewReno bulk data transfer as a function of round-trip time and loss rate. Our model builds upon extensive prior work on TCP Reno throughput models but differs from these prior works in three key aspects. First, our model introduces an analytical characterization of the TCP NewReno fast recovery algorithm. Second, our model incorporates a more accurate formulation of NewReno's timeout behaviour. Third, our model is formulated using a flexible twoparameter loss model that can better represent the diverse packet loss scenarios encountered by TCP on the Internet. We validated our model by conducting a large number of simulations using the ns-2 simulator and by conducting emulation and Internet experiments using a NewReno implementation in the BSD TCP/IP protocol stack. The main findings from the experiments are: (1) the proposed model accurately predicts the steady-state throughput for TCP NewReno under a wide range of network conditions; (2) TCP NewReno significantly outperforms TCP Reno in many of the scenarios considered; and (3) using existing TCP Reno models to estimate TCP NewReno throughput may introduce significant errors.
This paper develops analytic models that characterize the behavior of on-demand stored media content delivery using BitTorrent-like protocols. The models capture the effects of different piece selection policies, including Rarest-First and two variants of In-Order. Our models provide insight into transient and steady-state system behavior, and help explain the sluggishness of the system with strict In-Order streaming. We use the models to compare different retrieval policies across a wide range of system parameters, including peer arrival rate, upload/download bandwidth, and seed residence time. We also provide quantitative results on the startup delays and retrieval times for streaming media delivery. Our results provide insights into the optimal design of peer-to-peer networks for on-demand media streaming.
This paper presents a novel dynamic bandwidth estimation mechanism for improving TCP (Transmission Control Protocol) performance in wired-cum-wireless networks. The key idea here is to continuously measure the bandwidth used by a TCP flow via monitoring the rate of returning acknowledgements (ACKs) and the round-trip time (RTT) values. The distinguishing feature of this mechanism (compared to other mechnaisms such as that in TCP Westwood) is that it exploits the burstiness pattern of ACK arrivals and estimates the available bandwidth more accurately. In the proposed bandwidth estimation mechanism, the bandwidth sample is calculated by distributing a burst of ACKs over an off period based on degree of congestion and burstiness in the network. The estimation technique is robust against burstiness of ACK arrival and type of loss (e.g., wireless loss, congestion loss). Simulation results obtained using ns-2 reveal that, a new variant of TCP New-Reno based on this adaptive bandwidth estimation technique, which is referred to as TCP Prairie, provides significant throughput performance improvement over TCP New-Reno and TCP Westwood under congestion and/or wireless loss scenarios. Also, compared to TCP Westwood, TCP Prairie is observed to be more friendly towards TCP New-Reno.
In this paper, we compare the throughputs of two different TCP NewReno variants, namely Slow-but-Steady and Impatient. We develop analytic throughput models of these variants as a function of round-trip time, loss event rate, and the burstiness of packet drops within a loss event. Our models build upon prior work on TCP Reno throughput modeling, but extend this work to provide an analytical characterization of the NewReno fast recovery algorithms. We validated our models using the ns-2 simulator. Our models accurately predict the steady-state NewReno throughput for a wide range of loss rates. Based on these models, we analytically determine the preferred operating regions for each TCP variant. Our results show that the Slow-but-Steady variant is comparable to or superior to the Impatient variant in all but the most extreme scenarios for network packet loss.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.