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

• Main Authors: Chuanhong Li, Lei Song, Xuewen Zeng
• Format: Article
• Language: English
• Published: MDPI AG 2021-03-01
• Series: Future Internet
• Subjects: packet scheduling; HRW; DPDK; throughput; packet loss rate
• Online Access: https://www.mdpi.com/1999-5903/13/3/78

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.