**3.3 On queueing effect**

In queuing priority schemes, new calls and handover calls are all accepted whenever there are idle channels for that type of calls. When no idle channels are accessible, calls may be queued or blocked (i.e cleared from the system). Queueing priority schemes can be divided into three groups: new call queuing schemes (Chang et al., 1999), handover call queuing schemes (Yoon & Kwan, 1993); (Tian & Ji, 2001); (Agrawal et al., 1996), and all calls queuing schemes (Yoon & Kwan, 1993); (Chang et al., 1999).

Computational analysis has shown that waiting positions do not change the advantage of dynamic reservation strategy. Fig. 7 displays two pairs of curves: one pair is the same as in Fig. 6, the second one relates to a case with three waiting positions. Of course, the revenue is growing, but the preference of dynamic reservation keeps the place.

Fig. 7. Waiting positions do not change the advantage of dynamic reservation strategy. One pair of curves is the same as in Figure 6, the other pair relates to the case with three waiting positions.
