skip to main content
article

A new TCP for persistent packet reordering

Published: 01 April 2006 Publication History

Abstract

Most standard implementations of TCP perform poorly when packets are reordered. In this paper, we propose a new version of TCP that maintains high throughput when reordering occurs and yet, when packet reordering does not occur, is friendly to other versions of TCP. The proposed TCP variant, or TCP-PR, does not rely on duplicate acknowledgments to detect a packet loss. Instead, timers are maintained to keep track of how long ago a packet was transmitted. In case the corresponding acknowledgment has not yet arrived and the elapsed time since the packet was sent is larger than a given threshold, the packet is assumed lost. Because TCP-PR does not rely on duplicate acknowledgments, packet reordering (including out-or-order acknowledgments) has no effect on TCP-PR's performance.Through extensive simulations, we show that TCP-PR performs consistently better than existing mechanisms that try to make TCP more robust to packet reordering. In the case that packets are not reordered, we verify that TCP-PR maintains the same throughput as typical implementations of TCP (specifically, TCP-SACK) and shares network resources fairly. Furthermore, TCP-PR only requires changes to the TCP sender side making it easier to deploy.

References

[1]
{1} E. Blanton and M. Allman, "On making TCP more robust to packet reordering," ACM Comput. Commun. Rev., vol. 32, no. 1, 2002.]]
[2]
{2} V. Paxson, "End-to-end routing behavior in the Internet," in ACM SIGCOMM , 1996, pp. 25-38.]]
[3]
{3} J. Bennett and C. Partridge, "Packet reordering is not pathological network behavior," IEEE/ACM Trans. Netw., vol. 7, no. 6, pp. 789-798, Dec. 1999.]]
[4]
{4} L. Cottrell, "Packet reordering," {Online}. Available: http://www-iepm. slac.stanford.edu/monitoring/reorder/]]
[5]
{5} F. Wang and Y. Zhang, "Improving TCP performance over mobile ad-hoc networks with out-of-order detection and response," in ACM MOBIHOC, 2002, pp. 217-225.]]
[6]
{6} T. Dyer and R. Boppana, "A comparison of TCP performance over three routing protocols for mobile ad hoc networks," in ACM MOBI-HOC , 2001, pp. 56-66.]]
[7]
{7} G. Holland and N. Vaidya, "Analysis of TCP performance over mobile ad-hoc networks," in ACM MOBICOM, 1999, pp. 219-230.]]
[8]
{8} S. Blake, D. Black, M. Carlson, E. Davies, Z. Whang, and W. Weiss, "An architecture for differentiated services," RFC 2475, 1998.]]
[9]
{9} D. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, MA: Athena Scientific, 1998.]]
[10]
{10} N. Taft-Plotkin, B. Bellur, and R. Ogier, "Quality-of-service routing using maximally disjoint paths," in Proc. IEEE/IFIP IWQoS'99, Jun. 1999, pp. 119-128.]]
[11]
{11} S. Bohacek, J. Hespanha, K. Obraczka, J. Lee, and C. Lim, "Secure stochastic routing," presented at the ICCCN'02, Miami, FL, 2002.]]
[12]
{12} R. Teixeira, K. Marzullo, S. Savage, and G. M. Voelker, "Characterizing and measuring path diversity of Internet topologies," presented at the ACM SIGMETRICS, San Diego, CA, Jun. 2003.]]
[13]
{13} A. Nasipuri and S. Das, "Demand multipath routing for mobile ad hoc networks," presented at the ICCCN'99, Boston, MA, Oct. 1999.]]
[14]
{14} M. Pearlman, Z. Haas, P. Sholander, and S. Tabrizi, "The impact of alternate path routing for load balancing in mobile ad hoc networks," presented at the ACM MobiHoc, Boston, MA, Aug. 2000.]]
[15]
{15} R. Ludwig and R. Katz, "The Eifel algorithm: making TCP robust against spurious retransmissions," ACM Comput. Commun. Rev., vol. 30, no. 1, 2000.]]
[16]
{16} S. Floyd, J. Mahdavi, M. Mathis, and M. Podolsky, "An extension to the Selective Acknowledgment (SACK) option for TCP," RFC 2883, 2000.]]
[17]
{17} N. Zhang, B. Karp, S. Floyd, and L. Peterson, RR-TCP: A reordering-robust TCP With DSACK. ICSI, Berkeley, CA, Tech. Rep. TR-02-006, Jul. 2002.]]
[18]
{18} V. Paxson, "End-to-end Internet packet dynamics," presented at the ACM SIGCOMM, Cannes, France, 1997.]]
[19]
{19} S. Bhandarkar, N. Sadry, A. L. N. Reddy, and N. Vaidya, "TCP-DCR: a novel protocol for tolerating wireless channel errors," IEEE Trans. Mobile Comput., vol. 4, no. 5, pp. 517-529, Sep.-Oct. 2004.]]
[20]
{20} 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 Trans. Netw., vol. 11, no. 6, pp. 959-971, Dec. 2003.]]
[21]
{21} M. Allman and V. Paxson, "Computing TCP's retransmission timer," RFC 2988, Nov. 2000.]]
[22]
{22} S. Bohacek, "A stochastic model of TCP and fair video transmission," in Proc. IEEE INFOCOM, 2003, pp. 1134-1144.]]
[23]
{23} R. Braden, "Requirements for Internet Hostsdoctype-communication layers," RFC 1122, Oct. 1989.]]
[24]
{24} V. Jacobson, "Congestion avoidance and control," in ACM Comput. Commun. Rev.; Proc. SIGCOMM'88, Stanford, CA, Aug. 1988, vol. 18, no. 4, pp. 314-329.]]
[25]
{25} M. Allman and V. Paxson, "On estimating end-to-end network path properties," presented at the ACM SIGCOMM, Cambridge, MA, 1999.]]
[26]
{26} The VINT Project, a collaboration between researchers at UC Berkeley, LBL, USC/ISI, and Xerox PARC, The ns Manual (formerly ns Notes and Documentation). {Online}. Available: http://www.isi.edu/nsnam/ns/ns-documentation.html, Oct. 2000.]]
[27]
{27} M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, "TCP selective acknowledgment options," RFC 2018, 1996.]]
[28]
{28} S. Floyd, M. Handley, J. Padhye, and J. Widmer, "Equation-based congestion control for unicast applications," presented at the ACM SIGCOMM, Stockholm, Sweden, 2000.]]
[29]
{29} S. Floyd, "Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic," ACM Comput. Commun. Rev., vol. 21, no. 5, pp. 30-47, Oct. 1991.]]
[30]
{30} D. Katabi, M. Handley, and C. Rohrs, "Internet congestion control for future high bandwidth-delay product environments," presented at the ACM SIGCOMM, Pittsburgh, PA, 2002.]]
[31]
{31} F. Hernández-Campos, J. S. Marron, G. Samorodnitsky, and F. D. Smith, "Variable heavy tail duration in Internet traffic," presented at the IEEE/ACM MASCOTS, Fort Worth, TX, 2002.]]
[32]
{32} S. Floyd, Scripts for Adaptive Red Simulations. {Online}. Available: http://www.icir.org/floyd/adaptivered/papersims/single1.tcl]]
[33]
{33} D. Chiu and R. Jain, "Analysis of the increase/decrease algorithms for congestion avoidance in computer networks," J. Comput. Netw. ISDN, vol. 17, pp. 1-14, 1989.]]
[34]
{34} S. Bohacek, J. Hespanha, K. Obraczka, and J. Lee, "Analysis of a TCP hybrid model," in Proc. 39th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, 2001.]]
[35]
{35} M. Allman, H. Balakrishnan, and S. Floyd, "Enhancing TCP's loss recovery using limited transmit," RFC 3042, 2001.]]
[36]
{36} J. Hespanha and S. Bohacek, "Preliminary results in routing games," presented at the American Control Conf., Arlington, VA, Jun. 2001.]]
[37]
{37} The TCP-PR Web Page. {Online}. Available: http://eecis.udel.edu/bohacek/tcp-pr.htm]]
[38]
{38} B. Davie, A. Charny, J. C. R. Bennett, K. Benson, J. Y. Le Boudec, W. Courtney, S. Davari, V. Firoiu, and D. Stiliadis, "An expedited forwarding PHB (Per-Hop Behavior)," RFC 3246, 2001.]]

