Loading…

Numerical Methods for the Resource Allocation Problem in a Computer Network

The resource allocation problem in computer networks with a large number of links is considered. The links are used by consumers (users), whose number can also be very large. For the dual problem, numerical optimization methods are proposed, such as the fast gradient method, the stochastic projected...

Full description

Saved in:
Bibliographic Details
Published in:Computational mathematics and mathematical physics 2021-02, Vol.61 (2), p.297-328
Main Authors: Vorontsova, E. A., Gasnikov, A. V., Dvurechensky, P. E., Ivanova, A. S., Pasechnyuk, D. A.
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The resource allocation problem in computer networks with a large number of links is considered. The links are used by consumers (users), whose number can also be very large. For the dual problem, numerical optimization methods are proposed, such as the fast gradient method, the stochastic projected subgradient method, the ellipsoid method, and the random gradient extrapolation method. A convergence rate estimate is obtained for each of the methods. Algorithms for distributed computation of steps in the considered methods as applied to computer networks are described. Special attention is given to the primal-dual property of the proposed algorithms.
ISSN:0965-5425
1555-6662
DOI:10.1134/S0965542521020135