Poisson Departure Processes and Queueing Networks

Queueing models with dffferent classes of customers are considered which have the property that when the arrival process for each class of customers is Poisson then the departure process for each class of customers is Poisson. A sufficient but very general condition for a queueing system to have this property is given and illustrated with examples. Several of these examples are models which were not previously known to have a Poisson departure process. Networks of queues models in which each component queue satisfies the above condition are shown to have very simple solutions for their equilibrium state probabilities.

By: Richard R. Muntz

Published in: RC4145 in 1972


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .