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
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
An Empirical Study of the Multiscale Predictability of Network Traffic
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Predicting short-transfer latency from TCP arcana: a trace-based validation
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
A machine learning approach to TCP throughput prediction
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the predictability of large transfer TCP throughput
Computer Networks: The International Journal of Computer and Telecommunications Networking
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Performance of a GridFTP overlay network
Future Generation Computer Systems
Answering what-if deployment and configuration questions with wise
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Support vector regression for link load prediction
Computer Networks: The International Journal of Computer and Telecommunications Networking
A GridFTP Overlay Network Service
GRID '06 Proceedings of the 7th IEEE/ACM International Conference on Grid Computing
On the accuracy of TCP throughput prediction for opportunistic wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
An empirical evaluation of short-period prediction performance
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Analysis of prediction performance of training-based models using real network traffic
International Journal of Computer Applications in Technology
Interactions of intelligent route control with TCP congestion control
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Towards versatile performance models for complex, popular applications
ACM SIGMETRICS Performance Evaluation Review
Topology aware internet traffic forecasting using neural networks
ICANN'07 Proceedings of the 17th international conference on Artificial neural networks
Practical performance models for complex, popular applications
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
An analytic throughput model for TCP NewReno
IEEE/ACM Transactions on Networking (TON)
Formula-based TCP throughput prediction with available bandwidth
IEEE Communications Letters
A machine learning approach to TCP throughput prediction
IEEE/ACM Transactions on Networking (TON)
Predicting network throughput for grid applications on network virtualization areas
Proceedings of the first international workshop on Network-aware data management
Dual time-scale distributed capacity allocation and load redirect algorithms for cloud systems
Journal of Parallel and Distributed Computing
Anomaly detection in VoIP traffic with trends
Proceedings of the 24th International Teletraffic Congress
What SNMP data can tell us about edge-to-edge network performance
PAM'13 Proceedings of the 14th international conference on Passive and Active Measurement
Answering: techniques and deployment experience
IEEE/ACM Transactions on Networking (TON)
Choreo: network-aware task placement for cloud applications
Proceedings of the 2013 conference on Internet measurement conference
Anomaly detection in diurnal data
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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 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, HB predictors are highly path-dependent. We explain the cause of such path dependencies based on two key factors: the load on the path and the degree of statistical multiplexing.