DocumentCode
3332303
Title
Packet Loss Process in a Queue with Markovian Arrivals
Author
Chydzinski, Andrzej
Author_Institution
Inst. of Comput. Sci., Silesian Univ. of Technol., Gliwice
fYear
2008
fDate
13-18 April 2008
Firstpage
524
Lastpage
529
Abstract
In this report, a detailed analysis of the packet loss process in a finite-buffer queue fed by the Markovian arrival process (MAP) is shown. The results consist of both transient and stationary characterization of the loss process in terms of the loss ratio, the number of packets lost per time unit and the number of losses in an interval of a given length. In addition to the analytical results, a number of numerical examples based on an IP traffic trace file are presented.
Keywords
IP networks; Markov processes; queueing theory; IP traffic trace file; Markovian arrival process; finite-buffer queue; packet loss process; stationary characterization; transient characterization; Autocorrelation; Buffer overflow; Computer networks; Delay; Internet; Performance loss; Queueing analysis; Spine; Telecommunication traffic; Traffic control; Markovian arrival process; finite-buffer queue; packet loss characteristics;
fLanguage
English
Publisher
ieee
Conference_Titel
Networking, 2008. ICN 2008. Seventh International Conference on
Conference_Location
Cancun
Print_ISBN
978-0-7695-3106-9
Electronic_ISBN
978-0-7695-3106-9
Type
conf
DOI
10.1109/ICN.2008.104
Filename
4498214
Link To Document