Browse > Article

Modeling TCP Loss Recovery for Random Packet Losses  

Kim, Beom-Joon (연세대학교 전기전자공학과 네트워크 연구실)
Kim, Dong-Yeon (국립한경대학교 전자공학과)
Lee, Jai-Yong (연세대학교 전기전자공학과 네트워크 연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.28, no.4B, 2003 , pp. 288-297 More about this Journal
Abstract
The fast retransmit and fast recovery algorithm of TCP Reno, when multiple packets in the same window are lost, cannot recover them without RTO (Retransmission Timeout). TCP New-Reno can recover multiple lost packets by extending fast recovery using partial acknowledgement. If the retransmitted packet is lost again during fast recovery, however, RTO cannot be avoided. In this paper, we propose an algorithm called "Duplicate Acknowledgement Counting(DAC)" to alleviate this problem. DAC can detect the retransmitted packet loss by counting duplicate ACKs. Conditions that a lost packet can be recovered by loss recovery of TCP Reno, TCP New-Reno and TCP New-Reno using DAC are derived by modeling loss recovery behavior of each TCP. We calculate the loss recovery probability for random packet loss probability numerically, and show that DAC can improve loss recovery behavior of TCP New-Reno.
Keywords
Dac;
Citations & Related Records
연도 인용수 순위
  • Reference
1 S. Floyd, J. Madavi, M. Mathis, and M. Podolsky, ' An Extention to the Selective Acknowledgement Option for TCP,' RFC2883, Jul. 2000
2 T. V. Lakshman and Upamanyu 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, Jun. 1997   DOI   ScienceOn
3 Anurag Kumar, 'Comparative Perfonnance Analysis of Versions of TCP in a Local Network with a Lossy Link,' IEEE/ACM Trans. Networking, vol. 6, no. 4, pp. 485-498, Aug. 1998   DOI   ScienceOn
4 W. Stevens, TCP/IP Illustrated, vol. 1 The Protocols, Reading, MA: Addison-Wesley, 1997
5 M. Allman, V. Paxson, and W. Stevens, 'TCP Congestion Control,' RFC2581, Apr. 1999
6 Michele Zorzi and A. Chockalingam, 'Throughput Analysis of TCP on Channels with Memory,' IEEE J.Select.Areas Convnun., vol. 18, no. 7, pp. 1289-1300, Jul. 2000   DOI   ScienceOn
7 V. Jacobson, 'Congestion Avoidance and Control,' in Proc. ACM SIGC0MM'88, Aug. 1988
8 J. Hoe, 'Improving the Start-up Behavior of a Congestion Control Scheme for TCP,'. in Proc. ACM SIGC0MM'96, Aug. 1996
9 J. Padhye, V. Firoiu, D. F. Towsley, and J. F. Kurose, 'Modeling TCP Reno Performance: A Simple Model and Its Empirical Validation,' IEEE/ACM Trans. Networking, vol.8, no.2, pp. 133-145, Apr. 2000   DOI   ScienceOn
10 P. P. Mishira, D. Sanghi, and S. K. Tiipathi, 'TCP flow control in lossy networks: Analysis and enhancements,' in Computer Networks, Architecture and Apptications, 1F1P Transactions C-13, S. V. Raghavan, G. V. Bochman, and G. PujoUe, Eds. Amsterdam, Usa Netherlands: Elsevier North-Holland, pp. 181-193, 1993
11 Anurag Kumar and Jack Holtzman, (Feb. 1998). Comparative Performance Analysis of Versions of TCP in a Local Netowork with a Mobile Radio Link [Online] httpy/ece.iisc.emet.in/-anurag/
12 Alhussein A., Abouzeid, S. Roy, and M. Azizoglu, 'Stochastic Modeling of TCP over Lossy Links,' in Proc. IEEE Infocom'2000, pp. 1724-1733
13 V. Jacobson, 'Modified TCP congestion avoi dance algorithm,' note sent to end2end-interest mailing list, 1990
14 K. Fall and S. Floyd, 'Simulation-based Comparisons of Tahoe, Reno, and SACK TCP, ' Computer Communication Review, pp. 5-21, vol. 26, no. 3, Jul. 1996   DOI   ScienceOn
15 H. Balakrishnan, V. N. Padmanabhan, S. Seshan, and R. H. Katz, 'A Comparison of Mechanisms for Improving TCP Performance over Wireless Links,' IEEE/ACM Trcms. Networking, vol. 5, no. 6, pp. 756-769, Dec. 1997   DOI   ScienceOn
16 Farooq Anjum and Leandros Tassiulas, 'On the Behavior of Different TCP Algorithms over a Wireless Channel with Correlated Packet Losses,' in Proc. ACM SIGMETRICS '99, pp 155-165, May 1999
17 M. Mathis, S. Floyd, and A. Romanow, 'TCP Selective Acknowledgement Options,' Oct. 1996
18 W. Stevens, 'TCP slow start, congestion avoidance, fast retransmit, and fast recovery algohthms,' RFC2001, Jan. 1997