A packet scheduling discipline for supporting real-time applications

Packet scheduling is lone of the key mechanisms that will be employed in the network nodes (routers and switches) for supporting real-time applications in a high-speed networking environment. We propose a new frame-based packet scheduling algorithm which calculates and keeps an index for each flow in order to keep track of instantaneous bursts. With this approach, flows with small bandwidth shares which might be in need of momentary service can be detected. Our algorithm can be considered as a version of WRR with improved delay characteristics. After an introduction to packet scheduling issues, we describe the operation of our algorithm. We then give some simulation results showing the delay performance of the proposed algorithm under various traffic loads and show that the proposed algorithm has a better delay performance.