ARC: The Analytical Rate Control Scheme for Real-Time Traffic in Wireless Networks (original) (raw)
Related papers
Application-Specific Rate Control for Realtime Streaming Services in Wireless Networks
In wireless networks, packet loss may be due either to congestion or to channel error. Thus, it is necessary to differentiate between packet loss due to wireless channel errors and that due to congestion. To apply this concept to real-time applications, we consider a rate control method without retransmission for UDP traffic. For implementation of rate control, we utilize a rate control module at the application layer and use NS-2 to determine the performance of adaptive rate control. The results show that the adaptive rate control scheme has a higher throughput than that of the rate control scheme without loss classification. Also, packet loss with adaptive rate control is approximately the same as with rate control without loss classification.
RATE CONTROL OF REALTIME STREAMING APPLICATIONS IN WIRELESS NETWORKS
IAEME PUBLICATION, 2021
In wireless networks, packet loss may be due either to congestion or to channel error. Thus, it is necessary to differentiate between packet loss due to wireless channel errors and that due to congestion. To apply this concept to real-time applications, we consider a rate control method without retransmission for UDP traffic. For implementation of rate control, we utilize a rate control module at the application layer and use NS-2 to determine the performance of adaptive rate control. The results show that the adaptive rate control scheme has a higher throughput than that of the rate control scheme without loss classification. Also, packet loss with adaptive rate control is approximately the same as with rate control without loss classification.
TCP-friendly congestion control for streaming real-time applications over wireless networks
IET Communications, 2008
Congestion control for streaming real-time applications, which need smoothness of the transmission rate, should be transmission control protocol (TCP)-friendly. Moreover, in wireless networks, TCP-friendly congestion control should be based on differentiation of packet losses due to congestion and wireless link error to improve network utilisation. The authors propose a TCP-friendly congestion control algorithm based on explicit congestion notification over the wireless networks. The simulation results show that the proposed algorithm utilises the link bandwidth efficiently, providing smoothness of the transmission rate.
IEEE/ACM Transactions on Networking, 2005
Currently there is no control for real-time traffic sources in IP networks. This is a serious problem because real-time traffic can not only congest the network but can also cause unfairness and starvation of TCP traffic. However, it is not possible to apply current solutions for Internet to the networks with high bandwidth-delay products and high bit error rates. The channel errors may result in inaccurate congestion control decisions and unnecessary rate throttles leading to severe performance degradation. This problem is amplified in the links with high bandwidth-delay products, since the link is inefficiently utilized for a very long time until the unnecessary rate throttle is recovered. In this paper, a new Rate Control Scheme, RCS, is introduced for real-time interactive applications in networks with high bandwidth-delay products and high bit error rates. RCS is based on the concept of using dummy packets to probe the availability of network resources. Dummy packets are treated as low priority packets and consequently they do not affect the throughput of actual data traffic. Therefore, RCS requires all the routers in the connection path to support some priority policy. A new algorithm is also proposed to improve the robustness of the RCS to temporal signal loss conditions. The delay-bound considerations for real-time traffic sources using RCS rate control scheme are also investigated. Simulation experiments show that in environments with high bandwidth-delay products and high bit error rates, RCS achieves high throughput performance without penalizing TCP connections. Index Terms-Flow control, high bandwidth-delay products, high bit error rates, real-time protocols.
An Efficient Congestion Control Protocol for Wired/Wireless Networks
Recently, wide spectrum of heterogeneous wireless access networks integrate with high speed wired networks to deliver Internet services. End-to-end service delivery with satisfactory quality is challenging issue in such network architectures. Although the Internet transport control protocol (TCP) addresses such challenge, it has poor performance with high speed wired networks (i.e. high bandwidth-delay product). Moreover, it behaves badly with wireless access networks (i.e. misinterpretation of packet loss occurrence that could be interpreted in wrong way as network congestion). Thus, adapting TCP in terns of accurate interpretation of network status has drawn a significant attention. This paper addresses the problem of adapting congestion window size as an interpretation of frequent fluctuations of network load. The work in this paper proposes congestion window size (cwnd) adjustment in terms of instantaneous network load (i.e. bandwidth estimation). The aims are to improve End-to-End TCP throughput as well as maximum resource utilization. With different scenarios, NS-2 simulator has been adopted to evaluate proposed TCP protocol. Notable improvement has been demonstrated by comparing proposed protocol to TCP NewReno benchmark and TCP Vegas.
Rate-based end-to-end congestion control of multimedia traffic in packet switched networks
Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing, 2003
This paper proposes an explicit rate-based end-to-end congestion control mechanism to alleviate congestion of multimedia traffic in packet switched networks such as the Internet. The congestion is controlled by adjusting the transmission rates of the sources in response to the feedback information from destination such as the buffer occupancy, packet arrival rate and service rate at the outgoing link, so that a desired quality of service (QoS) can be met. The QoS is defined in terms of packet loss ratio, transmission delay, power, and network utilization. Comparison studies demonstrate the effectiveness of the proposed scheme over New-Reno TCP (a variant of AIMD: additive increase multiplicative decrease) technique during simulated congestion. Since it is end-toend, no router support is necessary, the proposed methodology can be readily applied to today's Internet, as well as for real-time video and voice data transfer in unicast networks.
Rate control for streaming video over wireless
… Twenty-third AnnualJoint Conference of the …, 2004
Rate control is an important issue in video streaming applications for both wired and wireless networks. A widely accepted rate control method in wired networks is equation based rate control [1], in which the TCP Friendly rate is determined as a function of packet loss rate, round trip time and packet size. This approach, also known as TFRC, assumes that packet loss in wired networks is primarily due to congestion, and as such is not applicable to wireless networks in which the bulk of packet loss is due to error at the physical layer. In this paper, we propose multiple TFRC connections as an end-to-end rate control solution for wireless video streaming. We show that this approach not only avoids modifications to the network infrastructure or network protocol, but also results in full utilization of the wireless channel. NS-2 simulations and experiments over 1xRTT CDMA wireless data network are carried out to validate, and characterize the performance of our proposed approach.
Analysis of Rate Based Congestion Control Algorithms in Wireless Technologies
IOSR Journal of Computer Engineering, 2013
In this paper, the congestion control algorithms in wireless technolologies are analysed. It has been found that TCP VEGAS is better than other TCP variants for sending data and information due to better delivery fraction and average end to end delay. But it has a consistent window size for packet transmission. Congestion Avoidance can resolve Congestion effectively and has higher average throughput than slow start due to the ability to deal with random loss. Cross layer Congestion Control require significant power and memory corresponding to network bandwidth. So to overcome all these problems, here we analyse the performance of AIMD, TFRC and TCP congestion control protocol. After observing simulation results, it is found that GAIMD is better than TFRC in terms of throughput and TFRC is better than GAIMD in terms of smoothness.