Design and analysis for a delay‐bounded fair queueing algorithm

Abstract

In this paper, we propose a fair resource reservation and scheduling algorithm for delay‐bounded services. User applications initiate the requests by specifying the tolerable delay and priorities. Packets are scheduled according to the requirements negotiated during the resource reservation phase. Instead of tracking the fair utilization before the packet can be served in WFQ, the bandwidth share is monitored after the packet is sent. This approach can significantly reduce the computational complexity resulting from WFQ while maintaining the long‐term fairness. Examples and simulations are illustrated to show the performance difference from WFQ.