skip to main content
10.1145/1080091.1080110acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

On the predictability of large transfer TCP throughput

Published:22 August 2005Publication History

ABSTRACT

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.

References

  1. Resilient Overlay Network (RON). http://nms.lcs.mit.edu/ron/, February 2005.Google ScholarGoogle Scholar
  2. A. Akella, J. Pang, A. Shaikh, B. Maggs, and S. Seshan. A Comparison of Overlay Routing and Multihoming Route Control. In Proc. of ACM SIGCOMM, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris. Resilient Overlay Networks. In Proc. of ACM Symposium on Operating Systems Principles, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. N. Cardwell, S.Savage, and T.Anderson. Modeling TCP Latency. In Proc. of IEEE INFOCOM, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  5. Y-H. Chu, S. G. Rao, S. Seshan, and H. Zhang. Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture. In Proc. of ACM SIGCOMM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-Based Congestion Control for Unicast Applications. In Proc. of ACM SIGCOMM, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Ben Fredj, T. Bonald, A. Proutiere, G. Regnie, and J. W. Roberts. Statistical Bandwidth Sharing: A Study of Congestion at Flow Level. In Proc. of ACM SIGCOMM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. Goyal, R. Guerin, and R. Rajan. Predicting TCP Throughput From Non-invasive Network Sampling. In Proc. of IEEE INFOCOM, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  9. Iperf. http://dast.nlanr.net/Projects/Iperf/.Google ScholarGoogle Scholar
  10. M. Jain and C. Dovrolis. End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput. IEEE/ACM Transactions on Networking, 11(4):537--549, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Mathis, J. Semke, and J. Madhavi. The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm. ACM Computer Communications Review, 27(3):67--82, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Padhye, V.Firoiu, D.Towsley, and J. Kurose. Modeling TCP Throughput: A Simple Model and its Empirical Validation. IEEE/ACM Transactions on Networking, 8(2):133--145, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. M. Pourahmadi. Foundations of Time Series Analysis and Prediction Theory. John Wiley and Sons, 2001.Google ScholarGoogle Scholar
  14. Y. Qiao, J. Skicewicz, and P. Dinda. An Empirical Study of the Multiscale Predictability of Network Traffic. In IEEE Proc. of HPDC, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. S. Ratnasamy, M. Handley, R. Karp, and S. Shenker. Topologically-Aware Overlay Construction and Server Selection. In Proc. of IEEE INFOCOM, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  16. V. Ribeiro, R. Riedi, R. Baraniuk, J. Navratil, and L. Cottrell. pathChirp: Efficient Available Bandwidth Estimation for Network Paths. In Proc. of Passive and Active Measurements (PAM) workshop, April 2003.Google ScholarGoogle Scholar
  17. R.S. Tsay. Outliers, Level Shifts, and Variance Changes in Time Series. Journal of Forecasting, 1988.Google ScholarGoogle Scholar
  18. A. Sang and S. Li. A Predictability Analysis of Network Traffic. Computer Networks, 39(4):329 -- 345, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  19. B. Sikdar, S. Kalyanaraman, and K. S. Vastola. Analytic Models for the Latency and Steady-State Throughput of TCP Tahoe, Reno and SACK. IEEE/ACM Transactions on Networking, 11(6):959--971, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. M. Swany and R. Wolski. Multivariate Resource Performance Forecasting in the Network Weather Service. In Proc. of Supercomputing, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. X. Tian, J. Wu, and C. Ji. A Unified Framework for Understanding Network Traffic Using Independent Wavelet Models. In Proc. of IEEE INFOCOM, 2002.Google ScholarGoogle Scholar
  22. S. Vazhkudai, J. Schopf, and I. Foster. Predicting the Performance of Wide Area Data Transfers. In Proc. of IEEE IPDPS, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Y. Zhang, N. Duffield, V. Paxson, and S. Shenker. On the Constancy of Internet Path Properties. In Proc. of Internet Measurement Workshop, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the predictability of large transfer TCP throughput

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SIGCOMM '05: Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
        August 2005
        350 pages
        ISBN:1595930094
        DOI:10.1145/1080091
        • cover image ACM SIGCOMM Computer Communication Review
          ACM SIGCOMM Computer Communication Review  Volume 35, Issue 4
          Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
          October 2005
          324 pages
          ISSN:0146-4833
          DOI:10.1145/1090191
          Issue’s Table of Contents

        Copyright © 2005 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 22 August 2005

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate554of3,547submissions,16%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader