ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
On the correspondency between TCP acknowledgment packet and data packet
Full text PdfPdf (466 KB)
Source Internet Measurement Conference archive
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement table of contents
Miami Beach, FL, USA
SESSION: TCP table of contents
Pages: 259 - 272  
Year of Publication: 2003
ISBN:1-58113-773-7
Authors
Guohan Lu  Tsinghua University, P.R. China
Xing Li  Tsinghua University, P.R. China
Sponsors
SIGCOMM: ACM Special Interest Group on Data Communication
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 14,   Citation Count: 4
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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/948205.948239
What is a DOI?

ABSTRACT

At the TCP sender side, the arrival of an ack packet always triggers the sender to send data packets, which establishes a correspondency between the arrived ack packet and the sent data packets. In a TCP connection, the correspondency between every ack packet and its corresponding data packets forms a sequence. This sequence characterizes the sender's behavior. In this paper, we propose a method to estimate this correspondency sequence from the dump trace measured at the receiver side. Because many possible correspondency sequences can be constructed based on the trace, the problem here is an estimation problem, which is to select a most possible one from those candidate sequences. The method proposed first eliminates some candidates that violate basic TCP congestion behavior. Then, it chooses the most possible one among the remaining sequences using the statistical characteristics of delays between the acks and their corresponding data packets under maximum-likelihood criterion. The method can work in the condition when the TCP connection experiences various network delay and loss, and it applies to TCP senders of different versions. Simulations and Internet experiments have been performed to validate the method.


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
Allman, M., H. Balakrishnan, and S. Floyd, Enhancing TCP's Loss Recovery Using Limited Transmit. RFC3042, 2001.
 
2
Allman, M., S. Floyd, and C. Partridge, Increasing TCP's Initial Window. RFC2414, 1998.
 
3
Allman, M., V. Paxson, and W. Stevens, TCP Congestion Control. RFC2581, 1999.
4
 
5
Caceres, R., et al., Multicast-Based Inference of Network Internal Loss Characteristics. IEEE Trans. ON Information Theory, 1999. 45(7): p. 2462--2480.
 
6
Floyd, S. and T. Henderson, the Newreno Modification to TCP's Fast Recovery Algorithm. RFC2582, 1999.
7
 
8
Kleinrock, L., Queueing Systems. 1976: Wiley, NY.
 
9
 
10
Ljung, L. and T. Soderstrom, Theory and Practive of Recursive Identification. 1983: The MIT Press.
 
11
Mathis, M., et al., TCP Selective Acknowledgment Options. RFC2018, 1996.
12
13
 
14
 
15
Paxson, V. and M. Allman, Computing TCP's Retransmission Timer. RFC2988, 2000.
 
16
Proakis, J.G., Digital communications(Fourth Edition). 2001: McGraw-Hill Inc.
 
17
Raheli, R., A. Polydoros, and C.-K. Tzou, Per-Survivor Processing: A General Approach to MLSE in Uncertain Environments. IEEE Trans. ON COMMUNICATIONS, 1995. 43(2/3/4): p. 354--364.
 
18
Seshadri, N., Joint Data and Channel estimation Using Blind Trellis Search Techniques. IEEE Trans. ON COMMUNICATIONS, 1994. 42(2/3/4): p. 1000.
19