Abstract

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.

中文翻译：

---

计算机网络中资源分配问题的数值方法

摘要

考虑了具有大量链接的计算机网络中的资源分配问题。链接由使用者（用户）使用，使用者的数量也可能非常大。针对对偶问题，提出了数值优化方法，如快速梯度法，随机投影次梯度法，椭球法和随机梯度外推法。获得每种方法的收敛速率估计。描述了用于所考虑的方法中的步骤的分布式计算的算法，该算法应用于计算机网络。特别注意了所提出算法的原始对偶性质。