DocumentCode
3210720
Title
Dynamic routing among several intermittently available servers
Author
Martin, S.P. ; Mitrani, I. ; Glazebrook, K.D.
Author_Institution
Sch. of Comput. Sci., Newcastle Univ., NSW, Australia
fYear
2005
fDate
18-20 April 2005
Firstpage
1
Lastpage
8
Abstract
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.
Keywords
Markov processes; discrete time systems; dynamic programming; network servers; queueing theory; telecommunication network routing; discrete-time system modelling; dynamic programming equation; finite-state Markov decision process; index policy; intermittently available server; optimal routing policy; Costs; Dispatching; Distributed computing; Distributed processing; Dynamic programming; Electric breakdown; Equations; Grid computing; Quality of service; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Next Generation Internet Networks, 2005
Print_ISBN
0-7803-8900-X
Type
conf
DOI
10.1109/NGI.2005.1431640
Filename
1431640
Link To Document