Applications 1 requiring real-time communication (RTC) between Internet peers are ever increasing. RTC requires not only congestion control but also minimization of queuing delays to provide interactivity. It is known that the well-established transmission control protocol congestion control is not suitable for RTC due to its retransmissions and in-order delivery mechanisms, which induce significant latency. In this paper, we propose a novel congestion control algorithm for RTC, which is based on the main idea of estimating—using a Kalman Filter—the end-to-end one-way delay variation which is experienced by packets traveling from a sender to a destination. This estimate is compared with a dynamic threshold and drives the dynamics of a controller located at the receiver, which aims at maintaining queuing delays low, while a loss-based controller located at the sender acts when losses are detected. The proposed congestion control algorithm has been adopted by Google Chrome. Extensive experimental evaluations have shown that the algorithm contains queuing delays while providing intra and inter protocol fairness along with full link utilization.
Congestion Control for Web Real-Time Communication
2017-01-01
Article (Journal)
Electronic Resource
English
DDC: | 629 |
ReCoCo: Reinforcement learning-based Congestion control for Real-time applications
BASE | 2023
|Real Time Driver Information for Congestion Management
NTIS | 2015
|Real-time congestion pricing strategies for toll facilities
Online Contents | 2015
|