3 citations · 4 across the 5 of their papers we have counts for
Showing cs.NIShow all
2 papers · 1 filter
cs.NI2024
Throughput-Optimal Scheduling via Rate Learning
Panagiotis Promponas, Víctor Valls, Konstantinos Nikolakakis +2
We study the problem of designing scheduling policies for communication networks. This problem is often addressed with max-weight-type approaches since they are throughput-optimal.…
cs.NI2022★ 1 cited
A Quantitative Theory of Bottleneck Structures for Data Networks
Jordi Ros-Giralt, Noah Amsel, Sruthi Yellamraju +5
The conventional view of the congestion control problem in data networks is based on the principle that a flow's performance is uniquely determined by the state of its bottleneck l…