A Priority Load-Aware Weighted Round Robin Scheduling Algorithm for Data Transmission
Xukun Su, Xiaohui Li, Yuemin Ding, Min Zhao, Zhenxing Liu · 2021
During data transmission, uneven distribution of network communication resources occurs frequently due to competition for limited network communication resources, which results in low efficiency of high priority data transmission. To solve the above problems, this paper proposes the priority load-aware scheduling round-robin (PLAWRR) scheduling algorithm. It firstly introduces the parameters of average data packet size and remaining queue length to weight calculation in order to allocate network communication resources in a balanced manner. Secondly, it dynamically adjusts the weight by quantifying the load priority to ensure that the high priority queue can transmit more efficiently. The simulation results show that the proposed algorithm reduces the scheduling delay and the packet loss rate of data transmission as well as increasing the throughput.