Optimal routing among ./M/1 queues with partial information - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2003

Optimal routing among ./M/1 queues with partial information


When routing dynamically randomly arriving messages, the controller of a high-speed communication network very often gets the information on the congestion state of down stream nodes only after a considerable delay, making that information irrelevant at decision epochs. We consider the situation where jobs arrive according to a Poisson process and must be routed to one of two (parallel) queues with exponential service time distributions (possibly with different means), without knowing the congestion state in one of the queues. However, (the conditional) probability distribution of the state of the unobservable queue can be computed by the router. We derive the joint probability distribution of the congestion states in both queues as a function of the routing policy. This allows us to identify optimal routing schemes for two types of frameworks: global optimization, in which the weighted sum of average queue lengths is minimized, and individual optimization, in which the goal is to minimize the expected delay of individual jobs.
Fichier principal
Vignette du fichier
RR-4985.pdf (775.44 Ko) Télécharger le fichier

Dates and versions

inria-00071593 , version 1 (23-05-2006)


  • HAL Id : inria-00071593 , version 1


Eitan Altman, T. Jiménez, R. Núñez-Queija, U. Yechiali. Optimal routing among ./M/1 queues with partial information. RR-4985, INRIA. 2003. ⟨inria-00071593⟩
67 View
265 Download


Gmail Facebook Twitter LinkedIn More