首页> 外文会议>2011 5th International Conference on Network Games, Control and Optimization >Queues with M/G/∞ input: A survey and some new results
【24h】

Queues with M/G/∞ input: A survey and some new results

机译:具有M / G /∞输入的队列:调查和一些新结果

获取原文

摘要

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 /∞输入模型的类别,同时保留了相应排队系统的解析可处理性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号