Optimal routing in two parallel queues - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Optimal routing in two parallel queues

Résumé

This paper deals with the problem of the computation of the optimal routing sequence in a queuing system made of two parallel queues with exponential service times. The optimal policy (minimizing the expected waiting time) is a Sturmian sequence. An algorithm to compute the optimal routing sequence is proposed together with an extensive set of experiments which show several interesting features of the optimal policy with apparent discontinuities and a fractal behavior. Several good approximations using fast heuristics are given at the end.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00100135 , version 1

Citer

Bruno Gaujal, Emmanuel Hyon, Alain Jean-Marie. Optimal routing in two parallel queues. WODES'04: 7th Workshop on Discrete Event Systems, 2004, Reims, France. pp.6. ⟨inria-00100135⟩
162 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More