Dynamic routing to heterogeneous collections of unreliable servers
Dynamic routing to heterogeneous collections of unreliable servers
复制标题
动态路由到不可靠服务器的异构集合
DOI：
10.1007/s11134-006-9002-9
复制
发表时间：
2007
期刊：
影响因子：
1.2
通讯作者：
C. Kirkbride
中科院分区：
文献类型：
--
作者：
K. Glazebrook;C. Kirkbride
我们论证了在服务器具有不同特征且容易出现故障的环境中，关于服务任务的动态路由问题的重要性。我们提出了一个一般模型，在该模型中，每台机器的服务时间和维修时间都服从某种一般分布。路由决策考虑了队列长度、机器状态(运行或停机)、服务作业经过的处理时间以及任何正在进行的机器维修的时间。我们开发了一种机器校准的方法，该方法产生一个机器指数，该指数是所有上述信息的函数。将所有任务路由到当前索引最小的机器的启发式算法执行得非常好。本文的方法是灵活的，能够为基本模型的一系列变体产生强执行的路由策略。这些情况包括作业处理在每次故障时丢失，以及可能只能部分观察到机器状态。
We argue the importance of problems concerning the dynamic routing of tasks for service in environments where the servers have diverse characteristics and are subject to breakdown. We propose a general model in which both service times and repair times at each machine are i.i.d.with some general distribution. Routing decisions take account of queue lengths, machine states (up or down), the elapsed processing times of jobs in service and the times to date of any machine repairs in progress. We develop an approach to machine calibration which yields a machine index which is a function of all of the preceding information. The heuristic which routes all tasks to the machine of current smallest index performs outstandingly well. The approach of the paper is flexible and is capable of yielding strongly performing routing policies for a range of variants of the basic model. These include cases where job processing is lost at each breakdown and where the machine state may be only partially observed.