Number of Emergency Units Busy at Alarms Which Require Multiple Servers

by Jan M. Chaiken

Download

Download Free Electronic Document

FormatFile SizeNotes
PDF file 0.4 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.

Purchase

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback24 pages $20.00 $16.00 20% Web Discount

Calls for service arrive at an infinite-server queue according to a mixture of Poisson processes. Service for each process occurs in a number of independent stages; stages are identified by the number of emergency units busy serving the call. Assuming arbitrary finite mean-service-time distributions, the distribution of the number of busy units at any time is determined, and the approach to a steady-state distribution is proved. (See also R-532, R-533, R-567.)

This report is part of the RAND Corporation Report series. The report was a product of the RAND Corporation from 1948 to 1993 that represented the principal publication documenting and transmitting RAND's major research findings and final research.

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.