scholarly journals A Design of Packet Scheduling Algorithm to Enhance QoS in High-Speed Downlink Packet Access (HSDPA) Core Network

Author(s):  
Sohail Ahmed ◽  
Mubashar Ali ◽  
Abdullah Baz ◽  
Hosam Alhakami ◽  
Bilal Akbar ◽  
...  
2014 ◽  
Vol 8 (1) ◽  
pp. 92-95
Author(s):  
Hu Linna ◽  
Cao Ning ◽  
Mao Minghe

The efficiency of high speed packet access (HSPA) systems is mainly based on Packet Scheduling Scheme which will be the key to influencing on the system performance and ensuring the service quality for the users. In this paper, we introduce a three step packet scheduling scheme to provide quality of services (QoS) guaranteed for high speed uplink packet access. Then, we proposed an improved packet scheduling algorithm based on QoS parameter for mixed service applications in order to meet the actual QoS needs of the different systems. This algorithm calculated the scheduling priority based on the comprehensive factors, including the queuing status of each user, QoS requirements and the sum of speeds on each channel. The simulation results show that the performance efficiency of HSPA systems employed proposed algorithm is superior compared to the conventional PF and M-LWDF algorithm in average packet drop and average cell throughput.


2021 ◽  
Vol 13 (3) ◽  
pp. 78
Author(s):  
Chuanhong Li ◽  
Lei Song ◽  
Xuewen Zeng

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