As input traffic at various nodes in packet switched telecommunication networks typically exhibits considerable correlation, there is a continuing interest in queuing systems with correlated arrivals. The class of M/G/∞ arrival models can account for various types of arrival correlation, has a two-level structure which is appealing in the context of network protocol stacks, and is characterised by only few parameters. Moreover, queues with M/G/∞ input prove to be amenable for a classic queuing analysis. In view of these characteristics, it is not surprising that these models have attracted considerable attention in the past. In this paper, we survey the literature on M/G/∞ type queuing systems, present some new results on these systems, and extend the class of M/G/∞ input models, while retaining the analytic tractability of the corresponding queuing systems.
展开▼
机译：由于分组交换电信网络中各个节点处的输入流量通常表现出相当大的相关性，因此对具有相关到来的排队系统存在持续兴趣。 M / G /∞到达模型的类可以解释各种类型的到达相关性，在网络协议堆栈的上下文中具有两个级别的结构，其特征在于少数参数。此外，具有M / g /∞输入的队列证明是可用于经典排队分析的次数。鉴于这些特征，这些模型在过去引起了相当大的关注并不令人惊讶。在本文中，我们在M / G /∞型排队系统上调查文献，在这些系统上展示了一些新结果，并扩展了M / G /∞输入模型的类，同时保留了相应排队系统的分析陶器。
展开▼
