Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Miyazawa, M. (2011). Palm Calculus, Reallocatable GSMP and Insensitivity Structure. In: Boucherie, R., van Dijk, N. (eds) Queueing Networks. International Series in Operations Research & Management Science, vol 154. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-6472-4_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-6472-4_4
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-6471-7
Online ISBN: 978-1-4419-6472-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)