Decomposition method for zonal resource allocation problems in telecommunication networks

11th International Conference on "Mesh methods for boundary-value problems and applications"

Konnov, I.V.^1 ; Kashuba, A.Yu.^2

Department of System Analysis and Information Technologies, Kazan Federal University, Kazan

420008, Russia^1

LLC AST Povolzhye, Kazan

420029, Russia^2

关键词: Computational experiment;    Convex quadratic optimization problem;    Decomposition methods;    Optimal resource allocation;    Optimization formulations;    Optimization problems;    Resource allocation problem;    Wireless communication network;   

Others  :  https://iopscience.iop.org/article/10.1088/1757-899X/158/1/012054/pdf
DOI  :  10.1088/1757-899X/158/1/012054

来源: IOP

【 摘 要 】

We consider problems of optimal resource allocation in telecommunication networks. We first give an optimization formulation for the case where the network manager aims to distribute some homogeneous resource (bandwidth) among users of one region with quadratic charge and fee functions and present simple and efficient solution methods. Next, we consider a more general problem for a provider of a wireless communication network divided into zones (clusters) with common capacity constraints. We obtain a convex quadratic optimization problem involving capacity and balance constraints. By using the dual Lagrangian method with respect to the capacity constraint, we suggest to reduce the initial problem to a single-dimensional optimization problem, but calculation of the cost function value leads to independent solution of zonal problems, which coincide with the above single region problem. Some results of computational experiments confirm the applicability of the new methods.