# QoS-Aware Resource Management in 5G and 6G Cloud-Based Architectures with Priorities
## 2 Scheduler Priority Queue  
QoS flexible architecture in 5G network topology, as being standardized in the 5G gNodeB, exists to enable the core and the Radio Access Network subsystem (RAN) to differentiate service classes and services into high priority (pre-emption capable) and low priority (pre-emption vulnerable) [12; 13; 14], allowing network designers to define pre  
Figure 1: gNodeB star topology implementation in 5G/6G cloud-based transmission network.  
-emption strategies in the Radio Access Network (RAN) MAC layer to properly tune the scheduling functionality and support the demanding simultaneous request for high-throughput rates and low latency. Typical realistic examples might be the combination of enhanced mobile broadband (eMBB) services where throughput is the extremely important metric of the service, along with low-latency and reliable services (massive machine-type communications--mMTC) for Internet-of-Things (IoT) applications. Recent published works propose techniques that distinguish among priorities but have not considered the delay as a total of discrete components. A scheme akin to our paper's contribution has been proposed by [PERSON] et al. [15]. To the best of the authors' knowledge, the scheme that approaches closer to our own proposal has been published by [PERSON] [16; 17]. These works feature resilient results on dynamic partitioning, however once more the pre-empted packets are given no further consideration on priority schemes (ARP), resulting in reduced packet service performance, and guaranteeing only priority traffic performance.  
In our analysis, a queue management analysis is introduced along with an RRM algorithm based on capacity analysis and packet segmentation providing service differentiation from diverse applications. Performance metrics have been investigated considering a combined RRM, scheduling, and queue management approach without however considering dynamical buffer size or expected delay. Our proposed two-dimension queue model, analytically solved to calculate the expected IP pre-empted packet delay in the MAC/Ethernet scheduler, should be compliant with priority schemes investigating a more compact approach to multi-service implementation by considering pre-empted packet queue sizes through a general optimization process.  
A pre-emptive priority mechanism is employed to guarantee the quality of service (QoS) requirement of service class p (pre-emption-capable service class, such as VoIP or video streaming services, URLLC, or mini-slot-based services) at the expense of some degradation of service class q (pre-empted vulnerable service class, such as enhanced mobile broadband eMBB FTP or WWW services), while the victim service class q buffer compensates the degradation. The solution of such a Markov queue is not trivial, on the contrary it can often become very complicated; however, our scheme adopts a mathematical solution based on an intuitive approach [18; 19]. We have not considered any reservation or guard channels, since in the literature it has been proven that, for multi-service applications, guard channels may result in low utilization of the radio channels. Consequently, it is better for the network designers to follow parametric techniques such as dividing the radio channels into specific groups of radio blocks, thus following an intuitive resource sharing strategy between priority and non-priority services on user profiling or network capacity [20; 21; 22].