LTE performance analysis using queuing systems with finite resources and random requirements

Heavy traffic load in current LTE networks calls for effective radio resource allocation methods and tools for performance evaluation. In this work, we provide an analytical framework for LTE resource allocation in terms of queuing theory. We consider a multiservice queuing system with a finite amount of resources of several types, and allow the customers occupy a random amount of resources upon their arrival. Random resource requirements lead to more accurate performance evaluation compared to conventional multiservice models. For the considered model, we prove that the stationary probability distribution has a multiplicative form. Our findings are illustrated with a numerical example. © 2015 IEEE.

Авторы
Naumov V. 1 , Samouylov K. 2 , Yarkina N. 2 , Sopin E. 2 , Andreev S.3 , Samuylov A. 3
Сборник материалов конференции
Язык
Английский
Страницы
100-103
Статус
Опубликовано
Номер
7382412
Том
2016-January
Год
2016
Организации
  • 1 Service Innovations Research Institute, Helsinki, Finland
  • 2 Department of Applied Probability and Informatics, Peoples' Friendship University of Russia, Moscow, Russian Federation
  • 3 Tampere University of Technology, Tampere, Finland
Ключевые слова
blocking probability; finite resources; LTE; queuing system; random requirements; resource allocation
Дата создания
19.10.2018
Дата изменения
19.10.2018
Постоянная ссылка
https://repository.rudn.ru/ru/records/article/record/4023/
Поделиться

Другие записи