Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks
Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks
复制标题
分组网络中具有不耐烦和准入控制的重尾M/G/1-PS队列
DOI：
--
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
B. Zwart
中科院分区：
文献类型：
--
作者：
Jacqueline Boyer;Fabrice Michel Guillemin;P. Robert;B. Zwart
在本文中，我们分析了M/G/1处理器共享队列与重型尾部服务以及不耐烦的客户。假定不耐烦取决于所需服务的价值。我们证明，当队列容量是有限的或无限的时，降低的服务率（RSR）近似可用于估计系统中客户的逗留时间。这使我们能够在服务时间较大的情况下评估客户的叛逆概率。然后，我们使用这些结果来研究入学控制对数据包网络链接的影响。入场控制仅包括限制同时连接的数量。事实证明，系统的效率可以进行录取控制，这是一个真正的好处：它在全球范围内增加了完成服务的客户的比例（即不耐烦）。最后，我们调查了系统的公平性，并提出了一个评估系统能力的标准，以便完成非常大的服务时间。
In this paper we analyze the M/G/1 processor sharing queue with heavy tailed services and with impatient customers. It is assumed that impatience depends on the value of the service required. We prove that a reduced service rate (RSR) approximation holds for estimating the sojourn time of a customer in the system, when the queue capacity is finite or infinite. This allows us to evaluate the reneging probability of customers with very large service times. We then use these results to investigate the impact of admission control on a link of a packet network. Admission control simply consists of limiting the number of simultaneous connections. It turns out that there is a real benefit for the efficiency of the system to perform admission control: It globally increases the fraction of customers, who complete their service (i.e. without being impatient). Finally, we investigate the fairness of the system and propose a criterion to assess the capacity of the system so as to allow the completion of very large service times.