Loss Probability of a Burst Arrival Finite Queue with Synchronized Service

DOI Web Site 1 Citations

Search this article

Description

<jats:p>We are concerned with a burst arrival single-server queue, where arrivals of cells in a burst are synchronized with a constant service time. The main concern is with the loss probability of cells for the queue with a finite buffer. We analyze an embedded Markov chain at departure instants of cells and get a kind of lumpability for its state space. Based on these results, this paper proposes a computation algorithm for its stationary distribution and the loss probability. Closed formulas are obtained for the first two moments of the numbers of cells and active bursts when the buffer size is infinite.</jats:p>

Journal

Citations (1)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top