Three call handling schemes are presented and compared for a base station which can handle two types of calls (originating and prioritized handoff calls) and serves these calls under the blocked-call-delayed basis. Delayed calls are assumed to be stored in a finite storage buffer. The authors' scheme exclusively allows handoff calls to be stored and to use a fixed number of guard channels. The other two schemes without guard channels allow both types of calls to be stored and prioritized handoff calls to pushout originating calls if the buffer is full. For these three schemes, the blocking probabilities and delay distributions of both types of calls are compared, and a boundary for call handling schemes between with and without guard channels is found.
展开▼
