Abstract
We consider a system where incoming jobs may be executed at different servers, each of which goes through alternating periods of being available and unavailable. Neither the states of the servers nor the relevant queue sizes are known at moments of arrival. Hence, a load balancing mechanism that relies on random time-out intervals and job transfers from one queue to another is adopted. The object is to minimize a cost function which may include holding costs and transfer costs. A model of a single queue with an unreliable server and timeouts is analyzed first. The results are then used to obtain an approximate solution for arbitrary number of queues. Several transfer policies are evaluated and compared.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adan, I., & Hooghiemstra, G. (1998). The M/M/c with critical jobs. Mathematical Methods of Operations Research, 47, 341–353.
Altman, E., & Yechiali, U. (2006). Analysis of customers’ impatience in queues with server vacations. Queueing Systems, 52, 261–279.
Ancker, C. J., & Gafarian, A. (1962). Queueing with impatient customers who leave at random. Journal of Industrial Engineering, 13, 84–90.
Flatto, L., & McLean, H. P. (1977). Two queues in parallel. Communications on Pure & Applied Mathematics, 30, 255–263.
Foley, R. D., & McDonald, D. R. (2001). Join the shortest queue: stability and exact asymptotics. Annals of Applied Probability, 11, 569–607.
Gradshtein, I. S., & Ryzhik, I. M. (1980). Table of integrals, series and products. San Diego: Academic Press.
He, Q.-M., & Neuts, M. F. (2002). Two M/M/1 queues with transfers of customers. Queueing Systems, 42, 377–400.
Martin, S. P., & Mitrani, I. (2005). Performance optimization with deadlines and job transfers. In Int. conf. on heterogeneous networks (HET-NET’05), Ilkley, 2005.
Mitrani, I., & Wright, P. E. (1994). Routing in the presence of breakdowns. Performance Evaluation, 20, 151–164.
Polyanin, A. D., & Zaitsev, V. F. (2003). Handbook of exact solutions for ordinary differential equations. Boca Raton: Chapman and Hall.
Thomas, N., & Mitrani, I. (1995). Routing among different nodes where servers break down without losing jobs. In Procs., IPDS’95, Erlangen, 1995.
Ward, A. R., & Glynn, P. W. (2003). A diffusion approximation for a Markovian queue with reneging. Queueing Systems, 43, 103–128.
Xu, S. H., & Zhao, Y. Q. (1996). Dynamic routing and jockeying controls in a two-station queueing system. Advances in Applied Probability, 28, 1201–1226.
Yechiali, U.: (2006). Service systems with impatient customers when system is down. In 2nd Madrid conference on queueing theory, 2006.
Zhao, Y., & Grassmann, W. K. (1990). The shortest queue model with jockeying. Naval Research Logistics, 37, 773–783.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Martin, S.P., Mitrani, I. Analysis of job transfer policies in systems with unreliable servers. Ann Oper Res 162, 127–141 (2008). https://doi.org/10.1007/s10479-008-0321-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-008-0321-6