Palm Calculus, Reallocatable GSMP and Insensitivity Structure

Masakiyo Miyazawa ()
Additional contact information
Masakiyo Miyazawa: Tokyo University of Science

Chapter Chapter 4 in Queueing Networks, 2011, pp 141-215 from Springer

Abstract: 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.

Keywords: Point Process; Lifetime Distribution; Continuous Component; Marked Point Process; Workload Process (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-1-4419-6472-4_4

Ordering information: This item can be ordered from
http://www.springer.com/9781441964724

DOI: 10.1007/978-1-4419-6472-4_4

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().