The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Modeling TCP Loss Recovery for Random Packet Losses

임의 패킷 손실에 대한 TCP의 손실 복구 과정 모델링 및 분석

  • 김범준 (연세대학교 전기전자공학과 네트워크 연구실) ;
  • 김동연 (국립한경대학교 전자공학과) ;
  • 이재용 (연세대학교 전기전자공학과 네트워크 연구실)
  • Published : 2003.04.01
Download PDF
⟨ Previous Next ⟩

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.

TCP Reno 는 하나의 윈도우 내에서 다수 개의 패킷 손실이 발생하는 경우 손실된 패킷들을 효율적으로 복구하는 것이 불가능한 문제점을 가지과 있다. 이 문제점을 개선하기 위해서 설계된 TCP New-Reno 는 부분 스인 패킷(partial acknowledgement)를 통해 fast recovery를 연장함으로써 다수 개의 패킷 손실이 발생하더라도 이들을 재전송에 의해 복구하는 것이 가능하다. 그러나 TCP New-Reno 역시 재전송 패킷들이 다시 손질되는 경우 불가피한 RTO(Retransmission Timeout)가 발생한다는 문제점을 가지고 있다. 이런 문제점을 개선하기 위해서 중복 승인 패킷 수를 근거로 재전송 패킷 손실을 감지할 수 있는 DAC(Duplicate Acknowledgement Counting) 알고리듬을 제안한다. TCP Reno. TCP New-Reno 그리고 DAC를 사용하는 경우에 대해 손실 복구 과정을 정확하게 모델링하고 손실된 패킷이 복구되기 위한 조건들을 유도한다. 임의 패킷 손실 확률에 대한 손실 복구 확률을 수학적으로 계산하고 이를 통해 DAC가 TCP New-Reno 의 손실 복구 기능을 향상시킬 수 있다는 것을 보인다.

Keywords

References

  1. 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 https://doi.org/10.1109/90.650137
  2. V. Jacobson, 'Congestion Avoidance and Control,' in Proc. ACM SIGC0MM'88, Aug. 1988
  3. V. Jacobson, 'Modified TCP congestion avoi dance algorithm,' note sent to end2end-interest mailing list, 1990
  4. M. Mathis, S. Floyd, and A. Romanow, 'TCP Selective Acknowledgement Options,' Oct. 1996
  5. J. Hoe, 'Improving the Start-up Behavior of a Congestion Control Scheme for TCP,'. in Proc. ACM SIGC0MM'96, Aug. 1996
  6. 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 https://doi.org/10.1145/235160.235162
  7. W. Stevens, TCP/IP Illustrated, vol. 1 The Protocols, Reading, MA: Addison-Wesley, 1997
  8. W. Stevens, 'TCP slow start, congestion avoidance, fast retransmit, and fast recovery algohthms,' RFC2001, Jan. 1997
  9. M. Allman, V. Paxson, and W. Stevens, 'TCP Congestion Control,' RFC2581, Apr. 1999
  10. S. Floyd, J. Madavi, M. Mathis, and M. Podolsky, ' An Extention to the Selective Acknowledgement Option for TCP,' RFC2883, Jul. 2000
  11. 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
  12. 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 https://doi.org/10.1109/90.611099
  13. 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 https://doi.org/10.1109/90.720921
  14. 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/
  15. 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
  16. 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 https://doi.org/10.1109/90.842137
  17. 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 https://doi.org/10.1109/49.857929
  18. Alhussein A., Abouzeid, S. Roy, and M. Azizoglu, 'Stochastic Modeling of TCP over Lossy Links,' in Proc. IEEE Infocom'2000, pp. 1724-1733