A scheduling method for bounded delay services in high speed networks

As one of the most demanding applications in high speed networks, real-time services, such as audio and video, have stringent requirements on quality of service (QoS) guarantee, especially the bounded end-to-end delay and delay variations. Accordingly, the real-time services with deterministically bounded delay have been widely studied. The key is to design efficient scheduling algorithms. In this paper, a scheduling method, referred to as static-rotating-priority-queues (SRPQ), is proposed. Exact schedulability conditions for the method, which is important for call admission control, is also presented. The most desirable features of this method are its low complexity and reduced number of first-in-first-out (FIFO) queues in a scheduler while providing high bandwidth utilization