Browse > Article

A Simple Model for TCP Loss Recovery Performance over Wireless Networks  

Kim, Beomjoon (Standardiztion & System Research Group, Mobile Communication Technology Research Lab., LG Electronics Inc.)
Lee, Jaiyong (School of Electrical and Electronic Engineering, Yonsei University)
Publication Information
Abstract
There have been a lot of approaches to evaluate and predict transmission control protocol (TCP) performance in a numerical way. Especially, under the recent advance in wireless transmission technology, the issue of TCP performance over wireless links has come to surface. It is because TCP responds to all packet losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. By several previous works, although it has been already proved that overall TCP performance is largely dependent on its loss recovery performance, there have been few works to try to analyze TCP loss recovery performance with thoroughness. In this paper, therefore, we focus on analyzing TCP's loss recovery performance and have developed a simple model that facilitates to capture the TCP sender's behaviors during loss recovery period. Based on the developed model, we can derive the conditions that packet losses may be recovered without retransmission timeout (RTO). Especially, we have found that TCP Reno can retransmit three packet losses by fast retransmits in a specific situation. In addition, we have proved that successive three packet losses and more than four packet losses in a window always invoke RTO easily, which is not considered or approximated in the previous works. Through probabilistic works with the conditions derived, the loss recovery performance of TCP Reno can be quantified in terms of the number of packet losses in a window.
Keywords
Congestion control; fast retransmit probability; loss recovery; model validation and analysis; non-congestion packet loss; transmission control protocol (TCP);
Citations & Related Records

Times Cited By Web Of Science : 3  (Related Records In Web of Science)
Times Cited By SCOPUS : 8
연도 인용수 순위
1 W. Stevens, 'TCP slow start, congestion avoidance, fast retransmit, and fast recovery algorithms,' RFC 2001, 1997
2 C. Hoe, 'Improving the start-up behavior of a congestion control scheme for TCP,' in Proc. ACM SIGCOMM'96, 1996
3 M. Mathis et aI., 'TCP selective acknowledgement options,' RFC 2018, 1996
4 H. Balakrishnan et aI., 'A comparison of mechanisms for improving TCP performance over wireless links,' IEEE/ACM Trans. Networking, vol. 5, no. 6, pp. 756-769, 1997   DOI   ScienceOn
5 K. Fall and S. Floyd, 'Simulation based comparisons of Tahoe, Reno, and SACK TCP,' ACM Computer Communication Review, vol. 26, no. 3, pp. 5-21, 1996   DOI   ScienceOn
6 A. Kumar and J. Holtzman, 'Comparative performance analysis of versions of TCP in a local network with a mobile radio link,' available at http://ece.iics.ernet.in/ anrug/
7 J. Padhye et al., 'Modeling TCP Reno performance: A simple model and its empirical validation,' IEEE/ACM Trans. Networking, vol. 8, no. 2, pp. 133-145, 2000   DOI   ScienceOn
8 J. Postel, 'Transmission control protocol,' RFC 793, 1981
9 T. V. Lakshman and Madhow, 'The performance of TCP/IP for networks with high bandwidth delay products and random loss,' IEEE/ACM Trans. Networking, vol. 5, no. 3, pp. 336-350, 1997   DOI   ScienceOn
10 F. Anjum and L. Tassiulas, 'On the behavior of different TCP algorithms over a wireless channel with correlated packet losses,' in Proc. ACM SIGMETRICS'99, 1999, pp. 155-165
11 M. Zorzi and A. Chockalingam, 'Throughput analysis of TCP on channels with memory,' IEEE J. Select. Areas Commun., vol. 18, no. 7, pp. 1289-1300, 2000   DOI   ScienceOn
12 A. Kumar, 'Comparative performance analysis of versions of TCP in a local network with a lossy link,' IEEE/ACM Trans. Networking, vol. 6, no. 4, pp. 485-498, 1998   DOI   ScienceOn
13 P. P. Mishira, D. Sanghi, and S. K. Tripathi, 'TCP flow control in lossy networks: Analysis and enhancements,' in Proc. Computer Networks, Architecture, and Applications, IFIP Transactions C-13, S. V. Raghavan, G. V. Bochman, and G. Pujolle, Eds. Amsterdam, The Netherlands: Elsevier North-Holland, pp. 181-193, 1993
14 M. Allman, V. Paxson, and W. Stevens, 'TCP congestion control,' RFC 2581, 1999
15 A. Abouzeid, S. Roy, and M. Azizoglu, 'Stochastic modeling of TCP over lossy links,' in Proc. IEEE INFOCOM 2000, 2000, pp. 1724-1733
16 B. Kim and J. Lee, 'Analytic models of loss recovery of TCP Reno with packet losses,' Lecture Notes in Computer Science (LNCS), no. 2662, pp. 938-947, Oct. 2003
17 V. Jacobson, 'Modified TCP congestion avoidance algorithm,' message to end2end-interest mailing list, Apr. 1990, available at ftp://ftp.ee.lbl.gov/email/vanj.90apr30.txt
18 S. Floyd and T. Henderson, 'The NewReno modification to TCP's fast recovery algorithm,' RFC 2582, 1999
19 E. Blanton et al., 'A conservative selective acknowledgement (SACK) - based loss recovery algorithm for TCP,' RFC 3517, 2003
20 V. Jacobson, 'Congestion avoidance and control,' in Proc. ACM SIGCOMM'88, 1988, pp. 314-329
21 R. Braden, 'Requirements for Internet hosts,' RFC 1122, 1989
22 http://www.tta.or.kr/English/new/mainiindex.htm