Is the round-trip time correlated with the number of packets in flight?

Biaz, Saad; Vaidya, Nitin H.

doi:10.1145/948238.948240

Cited by 22 publications

(26 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several other studies [6,21,24,26] have focused on understanding whether delay-based congestion prediction can reliably work in the real Internet. Some of the issues raised by these studies are unique to end-host based mechanisms, while others have received similar attention in router based schemes.…”

Section: Overview Of Related Workmentioning

confidence: 99%

“…Problems of oversampling the queue lengths in router based RED mechanisms have been studied in [16]. It has been suggested that on highly aggregated paths, the impact of the response of a single flow may be limited [6,21]. But if several flows respond, then the combined effect may be sufficient to relieve the congestion and reduce the queue lengths.…”

Section: Overview Of Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Emulating AQM from end hosts

Bhandarkar

Reddy

Zhang

et al. 2007

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

In this paper, we show that end-host based congestion prediction is more accurate than previously characterized. However, it may not be possible to entirely eliminate the uncertainties in congestion prediction. To address these uncertainties, we propose Probabilistic Early Response TCP (PERT). PERT emulates the behavior of AQM/ECN, in the congestion response function of end-hosts. We present fluid-flow analysis of PERT/RED and PERT/PI, versions of PERT that emulate router-based RED and PI controllers. Our analysis shows that PERT/RED has better stability behavior than router-based RED. We also present results from ns-2 simulations to show the practical feasibility of PERT. The scheme presented here is general and can be used for emulating other AQM algorithms.

show abstract

Section: Overview Of Related Workmentioning

confidence: 99%

Section: Overview Of Related Workmentioning

confidence: 99%

Emulating AQM from end hosts

Bhandarkar

Reddy

Zhang

et al. 2007

SIGCOMM Comput. Commun. Rev.

View full text Add to dashboard Cite

show abstract

“…In addition, they require high precision packet time-stamps and accurate delay measurements in the implementation to identify the onset of congestion. Delay measurements are also susceptible to noise in low latency networks and also in the presence of dynamic background traffic [6]. Additional difficulties include robustness to randomness and widely varying RTTs for competing traffic [7].…”

Section: Introductionmentioning

confidence: 99%

NF-TCP: A Network Friendly TCP Variant for Background Delay-Insensitive Applications

Arumaithurai

Ramakrishnan

2011

Networking 2011

View full text Add to dashboard Cite

Abstract. Delay-insensitive applications, such as P2P file sharing, generate substantial amounts of traffic and compete with other applications on an equal footing when using TCP. Further, to optimize throughput, such applications typically open multiple connections. This results in unfair and potentially poor service for applications that have stringent performance objectives (including sensitivity to delay and loss). In this paper, we propose NF-TCP, a TCP variant for P2P and similar delay-insensitive applications that can afford to have communication in the "background". NF-TCP aims to be submissive to delay-sensitive applications under congestion. A major component of NF-TCP is to integrate measurement as an integral component of the congestion control framework. This enables the transport to exploit available bandwidth, so that it can aggressively utilize spare capacity.We implemented NF-TCP on Linux and ns-2. Our evaluations of the NF-TCP Linux implementation on ns-2 show that NF-TCP outperforms other network friendly approaches (e.g., LEDBAT, TCP-LP and RAPID). NF-TCP achieves high utilization, fair bandwidth allocation among NF-TCP flows and maintains a small average queue. Our evaluations further demonstrate that with NF-TCP, the available bandwidth can be efficiently utilized.

show abstract

“….1(a) shows that as ARWND increases, the RTT increases significantly, indicating high queuing delays, and possibly a high correlation between RTT and the amount of data in flight. We note that the authors of (Biaz and Vaidya, 2003) have shown that in the Internet, the correlation between the RTT and the amount of data in flight (indirectly the receiver's window size) is quite weak. This discrepancy is not entirely unexpected since wireless links have typically far less bandwidth.…”

Section: On Tcp Round Trip Timementioning

confidence: 81%