TY - GEN
A1 - Rusek, Krzysztof
A1 - Janowski, Lucjan
A1 - Papir, Zdzisław
A2 - Makowski, Ryszard - ed.
A2 - Zarzycki, Jan - ed.
PB - Zielona Góra: Uniwersytet Zielonogórski
N2 - A packet buffer limited to a fixed number of packets (regardless of their lengths) is considered. The buffer is described as a finite FIFO queuing system fed by a Markovian Arrival Process (MAP) with service times forming a Semi-Markov (SM) process (MAP/SM/1/b in Kendall`s notation). Such assumptions allow us to obtain new analytical results for the queuing characteristics of the buffer.
N2 - In the paper, the following are considered: the time to fill the buffer, the local loss intensity, the loss ratio, and the total number of losses in a given time interval. Predictions of the proposed model are much closer to the trace-driven simulation results compared with the prediction of the MAP/G/1/b model.
L1 - http://www.zbc.uz.zgora.pl/Content/78957/AMCS_2014_24_2_17.pdf
L2 - http://www.zbc.uz.zgora.pl/Content/78957
KW - router interface
KW - Markovian arrival process
KW - semi-Markov service time
KW - hidden Markov model
KW - finite-buffer queue
KW - packet losses
KW - first passage time
T1 - Transient and stationary characteristics of a packet buffer modelled as an MAP/SM/1/b system
UR - http://www.zbc.uz.zgora.pl/dlibra/docmetadata?id=78957
ER -