Bounding the Performance of Dynamic Channel with QoS Provisioning for Distributed Allocation Admission Control in Wireless Networks
Xusheng Tian, Chuanyi Ji · 1999
In this work, we investigate the performance of distributed admission control with QoS provisioning and dy- namical channel allocation for mobile/wireless networks. We first provide a QoS metric feasible for admission control with dynamically allocated channels. We then derive a criterion analytically using the QoS measure for distributed call admis- sion cent rol with dynamic channel allocation. When maximum packing is used as the dynamic channel allocation scheme, the results obtained are independent of any particular algorithm which implements dynamic channel assignments. Our results thereby provide the optimal performance achievable for the distributed admission control with the QoS provisioning by the best dynamic channel allocation scheme in the given setting. One of the challenges in providing multi-media services over wireless networks is lhow to support the guarantees of Quality of Service (QoS) with the limited capacity. Call admission control is needed to meet this challenge. As various dynamic channel allocation (DCA) algorithms have been developed for admission control, little has been done on assessing the perfor- mance gain achievable by DCA with QoS provisioning. The goal of this work was to investigate this fundamental issue by providing answers to, two questions: What is the best achiev- able utilization under a given QoS constraint by distributed admission control with dynamically assigned channels? How much gain can DCA provide compared to fixed channel allo- cations (FCA)? In cellular systems, a geographical region is split into cells, each containing one base station. When a new call request is made at a cell, a decision can be made on either accept-