Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T10:08:57.499Z Has data issue: false hasContentIssue false

A bivariate Poisson queueing process that is not infinitely divisible

Published online by Cambridge University Press:  24 October 2008

D. J. Daley
Affiliation:
Department of Statistics, Institute of Advanced Studies, The Australian National University
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We are using the term ‘bivariate Poisson process’ to describe a bivariate point process (N1(.), N2(.)) whose components (or, marginal processes) are Poisson processes. In this we are following Milne (2) who amongst his examples cites the case where N1(.) and N2(.) refer to the input and output processes respectively of the M/G/∈ queueing system. Such a bivariate point process is infinitely divisible. We shall now show that in a stationary M/M/1 queueing system (i.e. Poisson arrivals at rate λ, exponential service at rate µ > λ, single-server) a similar identification of (N1(.), N2(.)) yields a bivariate Poisson process that is not infinitely divisible.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1972