Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers

Abstract

We consider closed networks of interconnected service centers with multiple types of customers and multiple classes, whose stationary state probabilities at arbitrary times have a product form. A customer can change its class but not its type as it traverses the network. We show that the stationary state probabilities at instants at which customers of a particular type arrive at a particular service center and enter a particular class are equal to the stationary state probabilities at arbitrary times for the network with one less customer of that type. Applications of this result are given.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 195 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.