This chapter discusses Palm calculus and its applications to various processes including queues and their networks. We aim to explain basic ideas behind this calculus. Since it differs from the classical approach using Markov processes, we scratch from very fundamental facts. The main target of Palm calculus is stationary processes, but we are also interested in its applications to Markov processes. For this, we consider piece-wise deterministic processes and reallocatable generalized Markov processes, RGSMP for short, and characterize their stationary distributions using Palm calculus. In particular, the insensitive structure of RGSMP with respect to the lifetime distributions of its clocks is detailed. Those results are applied to study the insensitive structure of product form queueing networks with respect to service requirement distributions.
CITATION STYLE
Miyazawa, M. (2011). Palm calculus, reallocatable GSMP and insensitivity structure. In International Series in Operations Research and Management Science (Vol. 154, pp. 141–215). Springer New York LLC. https://doi.org/10.1007/978-1-4419-6472-4_4
Mendeley helps you to discover research relevant for your work.