Optimal Routing Policy in Two Deterministic Queues - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

Optimal Routing Policy in Two Deterministic Queues

Bruno Gaujal
Emmanuel Hyon
  • Function : Author
  • PersonId : 755811
  • IdRef : 074658417

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-3997.pdf (240.8 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00072648 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00072648 , version 1

Cite

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

Share

Gmail Facebook X LinkedIn More