Differentiating and Scheduling LTE Uplink Traffic Based on Exponentially Weighted Moving Average of Data Rate

Abstract

The importance of uplink resource allocation in ensuring the Quality of Service (QoS) of guaranteed bit rate (GBR) bearers has led to the development of numerous resource allocation schemes. The criteria used in the development of such schemes include maximizing system throughput or fairness and the ability to take transmission power or user priority into account. After accepting a GBR bearer, the eNodeB (eNB) must allocate sufficient resource blocks (RBs) to guarantee the requested QoS. In order to achieve high utilization of radio resource, eNB also must allocate remaining RBs to non-GBR bearers. The QoS is generally specified by the data rate (throughput) or packet delay; however, the 3rd Generation Partnership Project (3GPP) has not specified the means by which data rates for a GBR bearer are to be measured. In this paper, we define the measurement of data rates based on the exponentially weighted moving average (EWMA), thereby enabling the eNB to perform scheduling tasks with greater accuracy. We also present an AAG-2 (Allocate As Granted-version 2) scheme capable of supporting the QoS for GBR bearers, while enabling the efficient allocation of RBs to non-GBR bearers. The existence of parties seeking superior levels of service makes it necessary for telecommunications operators to provide options with regard to QoS. This study proposes a revision of the AAG-2 scheme referred to as AAG-D to accommodate such demands. Simulation results demonstrate the efficacy of the new scheme in achieving goals related to throughput and average packet delay.

Low Complexity Fair Scheduling in LTE/LTE-A Uplink Involving Multiple Traffic Classes

“…where, ݇ is the number of bytes that will be dropped if UE ݅ is not scheduled in the current TTI and ݀ is the number of bytes that will be dropped by UE ݅ if UE ݅ is allocated to RC ݆. Constraint (13) ensures that UE ݅ is either allocated an RC (∑ ߙ = 1) or the UE is mapped to the dummy RC (ߚ = 1). We replace ൫‫ݓ‬ − ݀ ൯ by ߛ for compact representation.…”

“…For the previous discussions in Section 3.2, we have considered that N > M. However, another case may arise where N < M. In such a scenario, if we allow only one RC per UE, some RCs will be wasted which could have been used by the active UEs. Therefore, we use ILP (10)(11)(12)(13)(14)(15) in an iterative manner for this purpose. However, we omit the ݀ term for this purpose.…”

“…However, the algorithms follow a greedy approach and hence do not provide optimum allocations. Two classes of traffic with different QoS requirements have been dealt with in [13] by switching between two heuristic algorithms. The work in [14] proposes a delay-aware algorithm that follows heuristic riding the peaks method of [3].…”

New Courteous Algorithm for Uplink Scheduling in LTE-Advanced and 5G Networks

“…erefore, bandwidth increasing stills to be an insufficient solution for maintaining a good QoS level in the whole network, especially during congested situations, unless if it deals with the access management of network resources. Several scheduling approaches are proposed in the literature for the uplink and downlink [1][2][3], focusing on different aspects, such as queuing and priority management. Some research studies consider the delay tolerance in the queue management, where low-tolerant classes have the highest priority of service.…”

Esquemas de escalonamento Qos-aware para enlace Uplink LTE-A em cenário de tráfego misto e redes heterogêneas

“…O uso eficiente desses recursos de rádio é essencial para atender às metas de desempenho do sistema e satisfazer as necessidades do usuário de acordo com requisitos específicos de Qualidade de Serviço (QoS, do inglês Quality of Service)[14].Para garantia de QoS, o sistema LTE-A trabalha com fluxos de dados conhecidos como bearer, transmissão orientada por conexão, criando um túnel entre transmissor e receptor[14]. Neste artigo, são tratados dois tipos específicos de bearers: com taxa de bits garantida (GBR, do inglês Guaranteed bitrate) e sem taxas de bits garantida (não-GBR).…”