Performance Evaluation of a Decoupled-Level with QoS-Aware Downlink Scheduling Algorithm for LTE Networks

Trabelsi, Selem; Belghith, Aymen; Zarai, Faouzi; Obaidat, Mohammad S.

doi:10.1109/dsdis.2015.92

Cited by 12 publications

(8 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where 0 < γ < 1 is a parameter that balances the weights of the throughput in the past and the most recent TTI. When γ is small, a higher weight is given to the current transmission rate, as shown in (26), and the scheduling reacts to channel condition changes quickly. In this case, fairness can be achieved in a relatively large time scale.…”

Section: B Achieving Pf Throughputmentioning

confidence: 99%

“…A new channel-and QoS-aware scheduling algorithm (WE-MQS) is proposed in [25] for downlink scheduling of VoLTE users which considers user perception. To reduce the waste of resources when scheduling a low-rate VoLTE user on a strong channel, a scheduling algorithm is proposed in [26] in which voice packets for different users are multiplexed within one LTE packet in the downlink. Compared to these works we consider both GBR and non-GBR users in LTE networks.…”

Section: B Background and Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling for VoLTE: Resource Allocation Optimization and Low-Complexity Algorithms

Mohseni

Banani

Eckford

et al. 2019

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

We consider scheduling and resource allocation in long-term evolution (LTE) networks across voice over LTE (VoLTE) and best-effort data users. The difference between these two is that VoLTE users get scheduling priority to receive their required quality of service. As we show, strict priority causes data services to suffer. We propose new scheduling and resource allocation algorithms to maximize the sumor proportional fair (PF) throughout amongst data users while meeting VoLTE demands. Essentially, we use VoLTE as an example application with both a guaranteed bit-rate and strict application-specific requirements. We first formulate and solve the frame-level optimization problem for throughput maximization; however, this leads to an integer problem coupled across the LTE transmission time intervals (TTIs). We then propose a TTI-level problem to decouple scheduling across TTIs. Finally, we propose a heuristic, with extremely low complexity. The formulations illustrate the detail required to realize resource allocation in an implemented standard. Numerical results show that the performance of the TTI-level scheme is very close to that of the frame-level upper bound. Similarly, the heuristic scheme works well compared to TTI-level optimization and a baseline scheduling algorithm. Finally, we show that our PF optimization retains the high fairness index characterizing PF-scheduling.

show abstract

Section: B Achieving Pf Throughputmentioning

confidence: 99%

Section: B Background and Related Workmentioning

confidence: 99%

Scheduling for VoLTE: Resource Allocation Optimization and Low-Complexity Algorithms

Mohseni

Banani

Eckford

et al. 2019

IEEE Trans. Wireless Commun.

View full text Add to dashboard Cite

show abstract

“…Trabelsi and Selem proposed a Decoupled‐Level QoS aware scheduling algorithm, which tries to guarantee QoS for different traffic types by keeping reasonable values of throughput and fairness. In the first step, the algorithm checks if a UE has a packet in buffer, and if so, it separates the users into two groups: Guaranteed Bit Rate (GBR) and non‐GBR.…”

Section: Related Workmentioning

confidence: 99%

QoS‐aware LTE‐A downlink scheduling algorithm: A case study on edge users

Uyan

Güngör

2019

Int J Communication

View full text Add to dashboard Cite

Summary 4G/LTE‐A (Long‐Term Evolution—Advanced) is the state of the art wireless mobile broadband technology. It allows users to take advantage of high Internet speeds. It makes use of the OFDM technology to offer high speed and provides the system resources both in time and frequency domain. A scheduling algorithm running on the base station holds the allocation of these resources. In this paper, we investigate the performance of existing downlink scheduling algorithms in two ways. First, we look at the performance of the algorithms in terms of throughput and fairness metrics. Second, we suggest a new QoS‐aware fairness criterion, which accepts that the system is fair if it can provide the users with the network traffic speeds that they demand and evaluate the performance of the algorithms according to this metric. We also propose a new QoS‐aware downlink scheduling algorithm (QuAS) according to these two metrics, which increases the QoS‐fairness and overall throughput of the edge users without causing a significant degradation in overall system throughput when compared with other schedulers in the literature.

show abstract

“…The rate requested for each user depends on the service type. The detailed simulation parameters were presented in [12].…”

Section: A Simulation Modelmentioning

confidence: 99%

Flexible call admission control with preemption in LTE networks

Belghith¹,

Turki²,

Cousin³

et al. 2016

2016 IEEE International Conference on Communications (ICC)

Self Cite

View full text Add to dashboard Cite

This paper introduces a new call admission control (CAC) mechanism for Long Term Evolution (LTE) networks supporting multimedia services with different classes of traffic. Our CAC mechanism classifies calls into real time and non-real time users, then estimates the channel quality based upon the received signal strength (RSS) value, and finally identifies the call as either new call (NC) or handoff call (HC) request before performing admission control decision. We also use a simple preemption technique in order to allocate the resources to high priority bearer requests. We show through extensive simulation analysis that our CAC mechanism provides high number of accepted users with higher priorities while providing high system throughput.

show abstract

Performance Evaluation of a Decoupled-Level with QoS-Aware Downlink Scheduling Algorithm for LTE Networks

Cited by 12 publications

References 20 publications

Scheduling for VoLTE: Resource Allocation Optimization and Low-Complexity Algorithms

Scheduling for VoLTE: Resource Allocation Optimization and Low-Complexity Algorithms

QoS‐aware LTE‐A downlink scheduling algorithm: A case study on edge users

Flexible call admission control with preemption in LTE networks

Contact Info

Product

Resources

About