Optimal admission control in circuit-switched multihop radio networks

Admission control in circuit-switched multihop radio networks is addressed. The problem formulation is based on the multiple service, multiple resource (MSMR) model developed by S. Jordan and P. Varaiya (1991). A recursive procedure is used to evaluate the performance associated with different coordinate convex policies, coupled with a descent-search technique for performance optimization. Empirical evidence supports the conjecture that throughput and blocking probability are unimodal functions of the admission-control policy. The major observation is that the exercise of admission control achieves minimal performance improvement as long as all call types are weighted equally. However, it has been shown that admission control is useful in cases of unequally weighted call types.<<ETX>>