Papers › Network utility maximization by updating individual transmission rates
Network utility maximization by updating individual transmission rates
Dmitry Pasechnyuk
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper discusses the problem of maximizing the total data transmission utility of the computer network. The total utility is defined as the sum of the individual (corresponding to each node in the network) utilities that are concave functions of the data transmission rate. For the case of non-strongly concave utilities, we propose an approach based on the use of a fast gradient method to optimize a dually smoothed objective function. As an alternative approach, we introduce stochastic oracles for the problem under consideration and interpret them as the messages on the state of some individual node to use randomized switching mirror descent to solve the problem above. We propose interpretations of both described approaches allowing the effective implementation of the protocols of their operation in the real-life computer networks environment, taking into account the distributed information storage and the restricted communication capabilities. The numerical experiments were carried out to compare the proposed approaches on sythetic examples of network architectures.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections