skip to main content
article
Free Access

Improving round-trip time estimates in reliable transport protocols

Published:01 November 1991Publication History
First page image

References

  1. 1 BRADEN, R. (Ed.). Requirements for Internet hosts--Communication layers. In Internet Requests for Comments, no. 1122, SRI International, Menlo Park, Calif., Oct. 1989.]]Google ScholarGoogle Scholar
  2. 2 CLARK, D. D., ZHANG, L., AND LAMBERT, M. NETBLT: A high throughput transport protocol. In Proceedings of the ACM SIGCOMM '87 (Stowe, Vt., Aug. 1987). ACM, New York, 1987, 353-359.]] Google ScholarGoogle Scholar
  3. 3 CLARK, D. D., JACOBSO~, V., ROMKEY, J., AND SALWEN, H. An Analysis of TCP processing overhead. IEEE Commun. 27, 6 (July 1989), 23-29.]]Google ScholarGoogle Scholar
  4. 4 Digital Equipment Corporation. DECnet Digital Network Architecture, Phase IV; NSP Functional Spectfication, Tech. Rep., Dec~ 1983.]]Google ScholarGoogle Scholar
  5. 5 EDGE, S.W. An adaptive timeout algorithm for retransmission across a packet switching network. In Proceedings of the ACM SIGCOMM '84. ACM, New York, 1984, 248-255.]] Google ScholarGoogle Scholar
  6. 6 International Organization for Standards~ Information processing systems--Open systems interconnection. In Connection Oriented Transport Protocol Specification. International Standard 8073. ISO, Switzerland, 1986.]]Google ScholarGoogle Scholar
  7. 7 International Organization for Standards. Information processing systems--Open systems interconnection--Protocol for Providtng the Connecttonless-Mode Network Service. International Standard 8473. ISO, Switzerland, 1988.]]Google ScholarGoogle Scholar
  8. 8 Internet Engineering Task Force. In Proceedings, 1990, Tech. Rep., National Research Initiatives, and personal communication from M. K. Lottor.]]Google ScholarGoogle Scholar
  9. 9 JACOBSO~, V. Interpacket arrival variance and mean. Letter to the TCP-IP mailing list, June 15, 1987.]]Google ScholarGoogle Scholar
  10. 10 JACOBSON, V. Congestion avoidance and control. In Proceedings of the ACM SIGCOMM '88 (Stanford, Calif., Aug. 1988), ACM, New York, 1988, 314-329.]] Google ScholarGoogle Scholar
  11. 11 JAIN, R. Divergence of timeout algorithms for packet retransmissions. In Proceedings of the Fifth Annual International Phoenix Conference on Computers and Communicattons (Scottsdale, Ariz, Mar. 1986), 174-179]]Google ScholarGoogle Scholar
  12. 12 KARN, P. R., PRICE, H., DmRSING, R. Packet radio in the amateur service IEEE J. Select Areas Commun. 12, 4 (May 1985).]]Google ScholarGoogle Scholar
  13. 13 MA~KINS, A. Private communication, July 1989.]]Google ScholarGoogle Scholar
  14. 14 MtLLS, D. Internet delay experiments; RFC889. Internet Requests for Comments, no. 889. SRI International, Menlo Park, Calif., Dec. 1983.]] Google ScholarGoogle Scholar
  15. 15 MORRtS, R. J.T. Fixing timeout intervals for lost packet detection in computer commumcations networks. AFIPS Conference Proceedings. 1979 National Computer Conference. AFIPS Press, Montvale, N.J., 1979, 887-891.]]Google ScholarGoogle Scholar
  16. 16 NAGLE, J. Congestion control in IP/TCP networks ACM Comput. Commun. Rev. 14, 4 (Oct. 1984), 11-17.]] Google ScholarGoogle Scholar
  17. 17 PERRY, D.G. Congestion in the ARPANET. Letter to the TCP-IP mailing list, Oct. 1, 1986.]]Google ScholarGoogle Scholar
  18. 18 POSTEL, J. (Ed). ARPANET Working Group Requests for Comments. No. 791. Internet protocol; RFC791. SRI International, Menlo Park, Calif., Sept. 1981]]Google ScholarGoogle Scholar
  19. 19 POSTEL, J. (Ed). Internet Requests for Comments No. 792. Internet control message protocol; RFC792. SRI International, Menlo Park, Calif., Sept. 1981]] Google ScholarGoogle Scholar
  20. 20 POSTEL, J. (Ed). Internet Requests for Comments. No. 793. Transmission control protocol; RFC793. SRI International, Menlo Park, Calif., Sept. 1981.]]Google ScholarGoogle Scholar
  21. 21 VELTEX, D., HINDEN, R., SAX, J. Internet Requests for Comments. No. 908 Reliable data protocol; RFC908. SRI International, Menlo Park, Calif., July 1984.]] Google ScholarGoogle Scholar
  22. 22 WATSON, R.W. Timer-based mechanisms in reliable transport protocol connection management. In Computer Networks, North-Holland, Amsterdam, 1981, 47-56.]]Google ScholarGoogle Scholar
  23. 23 ZHANG, L. Why TCP timers don't work well. In Proceedtngs ACM SIGCOMM '86 (Aug. 1986), 397-405.]] Google ScholarGoogle Scholar

Index Terms

  1. Improving round-trip time estimates in reliable transport protocols

      Recommendations

      Reviews

      Robert Bruce McLaughlin

      The authors give a new algorithm for calculating the retransmit times (smoothed round-trip time, SRTT, and retransmission time-out, RTO) in a TCP network. The problem with current methods is that acknowledgments do not indicate whether they are for retransmissions or for the packet originally sent. This ambiguity can throw off estimates of SRTT and RTO, causing the retransmit timers to be wildly off. The authors review several current methods for correcting this problem, giving reasons why some of these methods cannot correct the problem and may make things worse. The problem could be solved by serializing acknowledgments so that they can be matched to the transmissions to which they are responding. The authors suggest that retransmission times (SRTT and RTO) only be calculated based on acknowledgments for packets that have not been retransmitted. They further suggest that back-off on RTO not occur until after a retransmission attempt has been made and has failed. Using a statistical argument, the authors give an upper bound on RTO based on prior estimates of SRTT. O ne must be careful in choosing the method used to calculate RTO and SRTT to ensure a quick and stable convergence, something that is not guaranteed by any of the proposed algorithms. The authors give some good suggestions and make some valid observations. It would have been better for their case if they had presented some data. A worthwhile project would be gathering data on retransmission times on IP networks in order to determine the effect of different algorithms for calculating SRTT and RTO on throughput and network efficiency. The authors leave open the problem of balancing the problems of throughput and transmission delays that are common in IP networks.

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Comments

      Login options

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

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Computer Systems
        ACM Transactions on Computer Systems  Volume 9, Issue 4
        Nov. 1991
        113 pages
        ISSN:0734-2071
        EISSN:1557-7333
        DOI:10.1145/118544
        Issue’s Table of Contents

        Copyright © 1991 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 November 1991
        Published in tocs Volume 9, Issue 4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader