다종류(多種類)의 고객을 지닌 폐쇄형(閉鎖型) 대기행렬 네트워크 모형(模型)의 출력률(出力率) 한계(限界)

On the Throughput Bounds of the Closed Queueing Networks with Multiple Classes of Customers

The exact solution of the closed queueing networks(CQN) is known only for the product form (BCMP) queueing networks. Various computational algorithms are available to derive system throughput(the rate at which a system completes units of computational work) of the networks. However, the computational expense of an exact solution is often excessive when there are multiple classes of cutomers. Instead of computing the exact values, it may be sufficient to derive bounds on the performance measures. Techniques for obtaining bounds on BCMP queueing networks have appeared in the past years. This paper also presents bounds on throughput in CQN models with multiple classes of customers.