A Semi-Persistent Scheduling Algorithm for VoIP in LTE-Advanced System

2014 ◽  
Vol 1046 ◽  
pp. 343-347
Author(s):  
Wei Wu ◽  
Jun Sun ◽  
Tong Hui Wu
Keyword(s):  
Source Coding ◽  
Scheduling Algorithm ◽  
System Throughput ◽  
Time Frequency ◽  
Coding Scheme ◽  
Lte Advanced ◽  
Key Technologies ◽  
Utilization Ratio ◽  
Advanced System ◽  
Better Than

The scheduling algorithm is one of the key technologies in LTE-Advanced system. In this paper, a semi-persistent scheduling algorithm designed for the VoIP service in LTE-Advanced system is proposed. The time-frequency resource will be allocated to the users according to the semi-persistent scheduling algorithm based on the gain for each user on the certain RB. By introducing the mechanism and procedure, analyzing the proposed semi-persistent scheduling algorithm combined the source coding (SC) or modulation and coding scheme (MCS) techniques, the superiority of the proposed algorithm is shown. The simulation results indicate that the performance of the proposed semi-persistent scheduling algorithm is better than the traditional algorithms in term of resource utilization ratio, system throughput and scheduling success rate.

scholarly journals Adaptive Handover Decision Algorithm Based on Multi-Influence Factors through Carrier Aggregation Implementation in LTE-Advanced System

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Ibraheem Shayea ◽  
Mahamod Ismail ◽  
Rosdiadee Nordin ◽  
Hafizal Mohamad
Keyword(s):  
Outage Probability ◽  
Influence Factors ◽  
User Mobility ◽  
Carrier Aggregation ◽  
Decision Algorithm ◽  
Handover Decision ◽  
Lte Advanced ◽  
Advanced System ◽  
Better Than

Although Long Term Evolution Advanced (LTE-Advanced) system has benefited from Carrier Aggregation (CA) technology, the advent of CA technology has increased handover scenario probability through user mobility. That leads to a user’s throughput degradation and its outage probability. Therefore, a handover decision algorithm must be designed properly in order to contribute effectively for reducing this phenomenon. In this paper, Multi-Influence Factors for Adaptive Handover Decision Algorithm (MIF-AHODA) have been proposed through CA implementation in LTE-Advanced system. MIF-AHODA adaptively makes handover decisions based on different decision algorithms, which are selected based on the handover scenario type and resource availability. Simulation results show that MIF-AHODA enhances system performance better than the other considered algorithms from the literature by 8.3 dB, 46%, and 51% as average gains over all the considered algorithms in terms of SINR, cell-edge spectral efficiency, and outage probability reduction, respectively.

scholarly journals An Adaptive Throughput-First Packet Scheduling Algorithm for DPDK-Based Packet Processing Systems

2021 ◽  
Vol 13 (3) ◽  
pp. 78
Author(s):  
Chuanhong Li ◽  
Lei Song ◽  
Xuewen Zeng
Keyword(s):  
Packet Loss ◽  
High Performance ◽  
Packet Scheduling ◽  
Scheduling Algorithm ◽  
Processing System ◽  
System Throughput ◽  
Packet Processing ◽  
Research Attention ◽  
Continuous Increase ◽  
Packet Scheduling Algorithm

The continuous increase in network traffic has sharply increased the demand for high-performance packet processing systems. For a high-performance packet processing system based on multi-core processors, the packet scheduling algorithm is critical because of the significant role it plays in load distribution, which is related to system throughput, attracting intensive research attention. However, it is not an easy task since the canonical flow-level packet scheduling algorithm is vulnerable to traffic locality, while the packet-level packet scheduling algorithm fails to maintain cache affinity. In this paper, we propose an adaptive throughput-first packet scheduling algorithm for DPDK-based packet processing systems. Combined with the feature of DPDK burst-oriented packet receiving and transmitting, we propose using Subflow as the scheduling unit and the adjustment unit making the proposed algorithm not only maintain the advantages of flow-level packet scheduling algorithms when the adjustment does not happen but also avoid packet loss as much as possible when the target core may be overloaded Experimental results show that the proposed method outperforms Round-Robin, HRW (High Random Weight), and CRC32 on system throughput and packet loss rate.

Sign in / Sign up

Export Citation Format

Share Document