Displaying similar documents to “Infinite queueing systems with tree structure”

Multiclass Hammersley–Aldous–Diaconis process and multiclass-customer queues

Pablo A. Ferrari, James B. Martin (2009)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

In the Hammersley–Aldous–Diaconis process, infinitely many particles sit in ℝ and at most one particle is allowed at each position. A particle at , whose nearest neighbor to the right is at , jumps at rate − to a position uniformly distributed in the interval (, ). The basic coupling between trajectories with different initial configuration induces a process with different classes of particles. We show that the invariant measures for the two-class process can be obtained as follows....