In this paper, we study the timeout probability of TCP Reno under the bursty packet loss model, which is widely used to represent the loss characteristics of TCP under drop-tail FIFO queues. With a detailed analysis on the three timeout reasons for TCP Reno, we show that the impact of timeout has been underestimated in the existing literature. Surprisingly, we find that this more precise representation of timeout probability does not match the actual performance of TCP under drop-tail FIFO queues. Therefore we conclude that the bursty loss model is incapable of capturing the behavior of drop-tail FIFO queues, and using bursty loss model to analyze TCP performance is flawed. © 2005 IEEE.published_or_final_versio
We study the burstiness of TCP flows at the packet level. We aggregate packets into entities we call...
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation ta...
In this paper we develop a simple analytic characterization of the steady state throughput as a func...
In this paper, we evaluate the performance of New-reno analytically by explicitly modeling its slow-...
peer reviewedBased on a large set of TCP sessions we first study the accuracy of two well-known anal...
We first study the accuracy of two well-known analytical models of the average throughput of long-te...
There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) perf...
In this paper, the performance of TCP in the presence of random losses/errors is examined. TCP is or...
We study in this paper the performance of a single persis-tent TCP connection, which experiences pac...
In this paper, we investigate the loss recovery behavior of TCP Reno over wireless links where packe...
Abstract—Packet losses at IP network are common behavior at the time of congestion. The TCP traffic ...
In this paper we develop a simple analytic characterization of the steady state throughput, as a fun...
A link model-driven approach towards TCP performance over a wireless link is presented. TCP packet l...
Besides the two classical techniques used to evaluate the performance of a protocol, computer simula...
One of TCP's critical tasks is to determine which packets are lost in the network, as a basis for co...
We study the burstiness of TCP flows at the packet level. We aggregate packets into entities we call...
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation ta...
In this paper we develop a simple analytic characterization of the steady state throughput as a func...
In this paper, we evaluate the performance of New-reno analytically by explicitly modeling its slow-...
peer reviewedBased on a large set of TCP sessions we first study the accuracy of two well-known anal...
We first study the accuracy of two well-known analytical models of the average throughput of long-te...
There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) perf...
In this paper, the performance of TCP in the presence of random losses/errors is examined. TCP is or...
We study in this paper the performance of a single persis-tent TCP connection, which experiences pac...
In this paper, we investigate the loss recovery behavior of TCP Reno over wireless links where packe...
Abstract—Packet losses at IP network are common behavior at the time of congestion. The TCP traffic ...
In this paper we develop a simple analytic characterization of the steady state throughput, as a fun...
A link model-driven approach towards TCP performance over a wireless link is presented. TCP packet l...
Besides the two classical techniques used to evaluate the performance of a protocol, computer simula...
One of TCP's critical tasks is to determine which packets are lost in the network, as a basis for co...
We study the burstiness of TCP flows at the packet level. We aggregate packets into entities we call...
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation ta...
In this paper we develop a simple analytic characterization of the steady state throughput as a func...