| Article ID: | iaor19992536 |
| Country: | Germany |
| Volume: | 48 |
| Issue: | 1 |
| Start Page Number: | 1 |
| End Page Number: | 16 |
| Publication Date: | Jan 1998 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Kind J., Niessen T., Mathar R. |
| Keywords: | communications |
The maximum packing (MP) policy for dynamic channel assignment in cellular radio communication systems specifies that a new call attempt is admitted whenever there is some way of rearranging channels so that every call can be carried. Otherwise the call is blocked and removed from the system. We investigate the state space of MP and show that its description is in general more complicated than assumed to date. Furthermore, we prove that MP performs better than any fixed channel allocation and any hybrid policy under light traffic conditions.