Optimal Routing to M parallel queues with no buffers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1999

Optimal Routing to M parallel queues with no buffers


In this paper we study the assignment of packets to M parallel heterogeneous servers with no buffer. The controller does not have knowledge on the state of the servers and bases all decisions on the number of time slots ago that packets have been sent to the different servers. The objective of the controller is to minimize the expected average cost. We consider a general stationary arrival process, with no independence assumptions. We show that the problem can be transformed into a Markov Decision process (MDP). We further show under quite general conditions on cost functions that only a finite number of states have to be considered in this MDP, which then implies the optimality of periodic policies. For the case of two servers we obtain a more detailed structure of the cost and optimal policies. In particular we show that the average cost function is multimodular. Finally we present an application to optimal robot scheduling for web search engines.
No file

Dates and versions

inria-00098807 , version 1 (26-09-2006)


  • HAL Id : inria-00098807 , version 1


Eitan Altman, Sandjai Bhulai, Bruno Gaujal, Arie Hordijk. Optimal Routing to M parallel queues with no buffers. 33rd Allerton Conference on Communication, Control, & Computing, 1999, Allerton, Illinois/USA, 10 p. ⟨inria-00098807⟩
208 View
0 Download


Gmail Facebook Twitter LinkedIn More