Abstract

Recently packet scheduling algorithms such as Packetized GPS (PGPS), worst-case fair weighted fair queueing (WF2Q) and Self-Clocked Fair Queueing (SCFQ) have been proposed in order to guarantee deterministic or statistical delay bounds. These algorithms are based on generalized processor sharing (GPS) which is an ideal scheduling algorithm based on fluid flow model in which the traffic is infinitely divisible. GPS provides a minimum guaranteed service rate for each session and tight delay bounds for leaky bucket constrained sessions. However, the delay bounds are unnecessarily large because each session is served according to its associated constant weight until the session buffer is empty. In this paper, we present a scheduling policy called output rate-controlled generalized processor sharing (ORC-GPS). ORC-GPS is a rate-based scheduling like GPS and controls the service rate to lower the delay bounds for leaky bucket constrained sessions. In numerical experiments, we compare ORC-GPS with GPS in terms of delay bounds.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call