CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Congestion Control in Real Time Applications

by S. Vishnu Vardhan, P. Chenna Reddy
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 51 - Number 3
Year of Publication: 2012
Authors: S. Vishnu Vardhan, P. Chenna Reddy
10.5120/8025-1176

S. Vishnu Vardhan, P. Chenna Reddy . Congestion Control in Real Time Applications. International Journal of Computer Applications. 51, 3 ( August 2012), 33-37. DOI=10.5120/8025-1176

@article{ 10.5120/8025-1176,
author = { S. Vishnu Vardhan, P. Chenna Reddy },
title = { Congestion Control in Real Time Applications },
journal = { International Journal of Computer Applications },
issue_date = { August 2012 },
volume = { 51 },
number = { 3 },
month = { August },
year = { 2012 },
issn = { 0975-8887 },
pages = { 33-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume51/number3/8025-1176/ },
doi = { 10.5120/8025-1176 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:49:28.467529+05:30
%A S. Vishnu Vardhan
%A P. Chenna Reddy
%T Congestion Control in Real Time Applications
%J International Journal of Computer Applications
%@ 0975-8887
%V 51
%N 3
%P 33-37
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The amount of traffic generated by RTAs has increased substantially over the years. RTA will face congestion where there is any form of bottleneck restricting traffic. This will result in packet loss or delayed traffic which is unacceptable for RTAs. Therefore it is desirable for RTAs to implement congestion control mechanism to improve the stability of networks. TCP Friendly Rate Control (TFRC) is a congestion control algorithm that provides a smooth transmission rate for RTAs. TFRC is a congestion control mechanism for unicast flows operating in a best effort internet environment. It is reasonably fair when competing for bandwidth with TCP flows in congested network, but has a much lower variation of throughput over time compared with TCP. In this work we use NS2, the network simulator for simulation of TFRC. TFRC is simulated in different environments, limitations are identified and modifications are proposed.

References
  1. M. Handley, S. Floyd, J. Padhye, J. Widmer, TCP Friendly Rate Control (TFRC): Protocol Specification, IETF RFC 3448, January 2003.
  2. M. Handley, S. Floyd, J. Padhye, J. Widmer,TCP-Friendly Rate Control (TFRC): Protocol Specification, IETF RFC 5348, April 2008.
  3. J. Postel, User Datagram Protocol, IETF RFC 768, August 1980.
  4. M. Allman, V. Paxson, W. Stevens TCP Congestion Control, IETF RFC5681, September 2009.
  5. S. Floyd, E. Kohler, J. Padhye, Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP-Friendly Rate Control (TFRC), IETF RFC 4342, March 2006.
  6. B. Zhou, C. Fu, V. Li, TFRC Veno: an Enhancement of TCP Friendly Rate Control over Wired/Wireless Networks, ICNP, October 2007, pp. 216–225.
  7. S. Floyd, M. Handley, E. Kohler, Problem Statement for the Datagram Congestion Control Protocol (DCCP), IETF RFC 4336, March 2006.
  8. S. Floyd, E. Kohler, Profile for DCCP Congestion Control ID 4: the Small-packet Variant of TFRC Congestion Control, IETF RFC 5622,August 2009.
  9. M. Chen, A. Zakhor, Rate control for streaming video over wireless, IEEE INFOCOM, Hong Kong, March 2004.
Index Terms

Computer Science
Information Sciences

Keywords

Congestion RTAs TFRC TCP VoIP Video Conference

Powered by PhDFocusTM