Form of presentation | Articles in international journals and collections |
Year of publication | 2018 |
Язык | английский |
|
Kashuba Aleksey Yurevich, author
Konnov Igor Vasilevich, author
|
|
Laitinen Erkki , author
|
Bibliographic description in the original language |
Konnov I, Kashuba A, Laitinen E. Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users. Mathematical and Computational Applications. 2018; 23(2):31. |
Annotation |
Mathematical and Computational Applications |
Keywords |
telecommunication networks, wireless networks, service levels, resource allocation, optimization problem, decomposition methods, Lagrange duality |
The name of the journal |
Mathematical and Computational Applications
|
URL |
https://doi.org/10.3390/mca23020031 |
Please use this ID to quote from or refer to the card |
https://repository.kpfu.ru/eng/?p_id=192662&p_lang=2 |
Full metadata record |
Field DC |
Value |
Language |
dc.contributor.author |
Kashuba Aleksey Yurevich |
ru_RU |
dc.contributor.author |
Konnov Igor Vasilevich |
ru_RU |
dc.contributor.author |
Laitinen Erkki |
ru_RU |
dc.date.accessioned |
2018-01-01T00:00:00Z |
ru_RU |
dc.date.available |
2018-01-01T00:00:00Z |
ru_RU |
dc.date.issued |
2018 |
ru_RU |
dc.identifier.citation |
Konnov I, Kashuba A, Laitinen E. Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users. Mathematical and Computational Applications. 2018; 23(2):31. |
ru_RU |
dc.identifier.uri |
https://repository.kpfu.ru/eng/?p_id=192662&p_lang=2 |
ru_RU |
dc.description.abstract |
Mathematical and Computational Applications |
ru_RU |
dc.description.abstract |
Mathematical and Computational Applications |
ru_RU |
dc.description.abstract |
We consider a general problem of optimal allocation of limited resources in a wireless telecommunication network. The network 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 to this problem, which exploit its special features. We suggest applying 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 solving several optimization problems. Our methods differ in approaches for solving these auxiliary problems. We consider three basic methods: Dual Multi Layer (DML), Conditional Gradient Dual Multilayer (CGDM) and Bisection (BS). |
ru_RU |
dc.language.iso |
ru |
ru_RU |
dc.subject |
telecommunication networks |
ru_RU |
dc.subject |
wireless networks |
ru_RU |
dc.subject |
service levels |
ru_RU |
dc.subject |
resource allocation |
ru_RU |
dc.subject |
optimization problem |
ru_RU |
dc.subject |
decomposition methods |
ru_RU |
dc.subject |
Lagrange duality |
ru_RU |
dc.title |
Dual Methods for Optimal Allocation of Telecommunication Network Resources with Several Classes of Users |
ru_RU |
dc.type |
Articles in international journals and collections |
ru_RU |
|