DocumentCode :
1742834
Title :
Characteristics of successive loss process
Author :
Miyata, Teruko ; Fukuda, Harumoto ; Ono, Satoshi
Author_Institution :
NTT Inf. Sharing Platform Labs., Tokyo, Japan
fYear :
2001
fDate :
2001
Firstpage :
663
Lastpage :
667
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
Keywords :
Internet; Markov processes; delays; losses; packet switching; FEC; Internet; Markov chain; burst duration; long-lived durations; low ordered Markov chains; optimal order; packet delay; quiescent duration; real-time streaming audio applications; search range; successive packet loss; timed-transitional states; Delay; Error correction; Forward error correction; Internet; Laboratories; Streaming media;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Networking, 2001. Proceedings. 15th International Conference on
Conference_Location :
Beppu City, Oita
Print_ISBN :
0-7695-0951-7
Type :
conf
DOI :
10.1109/ICOIN.2001.905536
Filename :
905536
Link To Document :
بازگشت