By Topic

A scheduling method for bounded delay services in high speed networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xinwei Hong ; Dept. of Electron. & Inf. Eng., Huazhong Univ. of Sci. & Technol., Wuhan, China ; Hao Che ; Zailu Huang

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

Published in:

Communications, 2000. ICC 2000. 2000 IEEE International Conference on  (Volume:2 )

Date of Conference:

2000