RR-TCP: A reordering-robust TCP with DSACK

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2003-January, Issue , 2003, Pages 95-106

  Zhang, Ming ^a   Karp, B ^b   Floyd, S ^c   Peterson, L ^a  

^a PRINCETON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c ICSI   (United States)

Author keywords

Degradation; Delay estimation; Internet; Out of order; Packet switching; Protocols; Robustness; Routing; Switches; Throughput

Indexed keywords

DEGRADATION; INTERNET; INTERNET PROTOCOLS; MOBILE TELECOMMUNICATION SYSTEMS; NETWORK PROTOCOLS; PACKET SWITCHING; ROBUSTNESS (CONTROL SYSTEMS); SWITCHES; THROUGHPUT; TRANSMISSION CONTROL PROTOCOL;

DELAY ESTIMATION; INTERNET ARCHITECTURE; INTERNET ROUTING; MULTI PATH ROUTING; OUT OF ORDER; OUT-OF-ORDER DELIVERIES; PARALLEL PACKET SWITCH; ROUTING;

NETWORK ARCHITECTURE;

EID: 84943576429     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2003.1249760     Document Type: Conference Paper

References (19)

1. M. Allman, H. Balakrishnan, and S. Floyd. Enhancing TCP's loss recovery using limited transmit. RFC 3042, Jan. 2001.
2. M. Allman, V. Paxson, and W. Stevens. TCP congestion control. RFC 2581, Apr. 1999.
3. D. Bansal, H. Balakrishnan, S. Floyd, and S. Shenker. Dynamic behavior of slowly-responsive congestion control algorithms. Proceedings of ACM SIGCOMM, Aug. 2001.
4. J. Bennett, C. Partridge, and N. Shectman. Packet reordering is not pathological network behavior. IEEE/ACM Transactions on Networking, 7(6):789-798, Dec. 1999.
5. E. Blanton and M. Allman. On making TCP more robust to packet reordering. ACM Computer Communication Review, 32(1), Jan. 2002.
6. B. Chen and R. Morris. Flexible control of parallelism in a multiprocessor PC router. Proceedings of the 2001 USENIX Annual Technical Conference, pages 333-346, June 2001.
7. S. Floyd, M. Handley, J. Padhye, and J. Widmer. Equation-based congestion control for unicast applications. Proceedings of ACM SIGCOMM, Aug. 2000.
8. S. Floyd, J. Mahdavi, M. Mathis, and M. Podolsky. An extension to the selective acknowledgement (SACK) option for TCP. RFC 2883, July 2000.
9. J. Hoe. Improving the start-up behavior of a congestion control scheme for TCP. Proceedings of ACM SIGCOMM, Aug. 1996.
10. V. Jacobson, R. Braden, and D. Borman. TCP extensions for high performance. RFC 1323, May 1992.
11. P. Karn and C. Partridge. Estimating round-trip times in reliable transport protocols. Proceedings of ACM SIGCOMM, Aug. 1987.
12. R. Ludwig and R. H. Katz. The Eifel algorithm: making TCP robust against spurious retransmissions. ACM Computer Communication Review, 30(1), Jan. 2000.
13. M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP selective acknowledgement options. RFC 2018, Oct. 1996.
14. ns2 (online). http://www.isi.edu/nsnam/ns.
15. J. Padhye and S. Floyd. On inferring TCP behavior. Proceedings of ACM SIGCOMM, Aug. 2001.
16. V. Paxson. End-to-end routing behavior in the Internet. Proceedings of ACM SIGCOMM, Aug. 1996.
17. V. Paxson. End-to-end Internet packet dynamics. Proceedings of ACM SIGCOMM, pages 139-152, Sept. 1997.
18. C. Ward, H. Choi, and T. Hain. A data link control protocol for LEO satellite networks providing a reliable datagram service. IEEE/ACM Transactions on Networking, 3(1):91-103, Feb. 1995.
19. M. Zhang, B. Karp, S. Floyd, and L. Peterson. RR-TCP: a reordering-robust TCP with DSACK. ICSI Technical Report TR-02-006, July 2002.