We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

Dynamically Avoiding the Substantial Throughput Penalty of FRR

by Ramesh K, Zameer Ahmed
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 51 - Number 9
Year of Publication: 2012
Authors: Ramesh K, Zameer Ahmed
10.5120/8070-1464

Ramesh K, Zameer Ahmed . Dynamically Avoiding the Substantial Throughput Penalty of FRR. International Journal of Computer Applications. 51, 9 ( August 2012), 25-28. DOI=10.5120/8070-1464

@article{ 10.5120/8070-1464,
author = { Ramesh K, Zameer Ahmed },
title = { Dynamically Avoiding the Substantial Throughput Penalty of FRR },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 51 },
number = { 9 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 25-28 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume51/number9/8070-1464/ },
doi = { 10.5120/8070-1464 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:49:57.310028+05:30
%A Ramesh K
%A Zameer Ahmed
%T Dynamically Avoiding the Substantial Throughput Penalty of FRR
%J International Journal of Computer Applications
%@ 0975-8887
%V 51
%N 9
%P 25-28
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Disclosed is a system for dynamically suppressing Fast Retransmission and Recovery (FRR) on high-latency Transport Control Protocol (TCP) connections with low ongoing packet loss. This system measures the relative rate of recent packet loss and adjusts the suppression of FRR based on the measured rate. Provided that the rate of actual packet loss is low, high-latency TCP connections can benefit significantly from suppressing FRR.

References
  1. "Results on High Throughput and Quos Between the US and CERN. " HENP Special Interest Group. Retrieved September 4, 2007, from http://henp. internet2. edu/Ravot. ppt.
  2. Mascolo, Saverio et. al. "TCP WESTWOOD Home Page. " UCLA Computer Science Department. Retrieved September 4, 2007, from http://www. cs. ucla. edu/NRL/hpi/tcpw/.
  3. W. Richard Stevens. TCP/IP Illustrated, Volume 1: The Protocols. Addison-Wesley, 1994
  4. Van Jacobson. Congestion Avoidance and Control. In proceedings of ACM SIGCOMM, 1988.
  5. V. Jacobson, Modified TCP Congestion Avoidance Algorithm, end2end internet mailing list.
  6. W. Stevens, "TCP Slow Start, Congestion Avoidance Algorithm, Fast Retransmit and Fast Recovery Algorithms", RFC 2001. Jan 1997.
  7. M. Allman, V. Paxson, W. Stevens, " TCP Congestion Control", RFC 2581, Apr. 1999
  8. W. Leland, M. Taqqu, W. Willinger, and D. Wilson, "On the Self-Similar Nature of Ethernet Traffic (Extended Version), IEEE/ACM Transactions on Networking, Vol 2, Feb. 1994
  9. B. Davie, S. Deering, D. Estrin, S. Floyd, V. Jacobson, G. Minshall, C. Partridge, L. Peterson, K. Ramakrishnan, S. Shenkar, J. Wroc lawski, L. Zhang, "Recommendations on Queue Management and Congestion Avoidance in the internet", RFC 2309, April. 1998.
  10. Sally Floyd and Van Jacobson, Random Early Detection Gateways for congestion Avoidance", IEEE/ACM Transaction on Networking, Aug. 1993.
  11. Eman Hashem. Analysis of random gateway congestion control. Master's thesis, Massauchusetts Institute of Technology, 1989. MTL/LCS/TR-465.
  12. Scott Shankar, Lixia Zhang and David Clark. Some observations on the dynamics of a congestion control algorithm. In proceedings of a ACM SIGCOMM, 1990.
  13. Sally Floyd and Van Jacobson. On traffic phase effects in packet-switched gateways. Internetworking: Research and Experience, 3(3), September 1992.
  14. Allison Mankin. Random drop congestion control. In proceedings of ACM SIGCOMM, 1990.
  15. John Nagle, RFC 896 : Congestion control in IP/TCP internetworks. Technical Report, internet Assigned numbers Authority, Jon Postel, USC/ISI, 4676 Admoralty Way, Marina Del Rey, DA 90292, 1984. http://info. internet. isi. edu/in-notes/rfc/files/rfc896. txt.
  16. Raj Jain. A timesout-based congestion control scheme for window flow-controlled networks. IEEE Journal on Selected Areas in Communications, SAC-4(7):1162-1167, October 1986.
  17. Phil Karn and Craig Partridge. Improving round-trip time estimates in reliable transport protocols. In proceedings of ACM SIGCOMM, 1993.
  18. Mark Handley. An examination of mbone performance. Technical report, University of southern California Information sciences Institute, 1997. ISI/RR-97-450.
Index Terms

Computer Science
Information Sciences

Keywords

Latency Bandwidth Throughput Round-Trip Latency TCP FRR SACK

Powered by PhDFocusTM