Abstract
We discuss two characteristics of successive packet loss. Firstly, we show a method of providing a search range of the order for a given Markov chain from investigations of successive packet loss. The process of packet loss is generally modeled as low ordered Markov chains. However, we have to set a proper range to evaluate which orders is better as an optimal order of a given Markov chain. Our method can reduce exceeding the calculation or states of Markov chain and we can find an optimal order in the search range applying our experimental data. Next, we also find one model for the process of successive packet loss. This model consisted of three timed-transitional states of an m-th order Markov chain (m=0, 1, 2). Accordingly, modeling the process for successive packet loss, two long-lived durations such as quiescent and burst on time scales of hours exist. We propose another new model that categorizes the part of the burst more precisely as two parts of low ordered Markov chains.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
