The \(N \times D\)-\(BMAP/G/1\) queueing model: queue contents and delay analysis (Q410368)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The \(N \times D\)-\(BMAP/G/1\) queueing model: queue contents and delay analysis |
scientific article; zbMATH DE number 6021081
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \(N \times D\)-\(BMAP/G/1\) queueing model: queue contents and delay analysis |
scientific article; zbMATH DE number 6021081 |
Statements
The \(N \times D\)-\(BMAP/G/1\) queueing model: queue contents and delay analysis (English)
0 references
3 April 2012
0 references
Summary: We consider a single-server discrete-time queueing system with \(N\) sources, where each source is modelled as a correlated Markovian customer arrival process, and the customer service times are generally distributed. We focus on the analysis of the number of customers in the queue, the amount of work in the queue, and the customer delay. For each of these quantities, we will derive an expression for their steady-state probability generating function, and from these results, we derive closed-form expressions for key performance measures such as their mean value, variance, and tail distribution. A lot of emphasis is put on finding closed-form expressions for these quantities that reduce all numerical calculations to an absolute minimum.
0 references
0 references
0 references
0 references