By Topic

An optimal service scheduling policy for packet networks with quality of service guarantees

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
$33 $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

1 Author(s)
Tao Yang ; Dept. of Ind. Eng., Tech. Univ. of Nova Scotia, Halifax, NS

In this paper, we propose a measurement-based service scheduling policy, called the D-policy, for high-speed packet networks with quality of service guarantees. We show that the D-policy is optimal with respect to channel efficiency among all stable scheduling policies. We examine the properties of the D-policy and show how these properties can be used to compute the minimum bandwidth required for a given traffic scenario. We also compare the D-policy with other policies such as the first-come-first-served, static priority, and weighted round robin through simulation studies

Published in:

Global Telecommunications Conference, 1996. GLOBECOM '96. 'Communications: The Key to Global Prosperity  (Volume:3 )

Date of Conference:

18-22 Nov 1996