Sojourn times and the overtaking condition in Jacksonian networks

Abstract

Consider an open multiclass Jacksonian network in equilibrium and a path such that a customer travelling along it cannot be overtaken directly by a subsequent arrival or by the effects of subsequent arrivals. Then the sojourn times of this customer in the nodes constituting the path are all mutually independent and so the total sojourn time is easily calculated. Two examples are given to suggest that the non-overtaking condition may be necessary to ensure independence when there is a single customer class.

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 — 99 citations exist upstream.

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