この論文をさがす
説明
<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>
収録刊行物
-
- Probability in the Engineering and Informational Sciences
-
Probability in the Engineering and Informational Sciences 6 (2), 201-216, 1992-04
Cambridge University Press (CUP)
- Tweet
キーワード
詳細情報 詳細情報について
-
- CRID
- 1360011145806060800
-
- ISSN
- 14698951
- 02699648
-
- データソース種別
-
- Crossref
- OpenAIRE