Skip to main content
Article thumbnail
Location of Repository

Transient and stationary characteristics of a packet buffer modelled as an MAP/SM/1/b system

By Rusek Krzysztof, Janowski Lucjan and Papir Zdzisław

Abstract

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. 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

Topics: router interface, Markovian arrival process, semi-Markov service time, hidden Markov model, finite-buffer queue, packet loss, first passage time, Mathematics, QA1-939, Electronic computers. Computer science, QA75.5-76.95
Publisher: De Gruyter Open
Year: 2014
DOI identifier: 10.2478/amcs-2014-0033
OAI identifier: oai:doaj.org/article:e0ed91a396bc49b0806e2a14ffa9cbf1
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/2083-8492 (external link)
  • http://www.degruyter.com/view/... (external link)
  • https://doaj.org/article/e0ed9... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.