Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
An integrated model for the latency and steady-state throughput of TCP connections
Performance Evaluation
A mean-field model for multiple TCP connections through a buffer implementing RED
Performance Evaluation
A mean-field analysis of short lived interacting TCP flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
Asymptotic Behavior of Internet Congestion Controllers in a Many-Flows Regime
Mathematics of Operations Research
Equilibria of a class of transport equations arising in congestion control
Queueing Systems: Theory and Applications
Discrete-time buffer systems with session-based arrival streams
Performance Evaluation
Prediction of web goodput using nonlinear autoregressive models
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
Understanding the impact of the access technology: the case of web search services
TMA'11 Proceedings of the Third international conference on Traffic monitoring and analysis
Analytical modeling of a multi-queue nodes network router
International Journal of Automation and Computing
ISIICT'09 Proceedings of the Third international conference on Innovation and Information and Communication Technology
| Hi-index | 0.00 |
The general aim of this paper is to analyze the throughput of a HTTP flow. For this, we introduce a simplified model of such a flow which consists of a succession of idle and download periods. The file downloads are subject to a fixed packet loss probability. The same TCP connection is possibly used for the download of a random number of files, for which the effect of the slow start is taken into account. For this stochastic model, we derive a closed form formula for the stationary throughput obtained by a flow. We also derive closed form expressions for the mean time to transfer a file and for the distribution of the throughput. Several laws of file sizes and idle times are considered including heavy tailed distributions. We also briefly discuss how the formulas can be applied to predict bandwidth sharing among competing HTTP flows.