2006 · 23 citations · 7 references
ComputingComputer ScienceComputer SystemsComputer NetworksDigital CommunicationQueuing TheoryCommunication NetworksCongestion ControlNetwork Performance AnalysisThroughput AnalysisEvent Loss ModelingLoss Event AnalysisNetwork Congestion AnalysisNetwork Congestion ModelingPacket Loss AnalysisSteady-state ThroughputThroughput
This paper presents an analytical model of steady state throughput of the Slow-but-Steady variant of TCP NewReno as a function of loss event rate, average number of segments lost per loss event, average round trip time, and retransmission timeout value. The presented model is based on the approach proposed by Padhye <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">et</i> <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">al.</i> for TCP Reno throughput modeling and extends it by capturing the effect of fast recovery algorithm of the Slow-but-Steady variant of TCP NewReno on throughput and taking into consideration slow start phase after timeout expiration. Validation by ns-2 simulations shows good agreement and accuracy of the proposed model.
7
Mark Allman, Vern Paxson, W. Richard Stevens · 1999 · 1.8K citations · Full text
Difficulties in simulating the Internet
Sally Floyd, Vern Paxson · IEEE/ACM Transactions on Networking · 2001 · 725 citations
Guido Appenzeller, Isaac Keslassy, Nick McKeown · 2004 · 682 citations