Home > Research > Publications & Outputs > Dynamic routing among several intermittently av...

Research

Links

Text available via DOI:

View graph of relations

Dynamic routing among several intermittently available servers

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Dynamic routing among several intermittently available servers. / Martin, S. P.; Mitrani, I.; Glazebrook, Kevin D.
Next Generation Internet Networks, 2005. IEEE, 2005. p. 1-8.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Martin, SP, Mitrani, I & Glazebrook, KD 2005, Dynamic routing among several intermittently available servers. in Next Generation Internet Networks, 2005. IEEE, pp. 1-8. https://doi.org/10.1109/NGI.2005.1431640

APA

Martin, S. P., Mitrani, I., & Glazebrook, K. D. (2005). Dynamic routing among several intermittently available servers. In Next Generation Internet Networks, 2005 (pp. 1-8). IEEE. https://doi.org/10.1109/NGI.2005.1431640

Vancouver

Martin SP, Mitrani I, Glazebrook KD. Dynamic routing among several intermittently available servers. In Next Generation Internet Networks, 2005. IEEE. 2005. p. 1-8 doi: 10.1109/NGI.2005.1431640

Author

Martin, S. P. ; Mitrani, I. ; Glazebrook, Kevin D. / Dynamic routing among several intermittently available servers. Next Generation Internet Networks, 2005. IEEE, 2005. pp. 1-8

Bibtex

@inproceedings{d5cf1ec58bf1405b8d7e2b1a456bfa32,
title = "Dynamic routing among several intermittently available servers",
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.",
author = "Martin, {S. P.} and I. Mitrani and Glazebrook, {Kevin D.}",
year = "2005",
doi = "10.1109/NGI.2005.1431640",
language = "English",
isbn = "0-7803-8900-X",
pages = "1--8",
booktitle = "Next Generation Internet Networks, 2005",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Dynamic routing among several intermittently available servers

AU - Martin, S. P.

AU - Mitrani, I.

AU - Glazebrook, Kevin D.

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

U2 - 10.1109/NGI.2005.1431640

DO - 10.1109/NGI.2005.1431640

M3 - Conference contribution/Paper

SN - 0-7803-8900-X

SP - 1

EP - 8

BT - Next Generation Internet Networks, 2005

PB - IEEE

ER -