Formulas and representations for cyclic Markovian networks via Palm calculus

DOI10.1023/A:1019125006567zbMath0901.60069OpenAlexW2103363847MaRDI QIDQ1378856

Michael A. Zazanis

Publication date: 9 February 1998

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1019125006567

zbMATH Keywords

Palm probabilitiesexchangeablestationary point processescycle time distributionclosed queueing networksMarkovian networks

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (3)

An invariance property of sojourn times in cyclic networks ⋮ Cycle times in single server cyclic Jackson networks. ⋮ THE TIME-TO-EMPTY FOR TANDEM JACKSON NETWORKS

This page was built for publication: Formulas and representations for cyclic Markovian networks via Palm calculus