A performance bound on dynamic channel allocation in cellular systems: equal load

摘要: We model a cellular network as more general multiple service, resource system. define the "state" of system number calls currently carried in each cell. restrict ourselves to channel allocation policies that place restrictions on global state system, are allowed immediate reallocation, and ignore handoffs. Maximum packing fixed considered special cases such policies. Under uniform load conditions, we prove throughput is increasing concave with respect increases or capacity, under maximum allocation. propose optimal policy, class, varies from at low loads high loads. This policy often impractical implement, but can be performance bound practical systems. The analytical results investigated numerically using simple seven cell linear network. >