In this paper, we consider semi-Markov flow as a model of bit-level traffic. Each request of the flow brings some arbitrary distributed amount of information. The current paper aims to investigate the amount of information received in semiMarkov flow. We use the asymptotic analysis method under the limit condition of growing time of observation to derive the limiting probability distribution of the amount of information received in the flow and build its approximation.
Распределенные компьютерные и телекоммуникационные сети: управление, вычисление, связь DCCN-2021 [Электронный ресурс] : материалы XXIV Международной научной конференции (20-24 сентября 2021 г., Москва, Россия). М., 2021. С. 143-147