Performance analysis of circuit allocation schemes for half and full rate connections in GSM

Performance between circuit allocation schemes for half- and full-rate connections in GSM

“…In this section, we provide analytic solutions for loss probabilities for the methods mentioned above. An analytic solution for RRR by means of Gauss-Seidel iterations is available in [5].…”

“…Using the model defined in Section II as a framework, all of the allocation schemes may be described by such a reduced state space where each state is described by the parameters: 1) : the number of full-rate calls currently in the frame; 2) : the total number of halfrate calls; and for the best-fit scheme, we require an additional parameter which is 3) : the number of isolated half-rate calls in the frame. The last parameter is only needed for the bestfit allocation scheme (and the random scheme [5]) because unlike the repacking and fair repacking, this scheme can have more than one isolated half-rate call. The numerical analytic method was based on generating the state transition rate matrix and solving it using a Gauss-Seidel iteration technique with relative error 10 .…”

“…In this way, the blocking probability of half-and full-rate traffic is equal for every traffic mix at the expense of lowering the half-rate call utilization somewhat. A scheme based on reserving an entire time slot solely for use by full-rate callers, repacking with perpetual reservation (RPR), is discussed in [5].…”

“…It is worth mentioning that the repacking with random reservation (RRR) scheme [5]- [7] is a more general variation of the repacking scheme. Under this scheme, if only one full slot is empty and a half-rate call arrives, then the call is accepted with probability and rejected with probability .…”

“…The case of is the RPR scheme. There are also other schemes which may be implemented (see [5] for detailed descriptions) such as the following. 1) Random: All calls are assigned to any free channels without any control.…”