Performance Analysis of a Connection Admission Scheme for Future Networks

Abstract

Future networks are to deliver any-traffic, anytime, anywhere with full quality of service (QoS) guarantees. They will evolve from typical heterogeneous networks (HetNets) into dense, organic, and irregular heterogeneous networks called DenseNets. They will be complex and face additional challenges of heterogeneity in many design dimensions like different radio access technologies (RAT's) shrinking in structure. Radio Resource Management (RRM) is one of the key challenges in providing for QoS for these networks. Connection Admission Control (CAC) scheme and intelligent scheduling techniques are employed on the links for RRM. In this paper a CAC scheme is developed that features multiple traffic classes, multiple admission parameters at both packet and connection level. The CAC scheme uses both signal to interference ratio (SIR) and delay as admission parameters since the single parameter based CAC algorithm is not adequate for the emerging traffic classes. The performance analysis of the model features Batch Markovian Arrival Process (BMAP) traffic, a better representative of the future traffic characteristics than the traditional Poisson traffic. A simple approximate Markovian analytical model is developed and used to analyze the complex network. The developed model with more admission parameters outperforms those with less admission control parameters for future networks traffic.