Real-Time Priority Queue Scheduling for Bursty Traffic

Rongping Lin

doi:10.1109/JIOT.2025.3627212

Real-Time Priority Queue Scheduling for Bursty Traffic

2025-12-12

0

PRE

AI

DOI：10.1109/JIOT.2025.3627212

Original

Original request for help

Save

Abstract

En 中文

This article addresses the challenge of scheduling multiple output priority queues of a switch in a real-world setting characterized by bursty traffic and diverse traffic priorities. The existing queue scheduling methods primarily employ two types of strategies: priority-based scheduling and weight-based scheduling. However, there is a lack of scheduling methods that can simultaneously handle bursty traffic in a timely manner and maintain priority-based scheduling. This article addresses this issue by formulating the problem as a restless multiarmed bandit problem, and a queue scheduling method is proposed to balance priority service provisioning and bursty traffic processing. The proposed queue scheduling method operates efficiently in a timely manner based on an instant queue length and utilizes the Whittle index method to achieve an asymptotically optimal solution. This design facilitates packet forwarding by considering the instant states of queues, offering improvements over existing methods. The experimental results demonstrate that the proposed method achieves a more efficient balance between priority service provisioning and bursty traffic processing compared to other state-of-the-art methods. In addition, the proposed method results in better-balanced network performance metrics, such as queue length, packet delay, and packet loss, thus efficiently supporting various applications that generate bursty traffic randomly.

Keywords:

Bursty traffic

queue scheduling

Whittle index

Real-Time Priority Queue Scheduling for Bursty Traffic

Abstract

Journal

Organization