Polling systems with correlated arrivals

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies Pub Date : 1989-04-23 DOI:10.1109/INFCOM.1989.101541

H. Levy, M. Sidi

引用次数: 18

Abstract

An analysis is made of polling systems with correlated arrivals, namely, systems in which the arrival processes of customers to the queues are not assumed to be independent. The authors consider cyclic polling systems with N queues, general service time distribution in each queue, and general switch-over times. For both the exhaustive and the gated service disciplines they derive the necessary equations for computing the N expected waiting time figures. A 'pseudo' conservation law for these systems is also derived. The analysis approach can be applied to other polling systems with correlated arrivals.<>

查看原文本刊更多论文

具有相关到达的投票系统

对具有相关到达的轮询系统进行了分析，即，不假设客户到达队列的过程是独立的系统。作者考虑具有N个队列的循环轮询系统，每个队列中的一般服务时间分布和一般切换时间。对于穷举服务和门控服务，他们推导出计算N个期望等待时间数字所需的方程。还推导了这些系统的“伪”守恒定律。该分析方法可以应用于其他具有相关到达的投票系统。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies

自引率

0.00%

发文量