Priority queueing system with fixed-length packet-train arrivals
Priority queueing system with fixed-length packet-train arrivals
复制标题
DOI：
10.1049/ip-com:19982288
复制
发表时间：
1998-10
期刊：
影响因子：
--
通讯作者：
B. Choi;D. Choi;Yutae Lee;D. Sung
中科院分区：
文献类型：
--
作者：
B. Choi;D. Choi;Yutae Lee;D. Sung
研究了离散时间优先排队系统，其中两类不同的定长分组列车按独立的批次几何流到达。每个分组序列中的分组以每个时隙一个分组的速率到达(列车到达)，从而产生相关的到达流。一个分组的服务时间是一个时隙的确定性。这项工作的动机来自于具有不同业务源和相关分组到达流的ATM网络。利用概率母函数方法，得到了每类排队的联合队长分布和等待时间分布。给出了数值结果。与其中分组序列的所有分组同时到达缓冲器的情况进行了比较。
A discrete-time priority queueing system is studied, in which two different classes of fixed-length packet-trains arrive according to independent batch geometric streams. The packets in each packet-train arrive at the rate of one packet per slot (train arrivals), resulting in a correlated arrival stream. The service time of one packet is deterministic of one slot. The motivation for the work comes from ATM networks with diverse traffic sources and correlated packet arrival stream. Using the probability generating function method, the joint distribution of queue lengths and the waiting time distribution are obtained for each class. Numerical results are presented. Comparision is made with the case of ‘batch arrivals’, where all packets of a packet-train arrive simultaneously at the buffer.