Abstract
This paper presents a numerical solution to multichannel queueing systems with ordered entry and finite or infinite source. Two computer programs are developed to determine the optimal allocation of storage spaces among three heterogeneous servers. Bounds on the sizes of finite sources are determined for different values of traffic intensities. All state probabilities, utilizations of servers, overflow probabilities, and other measures of performance are given in the output of the computer programs.
Original language | English (US) |
---|---|
Pages (from-to) | 213-222 |
Number of pages | 10 |
Journal | Computers and Operations Research |
Volume | 10 |
Issue number | 3 |
DOIs | |
State | Published - 1983 |
All Science Journal Classification (ASJC) codes
- General Computer Science
- Modeling and Simulation
- Management Science and Operations Research