Flow service order: a computationally inexpensive packet scheduling algorithm to support QoS guarantees for real-time traffic

A new strategy for scheduling packets which promises adherence to the quality of service requirements of real-time data (e.g., video) is proposed. We prove that this new algorithm bounds the interpacket delay between two packets. We also arrive at an expression that bounds the average waiting time of a packet. We then show empirical results regarding the performance of our algorithm that we obtained through simulation. A comparison is made between the performance of our algorithm vis-a-vis the previous algorithms.