Admission Control for URLLC Traffic with Computation Requirements in 5G and Beyond

One of the three types of services supported by 5G networks are Ultra-Reliable Low-Latency Communications, which are characterized by the stringent requirement to deliver packets within a very short time with a high reliability. Besides being successfully transmitted/received, these data need to be processed as well. To satisfy these strict requirements, one needs to determine both the required data rate and the processing rate, given the channel conditions and traffic intensity of the service. Moreover, with constraints on both the Radio Access Network and edge computing resources as well as with the competition between an ever-increasing number of users in cellular networks, a very important question which arises is that of admission control. This guarantees users will not suffer from deteriorating performance. In this paper, using analytical modeling, we derive admission control policies for both homogeneous and heterogeneous types of users, taking into account the delay incurred by the RAN part of the network and that caused by the finite computing capability at the edge. We validate theoretical outcomes and provide additional insights on a 5G dataset. Results show that the number of admitted users depends on the worst channel conditions, the deadline by which the data must be processed and the available resources. There is an almost linear increase in the number of admitted users with the decrease in latency.