The emergence of packet-switched communication networks has made it clear that Poissonian arrival flow models are not quite adequate and required the development of new models based on non-Poisson distributions. This paper is devoted to the analysis of a particular case of a batch Markovian flow, namely, batch (nonordinary) Poissonian arrivals. Such a flow is stationary and memoryless but not ordinary. We consider a class of queueing systems with constant service time. We present results of analytical computations of arrival flow parameters and also simulation results. We show that the variance of the queue depends on the third moment of the batch size in a batch Poissonian arrival flow.

分组交换通信网络的出现清楚地表明泊松到达流模型还不够充分，需要开发基于非泊松分布的新模型。本文致力于分析批量马尔可夫流的特殊情况，即批量（非普通）泊松到达。这样的流动是静止的、无记忆的，但并不普通。我们考虑一类具有恒定服务时间的排队系统。我们给出了到达流参数的分析计算结果以及模拟结果。我们表明，队列的方差取决于批量泊松到达流中批量大小的三阶矩。