RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 2023 Volume 59, Issue 1, Pages 71–79 (Mi ppi2392)

This article is cited in 5 papers

Communication Network Theory

Batch poissonian arrival models of multiservice network traffic

B. Ya. Lichtzindera, A. Yu. Privalovb, V. I. Moiseevc

a Povolzhskiy State University of Telecommunications and Informatics, Samara, Russia
b Korolyov Samara National Research University, Samara, Russia
c Perm State National Research University, Perm, Russia

Abstract: 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.

Keywords: queueing systems, batch Poissonian arrival flow, batch (nonordinary) arrivals, constant service time queues.

UDC: 621.391 : 519.872.6

Received: 18.12.2022
Revised: 27.02.2023
Accepted: 27.02.2023

DOI: 10.31857/S0555292323010060


 English version:
Problems of Information Transmission, 2023, 59:1, 63–70


© Steklov Math. Inst. of RAS, 2026