Efficient implementation of relative differentiated services using proportional probabilistic priority

Abstract

This paper studies the design and performance of the Probabilistic Priority (PP) [5] packet scheduling algorithm to schedule packets. Unlike an earlier design that uses fractional arithmetic and prohibits large number of classes, we present an integer PP algorithm and show that PP turns out to be a special scheme of applying lottery scheduling [10] to bandwidth allocation in a strict priority sense. We then propose a Multiwinner PP (MPP) scheduler using multi-winner lottery scheduling to improve the throughput and response time accuracy and a flexible ticket transfer algorithm to improve the deadline violation probability in probabilistic scheduling. Finally, we investigate the issue of parameter assignment for an MPP scheduler and use our techniques to implement a prototype Assured Forwarding (AF) mechanism.