Browse > Article

Enhancing TCP Performance to Persistent Packet Reordering  

Leung Ka-Cheong
Ma Changming
Publication Information
Journal of Communications and Networks / v.7, no.3, 2005 , pp. 385-393 More about this Journal
Abstract
In this paper, we propose a simple algorithm to adaptively adjust the value of dupthresh, the duplicate acknowledgement threshold that triggers the transmission control protocol (TCP) fast retransmission algorithm, to improve the TCP performance in a network environment with persistent packet reordering. Our algorithm uses an exponentially weighted moving average (EWMA) and the mean deviation of the lengths of the reordering events reported by a TCP receiver with the duplicate selective acknowledgement (DSACK) extension to estimate the value of dupthresh. We also apply an adaptive upper bound on dupthresh to avoid the retransmission timeout events. In addition, our algorithm includes a mechanism to exponentially reduce dupthresh when the retransmission timer expires. With these mechanisms, our algorithm is capable of converging to and staying at a near-optimal interval of dupthresh. The simulation results show that our algorithm improves the protocol performance significantly with minimal overheads, achieving a greater throughput and fewer false fast retransmissions.
Keywords
Computer communications; congestion control; dis­persity routing; high-speed networks; multipath routing; transmis­sion control protocol (TCP);
Citations & Related Records
Times Cited By KSCI : 2  (Citation Analysis)
Times Cited By Web Of Science : 3  (Related Records In Web of Science)
Times Cited By SCOPUS : 2
연도 인용수 순위
1 N. F. Maxemchuk, 'Dispersity routing in high-speed networks,' Computer Networks ISDN Syst., vol. 25, no. 6, pp. 645-661, Jan. 1993   DOI   ScienceOn
2 P. P. Pham and S. Perreau, 'Performance analysis of reactive shortest path and multi-path routing mechanism with load nalance,' in Proc. IEEE INFOCOM 2003, San Francisco, CA, USA, vol. 1, 30 Mar.-3 Apr. 2003, pp.251-259
3 R. Ludwig and R. H. Katz, 'The Eifel algorithm: Making TCP robust against spurious retransmissions,' Computer Commun. Rev., vol. 30, no. 1, pp. 30-36, Jan. 2000
4 K.-C. Leung and V. O. K. Li, 'Flow assignment and packet scheduling for multipath routing,' J. Commun. Networks, vol. 5, no. 3, pp. 230-239, Sept. 2003   DOI
5 K.-C. Leung and V. O. K. Li, 'Generalized load sharing for packet-switching networks II: Flow-based algorithms,' IEEE Trans. Parallel Dist. Syst., to be published
6 K.-C. Leung and V. O. K. Li, 'Generalized load sharing for packet-switching networks I: Theory and packet-based algorithm,' IEEE Trans. Parallel Dist. Syst., to be published
7 S. Floyd, J. Mahdavi, M. Mathis, and M. Podolsky, 'An extension to the selective acknowledgement (SACK) option for TCP,' RFC 2883, Network Working Group, Internet Engineering Task Force, July 2000
8 Y. Lee, J. Park, and Y. Choi, 'Improving TCP performance in multipath packet forwarding networks,' J. Commun. Networks, vol. 4, no. 2, pp. 148-157, June 2002   DOI
9 L. Kleinrock, Queueing Systems (Volume I: Theory), John Wiley & Sons, 1975
10 M. Zhang, B. Karp, S. Floyd, and L. Peterson, 'RR-TCP: A reordering-robust TCP with DSACK,' in Proc. IEEE ICNP 2003, Atlanta, GA, USA, 4-7 Nov. 2003, pp. 95-106   DOI
11 V. Paxson, 'End-to-end Internet packet dynamics,' IEEE/ACM Trans. Networking, vol. 7, no. 3, pp. 277-292, June 1999   DOI   ScienceOn
12 D. G. Luenberger, Introduction to Dynamic Systems: Theory, Models, and Applications. John Wiley & Sons, New York, 1979
13 J. Bennett, C. Partridge, and N. Shectman, 'Packet reordering is not pathological network behavior,' IEEE/ACM Trans. Networking, vol. 7, no. 6, pp. 789-798, Dec. 1999   DOI   ScienceOn
14 M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, 'TCP selective acknowledgment options,' RFC 2018, Network Working Group, Internet Engineering Task Force, Oct. 1996
15 V. Jacobson, 'Modified TCP congestion avoidance algorithm,' end2end-interest mailing list, 30 Apr. 1990
16 S. Bohacek, J. P. Hespanha, J. Lee, C. Lim, and K. Obraczka, 'TCP-PR: TCP for persistent packet reordering,' in Proc. IEEE ICDCS 2003, Providence, RI, USA, 19-22 May 2003, pp. 222-231   DOI
17 S.-J. Lee and M. Gerla, 'AODV-BR: Backup routing in ad hoc networks,' in Proc. IEEE WCNC 2000, Chicago, IL, USA, vol. 3, 26-29 Sept. 2000, pp.1311-1316   DOI
18 V. Jacobson, 'Congestion avoidance and control,' Computer Commun. Rev., vol. 18, no. 4, pp. 314-329, Aug. 1988   DOI
19 W. Theilmann and K Rothermel, 'Dynamic distance maps of the Internet,' in Proc. IEEE INFOCOM 2000, vol. 1, Tel Aviv, Israel, 26-30 Mar. 2000, pp. 275-284   DOI
20 R. V. Hogg and E. A. Tanis, Probability and Statistical Inference, 5th ed, Prentice Hall, 1996
21 M. Allman, V. Paxson, and W. Stevens, 'TCP congestion control,' RFC 2581, Network Working Group, Internet Engineering Task Force, Apr. 1999
22 S. Floyd and K. Fall, 'Promoting the use of end-to-end congestion control in the Internet,' IEEE/ACM Trans. Networking, vol. 7, no. 4, pp. 458-472, Aug. 1999   DOI   ScienceOn
23 E. Blanton and M. Allman, 'On making TCP more robust to packet reordering,' Computer Commun. Rev., vol. 32, no. 1, pp. 20-30, Jan. 2002