登入選單
返回Google圖書搜尋
Approximate Models for Central Server Systems with Two Job Types
註釋Two new approximation techniques for describing the performance of a closed queueing network when two or more job types are present are introduced and analyzed. The approximations apply in cases where a product form steady state solution can not be obtained, for example in the first-come-first served single server queue case. This approximation provides a method of reducing the state space to a small fraction of that needed for an implementation of the Gaver-Humfeld method. Numerical results illustrate the excellent accuracy of these techniques. (Author).