Ensuring Low Latency When Number of Flows Increases over Bottleneck Link

In this paper, we propose and evaluate a new congestion control algorithm, Multiplicity-Robust Congestion Control (MRCC), that predicts the buffering delay based on queueing theory. MRCC alleviates the increase in buffering delay when multiple flows share a bottleneck link.

Authors

Institutions

Publication Details

Published
2025-09-08
DOI
https://doi.org/10.1145/3744969.3748392
Primary Topic
Cloud Computing and Resource Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Ensuring Low Latency When Number of Flows Increases over Bottleneck Link

Satoshi Utsumi, Salahuddin Muhammad Salim Zabir, Go Hasegawa, K. Kano
Cloud Computing and Resource Management
article

Ensuring Low Latency When Number of Flows Increases over Bottleneck Link

Satoshi Utsumi, Salahuddin Muhammad Salim Zabir, Go Hasegawa, K. Kano
article en

Abstract

In this paper, we propose and evaluate a new congestion control algorithm, Multiplicity-Robust Congestion Control (MRCC), that predicts the buffering delay based on queueing theory. MRCC alleviates the increase in buffering delay when multiple flows share a bottleneck link.

Tohoku University (JP), Fukushima University (JP)
Openalex Percentile: Top 64%
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.