Konnov, I.; Kashuba, A.; Laitinen, E. Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users. Math. Comput. Appl.2018, 23, 31.
Konnov, I.; Kashuba, A.; Laitinen, E. Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users. Math. Comput. Appl. 2018, 23, 31.
Konnov, I.; Kashuba, A.; Laitinen, E. Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users. Math. Comput. Appl.2018, 23, 31.
Konnov, I.; Kashuba, A.; Laitinen, E. Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users. Math. Comput. Appl. 2018, 23, 31.
Abstract
We consider a general problem of optimal allocation of limited resources in a wireless telecommunication network. The users are divided into several different groups (or classes), which correspond to different levels of service. The network manager must satisfy these different users requirements. This approach leads to a convex optimization problem with balance and capacity constraints. We present several decomposition type methods to find a solution of this problem, which exploit its special features. We suggest to apply first the dual Lagrangian method with respect to the total capacity constraint, which gives the one-dimensional dual problem. However, calculation of the value of the dual cost function requires solution of several optimization problems. Our methods differ in approaches of solution of these auxiliary problems. We compare the performance of the suggested methods on several series of test problems. They show rather satisfactory convergence. Nevertheless, proper decomposition technique enhance the convergence essentially.
Computer Science and Mathematics, Information Systems
Copyright:
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
