Kazan Federal University Digital Repository
Penalty method for reliable allocations of wireless network resources
- Home
- →
- Научные публикации в Scopus
- →
- Публикации сотрудников КФУ Scopus
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Konnov I.V. | |
| dc.contributor.author | Kashuba A.Y. | |
| dc.contributor.author | Laitinen E. | |
| dc.date.accessioned | 2021-02-25T06:51:32Z | |
| dc.date.available | 2021-02-25T06:51:32Z | |
| dc.date.issued | 2020 | |
| dc.identifier.issn | 1613-0073 | |
| dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/161131 | |
| dc.description.abstract | Copyright © by the paper’s authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0). In the paper we consider the problem of allocation of network resources in telecommunication networks using both utility and reliability. We suggest a scalar utility maximization problem subject to capacity constraints and within the pre-defined reliability level. This problem is proposed to be solved by a penalty method. We present the results of numerical results on various test problems for the method. | |
| dc.relation.ispartofseries | CEUR Workshop Proceedings | |
| dc.title | Penalty method for reliable allocations of wireless network resources | |
| dc.type | Conference Paper | |
| dc.relation.ispartofseries-volume | 2642 | |
| dc.collection | Публикации сотрудников КФУ | |
| dc.source.id | SCOPUS16130073-2020-2642-SID85091204201 |
Files in this item
This item appears in the following Collection(s)
-
Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.