Performance analysis of radio resource allocation in GSM/GPRS networks

Abstract

Future communication systems are expected to provide a broad range of multimedia services with guaranteed quality of service (QoS). Thus, effective management of radio resources is important to enhance the network performance. In this paper, we proposed an analytical model to study the performance of radio resource allocation for cellular networks where real-time (RT) and non-real-time (NRT) data traffic are considered in addition to voice traffic. To guarantee the performance of voice traffic, preemptive priority is used so that voice calls can preempt data packets and RT data traffic preempts NRT data traffic. By reserving channels specifically for RT data, the packet loss probability and mean queueing delay can be reduced, meanwhile, the performance of NRT data can also be improved. This is achieved at the expense of increasing voice blocking probability. Thus, the number of reserved channels can be adjusted to control the voice blocking probability while improving the performance of data traffic. The strategy of buffer-only-for-preempted-RT-packets can achieve relatively low queueing delay of RT traffic. Moreover, the maximum allowed NRT data users can be set to a high value to reduce the packet loss probability of NRT traffic while keeping the performance of voice traffic and RT data traffic unchanged.

An approximation of the backhaul bandwidth aggregation potential using a partial sharing scheme

“…In [21] the bandwidth usage by different services in a broadband system in complete sharing and partial sharing mode with trunk reservation is investigated. Multidimensional Markov chains are used in [22], [23], [24] to evaluate the performance of cellular network systems with different service categories. The blocking probability of a complete sharing system has been approximated in [25].…”

Performance evaluation of backhaul bandwidth aggregation using a partial sharing scheme

“…In [20] the bandwidth usage by different services in a broadband system in complete sharing and partial sharing mode with trunk reservation is investigated. Multidimensional Markov chains are used in [21][22][23] to evaluate the performance of cellular network systems with different service categories. The blocking probability of a complete sharing system has been approximated in [24].…”

Prioridade versus Compartilhamento de Canais no Dimensionamento de Enlace Sem Fio

“…Ghani e Schwartz [3] propuseram uma técnica de decomposic ¸ão, para uma cadeia de Markov bidimensional, com o objetivo de analisar redes GSM/GPRS nas quais as chamadas de voz tem prioridade não preemptiva sobre os pacotes de dados. Chen et al [2] analisaram a integrac ¸ão com prioridade para o servic ¸o de voz e a utilizac ¸ão de fila para pacotes de dados que sofreram, ou não, preempc ¸ão. Meo et al [10] investigaram uma estratégia de compartilhamento dinâmico usando a informac ¸ão da ocupac ¸ão da fila como referência para alocac ¸ão de canais exclusivos para pacotes de dados.…”