Abstract
Packet reordering is a well-known phenomenon that the order of packets is inverted in the Internet. Previous studies indicates reordering can affect the performance of both the network and the packets receiver. Nevertheless, they get different results about the prevalence of reordering in the Internet. In this paper, we firstly present a methodology for single-point reordering measurement at a TCP receiver, including the algorithm and its implementation. Then we show the results of our three-week observation of reordering from a set of 10,647 Internet Web sites in China. In addition, we discuss a method to distinguish reordering and loss by making use of the distribution of their time lag and packet lag. Finally, we study the pertinence of sites experiencing reordering according to the network topology and propose a novel and relatively reliable approach to infer reorder-generating spots in the Internet.
This work is supported by Cisco University Research Program.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Paxon, V.: End-to-end Internet Packet Dynamics. IEEE/ACM Transactions on Networking 7(3), 277–292 (1999)
Jaiswal, S., Iannaccone, G., Diot, C., et al.: Measurement and Classification of Out-of-Sequence Packets in a Tier-1 IP Backbone. Sprint ATL Technical Report TR02-ATL-071121 (2002)
Bennett, J.C.R., Partridge, C., Shectman, N.: Packet Reordering is Not Pathological Network Behavior. IEEE/ACM Transaction on Networking 7(6), 789–798 (1999)
Bellardo, J., Savage, S.: Measuring Packet Reordering. Department of Computer Science and Engineering, University of California at San Diego (2002)
Liu, H.: A Trace Driven Study of Packet Level Parallelism. In: Proc. International Conference on Communications (ICC), New York, NY (2002)
Lu, G.H., Li, X.: On the Correspondency between TCP Acknowledgment Packet and Data Packet. In: Proc. Internet Measurement Conference (IMC), Miami Beach, FL, USA, pp. 285–294 (2003)
Iannaccone, J., Jaiswal, S., Diot, C.: Packet reordering inside the Sprint backbone. Sprint ATL Technical Report TR01-ATL-062917 (2001)
Floyd, S., Henderson, J.: The NewReno Modification to TCP’s Fast Recovery Algorithm. RFC 2582 (1999)
Floyd, S., Mahdavi, J., Mathis, M., et al.: An Extension to the Selective Acknowledgement (SACK) Option for TCP. RFC 2883 (2000)
Zhang, M., Karp, B., Floyd, S., Peterson, L.: Improving TCP’s Performance under Reordering with DSACK. Technical Report TR-02-006, International Computer Science Institute (2002)
Blanton, E., Allman, M.: On Making TCP More Robust to Packet Reordering. ACM Computer Communication Review 32(1) (2002)
Stevens, W.: TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms. RFC 2001 (1997)
McCreary, S., Claffy, K.: Trends in Wide Area IP Traffic Patterns: A View from Ames Internet Exchange, http://www.caida.org/outreach/papers/2000/AIX0005/
Laor, M., Gendel, L.: The Effect of Packet Reordering in a Backbone Link on Application Throughput. IEEE Network 16(5) (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Y., Lu, G., Li, X. (2004). A Study of Internet Packet Reordering. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-25978-7_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23034-2
Online ISBN: 978-3-540-25978-7
eBook Packages: Springer Book Archive