Kazan Federal University Digital Repository

Application of the conditional gradient method to a network resource allocation problem with several classes of users

Show simple item record

dc.contributor.author Konnov I.
dc.contributor.author Kashuba A.
dc.date.accessioned 2020-01-15T21:48:42Z
dc.date.available 2020-01-15T21:48:42Z
dc.date.issued 2019
dc.identifier.issn 1742-6588
dc.identifier.uri https://dspace.kpfu.ru/xmlui/handle/net/156135
dc.description.abstract © 2019 IOP Publishing Ltd. We consider a general problem of optimal allocation of a limited resource in a telecommunication network. The users are divided into several different groups (or classes), which correspond to different levels of service. The network manager has to satisfy users requirements and maximize the network profit, which gives a convex optimization problem with balance and capacity constraints. We suggest to solve this problem with a two-level iterative method where the conditional gradient method is used at its upper level. Then we can solve the lower level problem with simple decomposition algorithms. The computational experiments show rather satisfactory convergence of the suggested method.
dc.relation.ispartofseries Journal of Physics: Conference Series
dc.title Application of the conditional gradient method to a network resource allocation problem with several classes of users
dc.type Conference Paper
dc.relation.ispartofseries-issue 3
dc.relation.ispartofseries-volume 1158
dc.collection Публикации сотрудников КФУ
dc.source.id SCOPUS17426588-2019-1158-3-SID85063780894


Files in this item

This item appears in the following Collection(s)

  • Публикации сотрудников КФУ Scopus [24551]
    Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.

Show simple item record

Search DSpace


Advanced Search

Browse

My Account

Statistics