A brief proof demonstrating Poisson arrival distribution. The arrival of each customer is shown to be independent of anything occurring in the queue, i.e., numbers and types of servers available, discipline and distribution of service, as well as customer behavior after entering the queue or number of different types of customers. To ensure that the probability distribution of states of the queue at a given time is the same regardless of whether or not an arrival occurs at that time, two requirements are needed: (1) the state of the queue given in the past must not be dependent on the new arrival; (2) the arrival distribution must be Poisson. A corollary to the proof postulates stationary distribution. 3 pp. (KB)
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.