The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Enabling conferencing applications on the internet using an overlay muilticast architecture
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Random Data: Analysis and Measurement Procedures
Random Data: Analysis and Measurement Procedures
Predicting the Performance of Wide Area Data Transfers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Multivariate resource performance forecasting in the network weather service
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
IEEE/ACM Transactions on Networking (TON)
Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK
IEEE/ACM Transactions on Networking (TON)
A comparison of overlay routing and multihoming route control
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
An Empirical Study of the Multiscale Predictability of Network Traffic
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
On the predictability of large transfer TCP throughput
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Comments on "modeling TCP reno performance: a simple model and its empirical validation"
IEEE/ACM Transactions on Networking (TON)
Predicting short-transfer latency from TCP arcana: a trace-based validation
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
IEEE Transactions on Wireless Communications
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
Scenario-adaptive and gain-aware content sharing policies for cooperative wireless environments
Computer Communications
Juno: A Middleware Platform for Supporting Delivery-Centric Applications
ACM Transactions on Internet Technology (TOIT)
Short-Term spatio-temporal forecasts of web performance by means of turning bands method
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Hi-index | 0.01 |
Predicting the throughput of large TCP transfers is important for a broad class of applications. This paper focuses on the design, empirical evaluation, and analysis of TCP throughput predictors. We first classify TCP throughput prediction techniques into two categories: Formula-Based (FB) and History-Based (HB). Within each class, we develop representative prediction algorithms, which we then evaluate empirically over the Resilient Overlay Network (RON) testbed. FB prediction relies on mathematical models that express the TCP throughput as a function of the characteristics of the underlying network path. It does not rely on previous TCP transfers in the given path, and it can be performed with non-intrusive network measurements. We show, however, that the FB method is accurate only if the TCP transfer is window-limited to the point that it does not saturate the underlying path, and explain the main causes of the prediction errors. HB techniques predict the throughput of TCP flows from a time series of previous TCP throughput measurements on the same path, when such a history is available. We show that even simple HB predictors, such as Moving Average and Holt-Winters, using a history of few and sporadic samples, can be quite accurate. On the negative side, the accuracy of HB predictors is highly path-dependent.