Multi-Class Queueing Networks with Blocking

具有阻塞的排队网络在计算机系统、分布式系统和通信系统的性能研究中经常出现。尽管它们具有潜在的适用性，但它们的使用并不广泛。这主要是由于缺乏分析这类系统的综合工具。本研究旨在通过开发具有阻塞的多类别排队网络的分析算法来纠正这种情况。到目前为止，在公开的文献中还没有对这种多类排队网络进行研究。为了实现这一目标，将首先分析小配置。这些配置将以合并、分割和串联多类排队网络的形式进行，并带有阻塞。然后将从这些配置的分析中获得的结果和经验进行整合，以便获得任意配置的解决方案技术。最后，这些解决技术将被纳入现有的算法一般排队网络，以进一步提高其实用性。

Queueing networks with blocking frequently arise in performance studies of computer systems, distributed systems, and communication systems. Despite their potential applicability, their use is not widespread. This is mainly due to the absence of comprehensive tools for analyzing such systems. This research aims at rectifying this situation by developing algorithms for the analysis of multi-class queueing networks with blocking. So far, such multi-class queueing networks have not been studied in the open literature. In order to achieve this objective, small configurations will be analyzed first. These configurations will be in the form of merge, split, and tandem multi-class queueing networks with blocking. The results and experience obtained from the analysis of these configurations will then be consolidated in order to obtain solution techniques for arbitrary configurations. Finally, these solution techniques will be incorporated into existing algorithms for general queueing networks, in order to further increase their usefulness.