Call Admission Control in Cellular Networks
Manfred Schneps-Schneppe, Villy Bk · InTech eBooks · 2012
Will-be-set-by-IN-TECH Various priority based call admission algorithms have been reported in the literature, as for example (Beigy & Meybodi, 2003); (Ahmed, 2005); (Ghaderi & Boutaba, 2006).They can be classified into two basic categories: (1) reservation based, and (2) call thinning schemes. Reservation based schemes:In these schemes, a subset of channels is reserved for exclusive use by handover calls.Whenever the number of calls (new calls) exceeds a certain threshold, these schemes reject new calls until the number of simultaneous calls (new calls) decreases below the threshold.These schemes accept handover calls as long as the cell has idle channels.When the number of calls is compared with the given threshold, this scheme is called call bounding (Ramjee et al., 1997); (Hong & Rappaport, 1986); (Oh & Tcha, 1992); (Haring et al., 2001); (Beigy & Meybodi, 2005).When the current number of new calls is compared with the given threshold, the scheme is called new call bounding scheme (Fang & Zhang, 2002).Equal Access sharing with reservation schemes reserve an integral number of channels or a fractional number (Ramjee et al., 1997) of channels for exclusive use by handover calls.Schemes with fractional number of guard channels have better control of the blocking probability of the new calls and the dropping probability of the handover calls than schemes with integral number of guard channels.