Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/192897| Title: | Approximate Method For Finding The Suboptimal Cac In Multi-Rate Queues |
| Authors: | Kim, C. S. Melikov, A. Ponomarenko, L. |
| Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика ЭБ БГУ::ОБЩЕСТВЕННЫЕ НАУКИ::Информатика |
| Issue Date: | 2009 |
| Publisher: | Минск:РИВШ |
| Citation: | Массовое обслуживание : потоки, системы, сети : материалы междунар. науч. конф. «Современные математические методы анализа и оптимизации информационно-телекоммуникационных сетей», Минск, 26 - 29 янв. 2009 г. Вып. 20 / редкол. : А. Н. Дудин (отв. ред.) [и др.]. - Минск : РИВШ, 2009. - C.102-107. |
| Abstract: | An approach to solving the problem of finding the suboptimal call admission control (CAC) in multi-rate queue in which calls of different types require random number of channels is proposed. The goal is maximization of channel utilization. To solve the latter problem the methods of Markov decision process (MDP) theory are employed. The results of numerical experiments are given. |
| URI: | http://elib.bsu.by/handle/123456789/192897 |
| ISBN: | 978-985-500-244-5 |
| Appears in Collections: | 2009. Массовое обслуживание: потоки, системы, сети |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| C.S.Kim.pdf | 758,98 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.