On Real Queue Length in a Queueing System with Erlang-r service time

In this paper, we consider a system, which, according to the Kendall classification, is denoted by M/E
_r
/1. The article is also dedicated to one of the approaches of studying the systems that do not have Markov property. For one of these system the main characteristics are given and, in addition, for the first time the concept of a real queue is considered. The relevance of this study is determined by the wide use of such models in the industrial engineering and traffic engineering problems. A description of the construction of a simulation model in the AnyLogic system is given, the main characteristics are calculated and compared with the results of analytical modeling.