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.
Type de document :
Rapport
[Research Report] RR-3997, INRIA. 2000
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00072648
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 10:29:43
Dernière modification le : jeudi 11 janvier 2018 - 06:20:05
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:16:57

Fichiers

Identifiants

  • HAL Id : inria-00072648, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

184

Téléchargements de fichiers

156