A New Packet Scheduling Algorithm: Minimum Starting-Tag Fair Queueing

Yen-Ping CHU  E-Hong HWANG  

IEICE TRANSACTIONS on Communications   Vol.E80-B   No.10   pp.1529-1536
Publication Date: 1997/10/25
Online ISSN: 
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Signaling System and Communication Protocol
packet scheduling algorithm,  Fair Queueing,  end-to-end delay bound,  fairness,  

Full Text: PDF(553.4KB)>>
Buy this Article

To implement the PGPS packet scheduling algorithm in high speed networks is more difficult since it is based on real time simulation of an equivalent fluid-model system leading to a higher implementation time complexity. A modified approach to PGPS is the SCFQ scheme. This scheme is easy to implement, but has an increasing end-to-end delay bound. The VC packet scheduling algorithm provides the same end-to-end delay bound as PGPS does, but has the disadvantage of unfairness. As SCFQ, SFQ is much easier to implement than PGPS and achieves the same fairness, but has a higher end-to-end delay bound than PGPS. We propose a new packet scheduling algorithm, called Minimum Starting-tag Fair Queueing (MSFQ), which assigns the virtual time to be the minimum starting tag over all backlogged connections. MSFQ is much easier to implement than PGPS and provides the same end-to-end delay bound for each connection and fairness as PGPS. In this paper, we will show the end-to-end delay bound and fairness of MSFQ and compare 5 rate-based packet scheduling algorithms including PGPS, VC, SCFQ, SFQ, and MSFQ focusing on end-to-end delay bound, fairness, and implementation time complexity.