Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Stefan Holmer

dblp:141/9808 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorComputer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Transport protocols and congestion control · 88% Datacenter networks · 12%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › real-time communication
congestion control for real-time media
0.312017
Congestion Control for Web Real-Time Communication · IEEE/ACM Trans. Netw. 2017
Transport protocols and congestion control
delay-based congestion control
0.312017
Congestion Control for Web Real-Time Communication · IEEE/ACM Trans. Netw. 2017
Datacenter networks › low-latency networking
queueing delay minimization
0.112017
Congestion Control for Web Real-Time Communication · IEEE/ACM Trans. Netw. 2017
Transport protocols and congestion control › real-time communication
WebRTC
0.112017
Congestion Control for Web Real-Time Communication · IEEE/ACM Trans. Netw. 2017

Methods — techniques the papers use, named apart from their topics

loss-based control · 0.3kalman filter · 0.3
YearPublicationVenuePosition
2017 Congestion Control for Web Real-Time Communication
abstract
Applications 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.
Gaetano Carlucci, Luca De Cicco, Stefan Holmer, Saverio Mascolo
IEEE/ACM Trans. Netw.3
2016 Analysis and design of the google congestion control for web real-time communication (WebRTC)
abstract
Video conferencing applications require low latency and high bandwidth. Standard TCP is not suitable for video conferencing since its reliability and in order delivery mechanisms induce large latency. Recently the idea of using the delay gradient to infer congestion is appearing again and is gaining momentum. In this paper we present an algorithm that is based on estimating through 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 to an adaptive threshold to dynamically throttle the sending rate. The control algorithm has been implemented over the RTP/RTCP protocol and is currently used in Google Hangouts and in the Chrome WebRTC stack. Experiments have been carried out to evaluate the algorithm performance in the case of variable link capacity, presence of heterogeneous or homogeneous concurrent traffic, and backward path traffic.
Gaetano Carlucci, Luca De Cicco, Stefan Holmer, Saverio Mascolo
MMSys3
2013 Handling packet loss in WebRTC
abstract
WebRTC is an open-source real-time interactive audio and video communication framework. This paper discusses some of the mechanisms utilized in WebRTC to handle packet losses in the video communication path. Various system details are discussed and an adaptive hybrid NACK/FEC method with temporal layers is presented. Results are shown to quantify how the method controls the quality trade-offs for real-time video communication.
Stefan Holmer, Mikhal Shemer, Marco Paniconi
ICIP1