Cited By

View all
  • (2019)A Packet Level Steering Solution for Tightly Coupled LWIP Networks2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)10.1109/ANTS47819.2019.9118009(1-6)Online publication date: 16-Dec-2019
  • (2017)Stabilization of stochastic delay systems via a disordered controllerApplied Mathematics and Computation10.1016/j.amc.2017.06.022314:C(98-109)Online publication date: 1-Dec-2017
  • (2015)Network coding for severe packet reordering in multihop wireless networksInternational Journal of Distributed Sensor Networks10.1155/2015/3791082015(148-148)Online publication date: 1-Jan-2015
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking
IEEE/ACM Transactions on Networking  Volume 14, Issue 2
April 2006
217 pages

Publisher

IEEE Press

Publication History

Published: 01 April 2006
Published in TON Volume 14, Issue 2

Author Tags

  1. congestion control
  2. packet reordering
  3. transport protocols

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 22 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2019)A Packet Level Steering Solution for Tightly Coupled LWIP Networks2019 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)10.1109/ANTS47819.2019.9118009(1-6)Online publication date: 16-Dec-2019
  • (2017)Stabilization of stochastic delay systems via a disordered controllerApplied Mathematics and Computation10.1016/j.amc.2017.06.022314:C(98-109)Online publication date: 1-Dec-2017
  • (2015)Network coding for severe packet reordering in multihop wireless networksInternational Journal of Distributed Sensor Networks10.1155/2015/3791082015(148-148)Online publication date: 1-Jan-2015
  • (2014)Adaptive network-traffic balancing on multi-core software networking devicesComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2014.04.01569(19-34)Online publication date: 1-Aug-2014
  • (2012)OSIAJournal of Network and Computer Applications10.1016/j.jnca.2011.09.00435:2(633-643)Online publication date: 1-Mar-2012
  • (2011)Real-time video streaming over multipath in multi-hop wireless networksMultimedia Systems10.1007/s00530-010-0210-017:4(287-297)Online publication date: 1-Jul-2011
  • (2011)Implementing information-theoretically secure oblivious transfer from packet reorderingProceedings of the 14th international conference on Information Security and Cryptology10.1007/978-3-642-31912-9_22(332-345)Online publication date: 30-Nov-2011
  • (2010)Multipath network flowsProceedings of the 29th conference on Information communications10.5555/1833515.1833864(2714-2720)Online publication date: 14-Mar-2010
  • (2010)Enhancing wireless TCPProceedings of the 29th conference on Information communications10.5555/1833515.1833594(391-395)Online publication date: 14-Mar-2010
  • (2008)Fair link striping with FIFO delivery on heterogeneous channelsComputer Communications10.1016/j.comcom.2008.05.04231:14(3427-3437)Online publication date: 1-Sep-2008
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media