ACM Home Page
Please provide us with feedback. Feedback
Measuring packet reordering
Full text PdfPdf (1.02 MB)
Source Internet Measurement Conference archive
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment table of contents
Marseille, France
SESSION: Session 4: traffic anomalies table of contents
Pages: 97 - 105  
Year of Publication: 2002
ISBN:1-58113-603-X
Authors
John Bellardo  University of California at San Diego
Stefan Savage  University of California at San Diego
Sponsor
SIGCOMM: ACM Special Interest Group on Data Communication
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 47,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/637201.637216
What is a DOI?

ABSTRACT

The Internet architecture provides an unsequenced datagram delivery service. Nevertheless, many higher-layer protocols, such as TCP, assume that packets are usually delivered in sequence, and consequently suffer significant degradation when packets are reordered in flight. While there have been several recent proposals to create protocols that adapt to reordering, evaluating their effectiveness requires understanding the dynamics of the reordering processes prevalent in the Internet. Unfortunately, Internet packet sequencing is a poorly characterized and understudied behavior. This failing can be largely attributed to the lack of accurate and universally applicable methods for measuring packet reordering. In this paper, we describe a new set of active measurement techniques that can reliably estimate one-way end-to-end reordering rates to and from arbitrary TCP-based servers. We validate these tools in a controlled setting and show how they can be used to measure the time-domain distribution of the reordering process along a given path.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
M. Allman, H. Balakrishnan, and S.Floyd. RFC 3042: Enhancing TCP's Loss Recovery Using Limited Transmit, January 2001.
 
2
3
 
4
V. Jacobson. RFC 1144: Compressing TCP/IP Headers for Low-Speed Serial Links, February 1990.
 
5
Raj Jain. The Art of Computer Systems Performance Analysis. John Wiley & Sons, 1991.
 
6
M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. RFC 2018: TCP Selective Acknowledgement Options. RFC2018, October 1996.
 
7
 
8
A. Morton, L. Ciavattone, and G. Ramachandran. Internet Draft: Reordering Metrics for IPPM using Non-Reversing Sequence. draft-morton-ippm-nonrev-reordering-00.txt, February 2002.
9
 
10
11
 
12
S. Savage. Sting: A TCP-based Network Measurement Tool. In USENIX Symposium on lnternet Technologies and Systems, pages 71--79, Boulder, CO, October 1999.
 
13
W. Simpson. RFC 1661: The Point-to-Point Protocol (PPP), July 1994.
 
14
W. Stevens. RFC 2001: TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms, January 1997.
15
 
16
 
17
W. Townsley, A. Valencia, A. Rubens, G. Pall, G. Zorn, and B. Palter. RFC 2661: Layer Two Tunneling Protocol, August 1994.
 
18
G. Xylomenos and C. Polyzos. TCP Performance Issues over Wireless Links. IEEE Communications Magazine, 39(4):52--58, April 2001.
 
19
Yahoo! Inc. Random Yahoo! Link. http://random.yahoo.com/bin/ryl.
 
20
M. Zhang, B. Karp, S. Floyd, and L. Peterson. Improving TCP's Performance under Reordering with DSACK. Technical Report TR-02-006, International Computer Science Institute, July 2002.

CITED BY  15
 
 
 
 
 
 
 

Collaborative Colleagues:
John Bellardo: colleagues
Stefan Savage: colleagues

Peer to Peer - Readers of this Article have also read: