In this paper, we consider semi-Markov flow as a bit-level model of traffic. Each request of the flow brings some arbitrary distributed amount of information to the system. The current paper aims to investigate the amount of information received in semi-Markov flow during time unit. 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 the approximation of its prelimit distribution function.
Distributed computer and communication networks : 24th International Conference, DCCN 2021 Moscow, Russia, September 20–24, 2021 : revised selected papers. Cham, 2022. P. 220-232