Abstract
TCP was designed for fixed, wired networks. As a result TCP performs suboptimal in networks with a high degree of parallelism and frequent topology changes, e.g., in wireless mesh networks. One reason for this is standard TCP’s behavior in presence of packet reordering.
In this paper we introduce a novel backwards compatible method how TCP’s performance can be improved in face of packet reordering. Our scheme is a receiver only modification that enables detection of packet reordering and appropriately changes TCP’s behavior. It also employs already established TCP extensions. This paper presents preliminary evaluation results of the implementation in our testbed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. C. R. Bennett, C. Partridge, and N. Shectman. Packet reordering is not pathological network behavior, IEEE/ACM Transactions on Networking, 7(6):789–798, 1999.
Bhandarkar, A. L. N. Reddy, M. Allman, and E. Blanton. Improving the robustness of TCP to non-congestion events, RFC 4653, August 2006.
E. Blanton, M. Allman, K. Fall, and L. Wang, A conservative selective acknowledgment (SACK)-based loss recovery algorithm for TCP. RFC 3517, April 2003.
S. Bohacek, J. P. Hespanha, J. Lee, C. Lim, and K. Obraczka. TCP-PR: TCP for persistent packet reordering. In Proc. of the 23rd Int. Conf. on Distributed, Computing Systems (ICDCS’ 03), page 222, Washington, DC, USA, 2003. IEEE Computer Society.
Matthew Mathis and Jamshid Mahdavi. Forward acknowledgement: Refining TCP congestion control. In Proc. of the Special Interest Group on Data Communication (SIGCOMM’ 96), pages 281–291, 8 1996.
A. Morton, L. Ciavattone, G. Ramachandran, S. Shalunov, and J. Perser. Packet reordering metrics. RFC 4737, November 2006.
Nitin H. Vaidya, Milten N. Mehta, Charles E. Perkins, and Gabriel Montenegro. Delayed duplicate acknowledgements: a TCP-unaware approach to improve performance of TCP over wireless. Wireless Communications and Mobile Computing, 2(l): 59–70, 12 2001.
M. Zhang, B. Karp, S. Floyd, and L. Peterson. RR-TCP: A reordering-robust TCP with DSACK. In Proc. of the 11th IEEE Int. Conf. on Networking Protocols (ICNP’ 03), pages 95–106, 2003.
Alexander Zimmermann, Daniel Schaffrath, Martin Wenig, Arnd Hannemann, Mesut Güneş, and Sadeq Ali Makram. Performance evaluation of a hybrid testbed for wireless mesh networks. In Proc. of the 4th IEEE Int. Conf. on Mobile Ad-hoc and Sensor Systems (MASS’07). IEEE Computer Society Press, 2007.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hannemann, A., Zimmermann, A., Schulte, L. (2009). Improving TCP’s Robustness to Packet Reordering. In: David, K., Geihs, K. (eds) Kommunikation in Verteilten Systemen (KiVS). Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92666-5_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-92666-5_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92665-8
Online ISBN: 978-3-540-92666-5
eBook Packages: Computer Science and Engineering (German Language)