By Topic

A cost-based scheduling algorithm to support integrated services

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

2 Author(s)
Peha, J.M. ; Dept. of Electr. Eng., Stanford Univ., CA, USA ; Tobagi, F.A.

Heuristic scheduling and dropping algorithms are presented for improving the efficiency of single packet-switched networks with diverse traffic. In the authors approach, arbitrary performance objectives are defined in the form of cost functions, which map the queueing delay experienced by each packet to a cost incurred. The algorithms, cost-based scheduling (CBS) and cost-based dropping (CBD), then attempt to optimize network performance as perceived by the applications by minimizing the total cost incurred by all packets. Cost functions are presented that are appropriate for the most common applications. Scheduling and dropping algorithms are defined based on these cost functions. It is demonstrated that network performance is better when these heuristic algorithms are used as opposed to the common alternatives. The relative importance of scheduling and dropping is also considered

Published in:

INFOCOM '91. Proceedings. Tenth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking in the 90s., IEEE

Date of Conference:

7-11 Apr 1991