Skip to Main content Skip to Navigation

Optimal Routing Policy in Two Deterministic Queues

Bruno Gaujal 1 Emmanuel Hyon 1 
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We consider the problem of routing customers to one of two parallel queues where inter-arrival times and service times are deterministic. We provide an explicit formula for the average waiting time of the customers sent to one of the queues when the routing policy is an upper mechanical word. This formula is based on a special continued fraction decomposition of the service time in the queue. Using this formula we provide an algorithm computing the optimal routing policy for two queues. In general, this policy is an upper mechanical word with a rational ratio, and hence is periodic.
Document type :
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:29:43 AM
Last modification on : Friday, February 4, 2022 - 3:21:52 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:16:57 PM


  • HAL Id : inria-00072648, version 1



Bruno Gaujal, Emmanuel Hyon. Optimal Routing Policy in Two Deterministic Queues. [Research Report] RR-3997, INRIA. 2000. ⟨inria-00072648⟩



Record views


Files downloads