Phil Karn
Craig Partridge
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 4 Digital Equipment Corporation. DECnet Digital Network Architecture, Phase IV; NSP Functional Spectfication, Tech. Rep., Dec~ 1983.]]Google Scholar
- 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 Scholar
- 6 International Organization for Standards~ Information processing systems--Open systems interconnection. In Connection Oriented Transport Protocol Specification. International Standard 8073. ISO, Switzerland, 1986.]]Google Scholar
- 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 Scholar
- 8 Internet Engineering Task Force. In Proceedings, 1990, Tech. Rep., National Research Initiatives, and personal communication from M. K. Lottor.]]Google Scholar
- 9 JACOBSO~, V. Interpacket arrival variance and mean. Letter to the TCP-IP mailing list, June 15, 1987.]]Google Scholar
- 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 Scholar
- 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 Scholar
- 12 KARN, P. R., PRICE, H., DmRSING, R. Packet radio in the amateur service IEEE J. Select Areas Commun. 12, 4 (May 1985).]]Google Scholar
- 13 MA~KINS, A. Private communication, July 1989.]]Google Scholar
- 14 MtLLS, D. Internet delay experiments; RFC889. Internet Requests for Comments, no. 889. SRI International, Menlo Park, Calif., Dec. 1983.]] Google Scholar
- 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 Scholar
- 16 NAGLE, J. Congestion control in IP/TCP networks ACM Comput. Commun. Rev. 14, 4 (Oct. 1984), 11-17.]] Google Scholar
- 17 PERRY, D.G. Congestion in the ARPANET. Letter to the TCP-IP mailing list, Oct. 1, 1986.]]Google Scholar
- 18 POSTEL, J. (Ed). ARPANET Working Group Requests for Comments. No. 791. Internet protocol; RFC791. SRI International, Menlo Park, Calif., Sept. 1981]]Google Scholar
- 19 POSTEL, J. (Ed). Internet Requests for Comments No. 792. Internet control message protocol; RFC792. SRI International, Menlo Park, Calif., Sept. 1981]] Google Scholar
- 20 POSTEL, J. (Ed). Internet Requests for Comments. No. 793. Transmission control protocol; RFC793. SRI International, Menlo Park, Calif., Sept. 1981.]]Google Scholar
- 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 Scholar
- 22 WATSON, R.W. Timer-based mechanisms in reliable transport protocol connection management. In Computer Networks, North-Holland, Amsterdam, 1981, 47-56.]]Google Scholar
- 23 ZHANG, L. Why TCP timers don't work well. In Proceedtngs ACM SIGCOMM '86 (Aug. 1986), 397-405.]] Google Scholar
Index Terms
- Improving round-trip time estimates in reliable transport protocols
Recommendations
Improving round-trip time estimates in reliable transport protocols
As a reliable, end-to-end transport protocol, the ARPA Transmission Control Protocol (TCP) uses positive acknowledgements and retransmission to guarantee delivery. TCP implementations are expected to measure and adapt to changing network propagation ...
Improving round-trip time estimates in reliable transport protocols
SIGCOMM '87: Proceedings of the ACM workshop on Frontiers in computer communications technologyAs a reliable, end-to-end transport protocol, the ARPA Transmission Control Protocol (TCP) uses positive acknowledgements and retransmission to guarantee delivery. TCP implementations are expected to measure and adapt to changing network propagation ...
Retransmission policies for multihomed transport protocols
We evaluate three retransmission policies for transport protocols that support multihoming (e.g. SCTP). The policies dictate whether retransmissions are sent to the same peer IP address as the original transmission, or sent to an alternate peer IP ...
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