Analysis of the Amount of Information in Semi-Markov Flow

Anatoly Nazarov, Alexander Moiseev, Ivan Lapatin, Svetlana Paul, Olga Lizyura, Pavel Pristupa, Xi PENG, Li Chen, Bo BAI
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 aim of the current paper is to investigate the amount of information received in semi-Markov flow. We use asymptotic analysis method under the limit condition of growing time of observation to derive limiting probability distribution of the amount of information received in the flow and build its approximation.