Sniff: Optimum Psp For Sorted Priority Fair Queuing

摘要

This paper discusses the packet scheduling problem in the context of providing guaranteed service quality in IP based Network. Smallest Middle-point Finishing time First, or termed SMFF, is proposed as a new packet selection policy for sorted priority based schedulers and analyzed. Under certain conditions, SMFF is demonstrated as the optimum packet selection policy for sorted priority based packet schedulers.