TCP Friendly Rate Control for Real-Time Traffic in Wired Environment

Balakoteswara*, Shoba Bindu C**
* M.Tech Student, Computer Science and Engineering Department, JNTUA College of Engineering, Anantapuramu, Andhra Pradesh, India.
** Associate Professor, Computer Science and Engineering Department, JNTUA College of Engineering, Anantapuramu, Andhra Pradesh, India.
Periodicity:September - November'2014
DOI : https://doi.org/10.26634/jcom.2.3.3310

Abstract

The authors are in search of a reliable, congestion control, real-time media traffic supportable protocol which is not yet available. Previously, for this purpose the authors were taking help of Transmission Control Protocol (TCP) and User Datagram Protocol (UDP). TCP is a reliable, congestion control protocol which works fine for low bandwidth scenarios and UDP is an unreliable protocol but works fine in high bandwidth scenarios. A protocol that opts in both situations high and low bandwidth scenarios is required. One such a protocol TCP Friendly Rate Control (TFRC) is designed by Internet Engineering Task Force People (IETF) and it is a reliable, congestion control protocol. TFRC is a rate based approach and well suitable for real-time video traffic because of smooth sending rate and friendliness with TCP flows achieved in it. This paper shows the complete study of TFRC, and performance of TFRC is compared with TCP flows such as TCP SACK, TCP Vegas, TCP Reno, and TCP Tahoe and also with UDP in wired environment.

Keywords

TCP Friendly, Congestion Control, Media Traffic, TFRC, NS-2.

How to Cite this Article?

Balakoteswara, P., and Bindu, C.S. (2014). TCP Friendly Rate Control for Real-Time Traffic In Wired Environment. i-manager’s Journal on Computer Science, 2(3), 1-5. https://doi.org/10.26634/jcom.2.3.3310

References

[1]. K. Satyanarayan Reddy and Lokanatha C. Reddy, (2008). “A survey on congestion control mechanisms in high speed networks,” International Journal of Computer Science and Network Security [IJCSNS], Vol.8(1), pp.187 – 195.
[2]. J. Postel, (1981). "Transmission Control Protocol - RFC- 793,” Information Sciences Institute University of Southern California.
[3]. Roman Dunaytsev, Dmitri Moltchanov, Yevgeni Koucheryavy, and Jarmo Harju, (2011). “Modeling tcpsack performance over wireless channels with completely reliablearq/fec,” International Journal of Communication Systems, Vol.24(12), pp.1533-1564.
[4]. Mao Kai, (2013). “A logarithmic slow-start algorithm of tcp-vegas in ip networks,” Applied Mathematics and Information Sciences, Vol.7(2), pp. 599-605.
[5]. M. Nirmala, R.V. Pujeri, (2012). “Performance to tcpvegas, bic, and reno congestion control algorithms on iridium satellite constellations,” International Journal of Computer Network and Information Security, Vol.4(12), pp.40-49.
[6]. Teamour Esmaili, A. N. rad, and Ghazal Lak, (2012). “Effect of multiple fast-retransmission of tcptahoe in decagon noc,” Journal of Computing, Vol.4(6), pp.206- 209.
[7]. J. Postel, (1980). "User Datagram Protocol - RFC 768”, Industrial Communication Systems, Vol.59, pp.1-11.
[8]. Handley, Floyd, Widmer and Padhye, (2008). “TCPFriendly Rate Control (TFRC): Protocol Specification - IETF RFC 5348”, Standards Track, pp.1-58.
[9]. The VINT Project, “The ns Manual (formerly ns notes and documentation)”, http://www.isi.edu/nsnam/ns/nsddocumentation. html, November 2011.
[10]. Soo-Hyun Choi, (2010). “Congestion Control for Real-time Interactive Multimedia Streams,” Ph. D. Thesis, University College London, Computer Science Department, pp.1-131.
[11]. Agnieszka Chodorek and Robert R. Chodorek, (2010). “Streaming Video over TFRC with Linear Throughput Equation,” Advances in Electronics and Telecommunications, Vol.1(2), pp.26-29.
[12]. Lisong Xu and Josh Helzer, (2007). “Media Streaming via TFRC: an Analytical Study of the Impact of TFRC on User-perceived Media Quality,” Computer Networks, Vol. 51(17), pp.4744-4764.
[13]. S. Tsao, Y. Lai, and Y. Lin, (2007). “Taxonomy and Evaluation of TCP-Friendly Congestion Control Schemes on Fairness, Aggressiveness, and Responsiveness.” IEEE Network, Vol.21(6), pp.6-15.
[14]. S. Floyd, M. Handley, J. Padhye, and J. Widmer, (2000). “Equation-based congestion control for unicast applications,” In Proc. ACM SIGCOMM, Stockholm, Sweden, pp. 43 – 56.
[15]. University of California Berkeley, “The Network Simulator - NS-2,” [Online] http://www.isi.edu/nsnam/ns.
[16]. Y. Yang and S. Lam, (2000). “General AIMD Congestion Control,” Proc. IEEE ICNP2000, pp. 187–98.
[17]. B. Braden, D. Clark, and J. Crowcroft, (1998). “Recommendations on Queue Managementand Congestion Avoidance in the Internet - RFC 2309,” http://www.ietf.org
[18]. D. Bansal et al., (2001). “Dynamic Behavior of Slowly- Responsive Congestion Control Algorithms,” Proc. ACM SIGCOMM '01, pp. 263–74.
[19]. A. Lahanas and V. Tsaoussidis, (2003). “Exploiting the Efficiency and Fairness Potential of AIMD-based Congestion Avoidance and Control,” Computer Networks, Vol. 43(2), pp. 227–45.
[20]. J. Widmer, R. Denda, and M. Mauve, (2001). “A Survey on TCP-friendly Congestion Control,” Special issue of the IEEE Network Control of Best Effort Traffic, Vol.15(3), pp. 28–37.
[21]. G. Jourjon, E. Lochin, and L. Dairaine, (2007). “ Optimization of tfrc loss histor y initialization,” Communications Letters, IEEE, Vol. 11(3), pp. 276– 278.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.