An efficient packet scheduling algorithm to improve the performance of cell-edge user in LTE network

2017 ◽  
Author(s):  
Hasibur Rashid Chayon ◽  
Kaharudin Dimyati ◽  
Harikrishnan Ramiah
Keyword(s):  
Packet Scheduling ◽  
Scheduling Algorithm ◽  
Cell Edge ◽  
Lte Network ◽  
Packet Scheduling Algorithm ◽  
Cell Edge User

scholarly journals Comparative Study of Packet Scheduling Algorithm in LTE Network

2017 ◽  
Vol 13 (12) ◽  
pp. 756-766 ◽  
Author(s):  
Alaa Omer Najim ◽  
Nor Asilah Wati Abdul Hamid ◽  
Zurina Mohd Hanapi ◽  
Idawaty Ahmad
Keyword(s):  
Comparative Study ◽  
Packet Scheduling ◽  
Scheduling Algorithm ◽  
Lte Network ◽  
Packet Scheduling Algorithm

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