E. Hyytiä, R. Righter and S. G. Samúelsson, Beyond the shortest queue routing with heterogeneous servers and general cost function, in ValueTools, 2017.
Abstract: Routing jobs to parallel servers is a common and important task in today's computer systems. Join-the-shortest-queue (JSQ) routing minimizes the mean response time under rather general settings as long as the servers are identical and service times are independent and exponentially distributed. Apart from this, surprisingly few optimality results exist, mainly due to the complexities arising from the infinite state spaces. Indeed, it is difficult to analyze the performance of any given routing policy. In this paper, we consider an elementary job routing problem with heterogeneous servers and a general cost structure. By a novel approximation, we reduce the state space to finite size, which enables us to estimate the mean performance, and to determine (practically) optimal routing policies, for a large class of cost structures. We demonstrate the approximation and its application to optimization in numerical examples.
Links:
BibTeX entry:
@inproceedings{hyytia-valuetools-2017,
title = {Beyond the shortest queue routing with heterogeneous servers and general cost function},
author = {Esa Hyyti{\"a} and Rhonda Righter and Sigur{\dh}ur Gauti Sam{\'u}elsson},
booktitle = {ValueTools},
year = {2017},
month = {Dec.},
doiopt = {10.1145/3150928.3150946},
}