Abstract:
The Lyapunov–Yablonsky approach has been used to construct a mathematical model of the service process of conflicting input flows in the class of cyclic algorithms with re-adjustments. To define input flows with dependent inter-arrival intervals, a non-local description has been used. The flowcharts, information, coordinates, and function of the queueing system have been selected and described non-locally. A multi-dimensional Markov chain has been constructed with an uncountable measurable state space, which describes changes in the server state, fluctuations in the queue size, and states of the input flows. Some properties of the stochastic transition kernel have been established.