Abstract
In this paper, we present an analytical framework for the performance evaluation of Radio Resource Allocation (RRA) in Orthogonal Frequency Division Multiple Access (OFDMA) networks. We focus on Quality of Service (QoS) guaranteed traffic whose capacity, in terms of the number of active user connections, depends on the users’ QoS requirements and channel conditions, and the RRA algorithm. The required QoS is guaranteed by restricting the number of admitted calls, which in turn requires an accurate estimate of the QoS metrics and capacity supported by the RRA when a new call arrives. These estimates for OFDMA networks are variable and usually obtained through time-consuming offline computer simulations. Mathematical frameworks on the other hand yield timely and accurate results. However, earlier known works on analytical modelling of RRA either consider a single channel with random traffic arrivals or multiple channels with full buffer data traffic. In contrast, we develop a queueing theoretic framework considering randomly arriving QoS-guaranteed traffic in a variable-rate multi-channel multi-class OFDMA network. The framework can be used online leading to better dynamic Call Admission Control. We characterize the RRA algorithm using a scheduler control parameter which can regulate the call blocking probability while providing predefined QoS constraints. We model the RRA as a variable service rate, multi-server, multi-class, finite buffer queueing system and verify the derived QoS metrics using extensive Monte-Carlo discrete event simulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.