Planning, titres et résumés ici.

We define a wide class of Markovian load balancing queueing networks, including classic networks studied in the lively literature on the subject. Each network has identical single-server infinite-buffer queues and implements a load balancing policy to allocate each task at its arrival and possibly reallocate it at service completions. The purpose of the policy is to optimize server utilization under constraints such as limited information, real-time decision taking, and network topology. The queue length process is not necessarily exchangeable. The invariant law is in general not known even up to normalizing constant. We provide perfect simulation methods in view of Monte Carlo estimation of quantities of interest in equilibrium, for instance for performance evaluation. In this infinite multi-dimensional state space, we use an unusual preorder defining an order up to permutation of the coordinates, define a coupling in which networks in this class are dominated by the network with uniform routing, and implement dominated coupling from the past methods.

[The talk will be in French, but slides will be in English.]

L’orateur du seminaire donnera un expose’ introductif.

(Exceptionnellement, le séminaire aura lieu à Metz et sera diffusé en visio en salle de conférence à Nancy.)

Première de deux séances par le même orateur.

Deuxième de deux séances par le même orateur.

L’orateur presentera un article de titre ”Random polytopes and the wet part for arbitrary probability distributions”