TCP NewReno Throughput in the Presence of Correlated Losses: The Slow-but-Steady Variant

Dunaytsev, Roman; Koucheryavy, Yevgeni; Harju, Jarmo

doi:10.1109/infocom.2006.56

Cited by 22 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Using expressions obtained in [3], [4], [5], the analytical end-to-end throughput versus packet error rate for the case of a 2Mbps bottleneck with 100ms RTT is plotted in Fig. 3, for three well known TCP flavors: TCR Reno (TCPR), TCP NewReno (TCPNR), and TCP Westwood (TCPW).…”

Section: A Analysis Simulation and Discussionmentioning

confidence: 99%

A Software Download Management Module

Holland

Mahmoodi

Aghvami

2007

2007 IEEE 66th Vehicular Technology Conference

View full text Add to dashboard Cite

In this paper, we discuss the development of a Software Download Management (SDM) module, envisioned to handle the implications and associated operations of downloads for mobile terminal reconfiguration. We highlight the SDM operations in the pre-, during-, and post-download phases, and some emphasis is also placed on the transport-layer decision making capabilities of the SDM. An important emerging capability is mass-reconfiguration, involving the alteration of common functionalities in many terminals concurrently. Relevant scenarios here might include the adaptation of a protocol or codec, an upgrade of an operating system capability, or indeed a change in network configuration which requires a large number of terminals to be adapted accordingly. A particular emphasis is also therefore on one-to-many download functionalities.

show abstract

Section: A Analysis Simulation and Discussionmentioning

confidence: 99%

A Software Download Management Module

Holland

Mahmoodi

Aghvami

2007

2007 IEEE 66th Vehicular Technology Conference

View full text Add to dashboard Cite

show abstract

“…To derive the transition probabilities between different states, let us define P NL (W ) as the probability that none of the packets in a window W is lost, P TO (W ) as the probability of a TCP sender timing out before receiving less than three duplicate ACKs for W packets sent and P FR (W ) as the probability of a TCP sender going to an FR state on receiving triple duplicate ACKs. All the transition probabilities are derived by conditioning on the number of PFBs lost given the size of W with distribution given in (12). Let p be the BLP which is also the probability of losing a PFB.…”

Section: State Transition Probabilities Of Markov Chainmentioning

confidence: 99%

“…From an FR state, i.e., V k = (FR, W), after the fast retransmit/fast recovery mechanism of NewReno with partial window deflation, W is reduced by half [12].…”

Section: State Transition Probabilities Of Markov Chainmentioning

confidence: 99%

“…We select NewReno because measurements in [11] show that it is the most widely used implementation of TCP in the Internet. We model the Slow-but-Steady variant of TCP NewReno [12] in which the value of retransmission timer (RTO) is reset after each partial acknowledgment (ACK) during the fast recovery phase. We also model the partial window deflation algorithm wherein, if the source receives a partial ACK it retransmits the first unacknowledged packet, then decreases the window by the amount of new data acknowledged and adds one packet back.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A stochastic model for the behavior of multiple TCP NewReno sources over optical burst switching network

2011

View full text Add to dashboard Cite

This work proposes a stochastic model to characterize the transmission control protocol (TCP) over optical burst switching (OBS) networks which helps to understand the interaction between the congestion control mechanism of TCP and the characteristic bursty losses in the OBS network. We derive the steady-state throughput of a TCP NewReno source by modeling it as a Markov chain and the OBS network as an open queueing network with rejection blocking. We model all the phases in the evolution of TCP congestion window and evaluate the number of packets sent and time spent in different states of TCP. We model the mixed assembly process, burst assembler and disassembler modules, and the core network using queueing theory and compute the burst loss probability and end-to-end delay in the network. We derive expression for the throughput of a TCP source by solving the models developed for the source and the network with a set of fixed-point equations. To evaluate the impact of a burst loss on each TCP flow accurately, we define the burst as a composition of per-flow-bursts (which is a burst of packets from a single source). Analytical and simulation results validate the model and highlight the importance of accounting for individual phases in the evolution of TCP congestion window.

show abstract

“…The model for TCP NewReno base on the TCP Reno model is presented more recently where the effect of correlated losses also studied [11]. Therefore, throughput (B NR ) is proportional to the the number of segments lost per loss event (8) in addition to the loss probability, p, and RTf.…”

Section: Tcp Throughput Modelingmentioning

confidence: 99%

Cross-layer optimization of the link-layer based on the detected TCP flavor

Mahmoodi

Holland

Friderikos

et al. 2008

2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications

View full text Add to dashboard Cite

A range of 8avors of TCP are already in existence, and further 8avors are being introduced in order to, for example, cope with the packet loss characteristics of wireless links. Moreover, the proliferation new wireless standards and the relative performance differences among them have been mushrooming in recent years. Given the increasingly heterogeneous nature of the Internet, mechanisms do not usually exist for a server to specifically select an appropriate TCP 8avor for each individual download. In this paper, we therefore present and assess a cross-layer solution for a node (e.g. a base-station) to quickly adapt lower-layer characteristics (the coding rate and local ARQ retransmissions threshold) based on the detected TCP 8avor, in order to optimize the end-to-end performance of the download for that utilized 8avor. We demonstrate that the proposed scheme has considerable potential to improve the overall download throughput, while placing no burden on the server and requiring no changes to existing TCP implementations.

show abstract

TCP NewReno Throughput in the Presence of Correlated Losses: The Slow-but-Steady Variant

Cited by 22 publications

References 11 publications

A Software Download Management Module

A Software Download Management Module

A stochastic model for the behavior of multiple TCP NewReno sources over optical burst switching network

Cross-layer optimization of the link-layer based on the detected TCP flavor

Contact Info

Product

Resources

About