We pnsent and " p a r e three c d handling schemes for a bane station which can handle two types of CaL (originating and prioritized handoff &)and s e r m these calls und-the blocked-calldelayed basis. Delayed calla are " n e d to be stored in a finite storage buffer. One acheme exclusively allows bsndoff cdls to be stored and to use a fixed number of guard cbnn&. The other two schemes without guard channel. allow both typea of c a b to be stored and prioritized handoff cab to pushout originating calla if the M e r is full. For these three schemes, the blocking probabilities and delay distributions of both types of CalL are compared, and a boundary for cdl handling &embetween with and without guard channels is found.

No abstract

No abstract

No abstract

No abstract