.png){kind=icon}
返回
Discrete time GI/Geom/1 queueing system with priority
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2007.02.056.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study a discrete time single server system with generic distribution of the number of arrivals in a time slot, geometric distribution of the service time and two classes of customers. The customers can be served only when each time slot begins. The customers of the second class can be served only if the customers of the first class are absent. The model is motivated by the description of the congestion in the information networks. We give a complete description of this systems: we are able to compute the expected waiting time of the customers of the two classes, and solving a boundary value problem we are able to write the probability distribution of the length of the queue. To obtain these results, we use judiciously the standard technique of the generating function of the probability distribution. Although the boundary value problem is relatively easy, it is has to be pointed out that the generating function is not simply the product of two independent generating functions for the two classes. (c) 2007 Published by Elsevier B.V.
Keyword:
queueing theory
multiple classes systems
boundary value problem
WiMax technology
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
On discrete-time multiserver queues with finite buffer:: GI/Geom/m/N在具有有限缓冲区的离散时间多服务器队列上:: GI/Geom/m/N
PREAI
分享收藏
没有更多内容
没有更多内容