Waiting-time analysis of D-BMAP/G/1 queueing system
DOI10.1007/s10479-015-1974-6zbMath1429.90016OpenAlexW1651873604MaRDI QIDQ2288977
Publication date: 20 January 2020
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1974-6
rootsprobability generating functionqueuewaiting-time distributiondiscrete-time batch Markovian arrival process (D-BMAP)
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simple and complete computational analysis of MAP/R/1 queue using roots
- A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
- A simple eigenvalue method for low-order D-BMAP/G/1 queues
- Sojourn time distributions in the queue defined by a general QBD process
- Analytic computation schemes for the discrete-time bulk service queue
- New results on the single server queue with a batch markovian arrival process
- The N/G/1 queue and its detailed analysis
- Simultaneity in discrete-time single server queues with Bernoulli inputs
- Statistical multiplexing of VBR sources: A matrix-analytic approach
- Robustness of Rootfinding in Single-Server Queueing Models
- Algorithms for computing waiting time distributions under different queue disciplines for the D-BMAP/PH/1
- A simple approach to the map/d/s queue
- Spectral analysis of M/G/1 and G/M/1 type Markov chains
- A SUCCESSIVE LUMPING PROCEDURE FOR A CLASS OF MARKOV CHAINS
- DES AND RES PROCESSES AND THEIR EXPLICIT SOLUTIONS
- A COMPUTATIONAL METHOD FOR THE BOUNDARY VECTOR OF A BMAP/G/1 QUEUE
This page was built for publication: Waiting-time analysis of D-BMAP/G/1 queueing system