Palm Calculus, Reallocatable GSMP and Insensitivity Structure

Part of the International Series in Operations Research & Management Science book series (ISOR, volume 154)


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.


Point Process Lifetime Distribution Continuous Component Marked Point Process Workload Process 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Tokyo University of ScienceTokyoJapan

Personalised recommendations