By Topic

A Simple Learning Scheme for Priority Assignment at a Single-Server Queue

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

1 Author(s)
Kumar, P.R.S. ; Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY 12180, USA now with the Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60201

A simple fixed structure learning scheme is proposed for priority assignment at a single-server queue. The server processes two streams of jobs, with random service times (exponentially distributed) in which the parameters are unknown at the start. The optimal priority assignment is asymptotically learned with arbitrary accuracy by properly choosing the algorithm parameters. The scheme has finite memory and is easily implementable. Simulations results are included.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:16 ,  Issue: 5 )