Call blocking performance of distributed algorithms for dynamic channel allocation in microcells

The authors determine the blocking performance of channel allocation algorithms where every channel is available for use in every cell and where decisions are made by mobiles based only on local observations. Using a novel Erlang-B approximation method, together with simulation, they demonstrate that even the simplest algorithm, the timid, compares favorably with impractical, centrally administered fixed channel allocation. The results suggest that an aggressive algorithm, that is, one requiring call reconfigurations, could provide substantially reduced blocking. Practical algorithms are presented that take major steps toward achieving the excellent performance of the best aggressive algorithm but that have the stability of the timid algorithm