Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints

-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward paradigm as an intuitively appealing way of characterizing the achievable carried traffic region. In one-dimensional networks, ourbounds closely approach the performanceof Maximum Packing (MP), which is an idealized DCA scheme. This suggests not only that the bounds are extremely tight, but also that no DCA scheme, however sophisticated, can be expected to outperform MP in any significantmanner, if at all. Our bounds extend to scenarios with varying re-use which may arise in the case of dynamic re-use partitioning or measurement-based DCA schemes. In these cases, the bounds slightly diverge from the performance of MP, which inflicts higher blocking on outer calls than inner calls, but not to the extent required to maximize carried traffic. This reflects the trade-off that arises in the case of varying re-use betw...

• Type: Conference
• Year: 1998
• Where: INFOCOM
• Authors: Philip A. Whiting, Sem C. Borst
• Keywords: -We Derive Bounds, Communications, Dca Schemes, Idealized Dca Scheme, INFOCOM 1998