Refined approximations for performance analysis and optimization of queueing model with guard channels for handovers in cellular networks

Performance Evaluation of Wireless Cellular Networks with Mixed Channel Holding Times

“…Recently, the authors in paper [13] also proposed an approximation result for the stationary probability. Summarizing their results and denoting by p j the stationary probability when j channels are being connected, we know that they in fact proposed a scalar product form formula p j = p j−1 K j for all j in their model when the buffer size is zero (K = 0).…”

“…Furthermore, in this case, by taking the results in equations (13) and (14) into equations (11) and (12), we can easily obtain…”

Approximated Mathematical Analysis Methods of Guard-Channel-Based Call Admission Control in Cellular Networks

“…the amount of time that a call occupies a channel in a particular cell). To avoid the cumbersome exact multidimensional Markov chain model when the assumption that channel holding times for new and handoff calls have equal mean values is no longer valid, different approximated one-dimensional mathematical analysis methods have been proposed in the literature for the performance evaluation of guard-channel-based call admission control schemes in mobile cellular networks (Re et al, 1995;Fang & Zhang, 2002;Zhang et al, 2003;Yavuz & Leung, 2006;Melikov and Babayev, 2006;Toledo-Marín et al, 2007). In general, existing models in the literature for the performance analysis of GCbased strategies basically differ in the way the channel holding time or the offered load per www.intechopen.com Approximated Mathematical Analysis Methods of Guard-Channel-Based Call Admission Control in Cellular Networks 153 cell used for the numerical evaluations is determined.…”

“…The authors in paper (Melikov & Babayev, 2006) also proposed an approximate result for the stationary occupancy probability. The bi-dimensional state space of the exact method is split into classes, assuming that transition probabilities within classes are higher than those between states of different classes.…”

Numerical Approach to Performance Analysis of Multi-Parametric CAC in Multi-Service Wireless Networks

“…For this case from (2.11)-(2.18) we get the following approximate formulae for calculating the blocking probabilities of vcalls (P v ) and d-calls (P d ) and mean number of busy channels: [11] and [12]. In a cell mentioned one-parametric CAC strategy based on guard channels scheme is realized in the following way [19]. If upon arrival of an h-call, there is at least one free channel, this call seizes one of free channels; otherwise h-call is dropped.…”