You are not currently logged in.
Access JSTOR through your library or other institution:
Maximum Entropy Analysis of Open Queueing Networks with Group Arrivals
The Journal of the Operational Research Society
Vol. 43, No. 11 (Nov., 1992), pp. 1063-1078
Stable URL: http://www.jstor.org/stable/2584103
Page Count: 16
You can always find the topics here!Topics: Customers, Entropy, Queueing networks, Vacations, Operations research, Simulations, Coefficients, Probability distributions, Network servers, Modeling
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This paper deals with open queueing networks with group arrivals in continuous time and discrete time. By using the method of entropy maximization, an equivalent single customer arrival process is obtained and the results are then applied to study a variety of queueing systems. As extensions to queueing networks, the following cases are investigated: single-server nodes in continuous time and discrete time, multiple exponential-server nodes in continuous time, and single exponential-server nodes with finite capacity in continuous time. Several examples are included for illustration.
The Journal of the Operational Research Society © 1992 Operational Research Society