Modeling resource allocation in cellular networks

Abstract

After cellular network resources are used for a service, they remain allocated to the end user for some time before release, so that if a new service request is generated by the same user, they are immediately available, with no risk of blocking. This behavior differs from the one captured by normal queuing models (for example an M/M/K/0 queue), but it can nevertheless be described with simple networks of queues that yield a closed form expression for the blocking probability. This talk discusses the model development and solution, and compares the model performance predictions to traditional queueing models results, such as the Erlang B formula iteratively applied to the resources that are not blocked by potentially returning users.