Performance Comparison of Three Spectrum Admission Control Policies in Coordinated Dynamic Spectrum Sharing Systems

Abstract

When spectrum is shared among multiple radio systems, spectrum admission control (SAC) can be performed via a centralized spectrum manager to meet their respective traffic demands. The adopted policy will determine the admission of service requests and, in turn, affect the overall spectrum utilization efficiency. The design of SAC policies becomes more challenging when each radio system provides a grade of service (GoS) in the form of a blocked service guarantee to its users. Given such constraints, we study the admission region, which indicates the maximum amount of supported traffic for the given resources. We first study the performance based on a simple first-come-first-serve (FCFS) policy. Our studies show that the admission region is, in general, limited by the radio system that first violates its prescribed GoS guarantee (i.e., the performance-limiting radio). We propose three SAC policies to enhance the total offered traffic and compare them against the FCFS policy. The first is a random discard (RD) policy, where requests from other systems are discarded with some predetermined probabilities so that a larger portion of the spectrum is made available to the performance-limiting radio. The second SAC uses a reservation (RES) policy, where a suitable amount of spectrum is reserved for the performance-limiting radio. In the third policy, SAC is formulated as a discrete-time constrained Markov decision process (MDP). We analyzed the performance of each policy at low and high request rates and show how the additional design parameters in each policy can be optimized to enhance the offered traffic. As admission decisions are jointly made with traffic predictions, the MDP admission policy shows superior performance over the other policies due to its flexibility to operate both radios at the bound of the respective GoS constraint.