By Topic

Dynamic routing among several intermittently available servers

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

3 Author(s)
Martin, S.P. ; Sch. of Comput. Sci., Newcastle Univ., NSW, Australia ; Mitrani, I. ; Glazebrook, K.D.

We examine the problem of how best to route jobs among a number of queues whose servers are subject to random periods of unavailability. The optimal routing policy is computed by modelling the system as a discrete-time, finite-state Markov decision process and solving the resulting dynamic programming equations. In a series of numerical experiments, the performance of various heuristic policies is compared with that of the optimal policy. A particular heuristic, using an 'index policy', is shown to be close to optimal.

Published in:

Next Generation Internet Networks, 2005

Date of Conference:

18-20 April 2005