Computational analysis of bulk service queue with Markovian arrival process: MAP/R^(a,b)/1 queue
DOI10.1007/S12597-013-0128-3zbMATH Open1353.90044OpenAlexW1967352043MaRDI QIDQ505201FDOQ505201
Authors: Gagandeep Singh, U. C. Gupta, M. L. Chaudhry
Publication date: 19 January 2017
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-013-0128-3
Recommendations
- A simple and complete computational analysis of MAP/R/1 queue using roots
- Analysis of the MAP/G\(^{a,b}\)/1/N queue
- Analysis of a finite-buffer bulk-service queue with discrete-Markovian arrival process: D-MAP/Ga,b/1/N
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X]}/C\)-\( MSP /1/\infty \)
- Computational analysis of single-server bulk-arrival queues: GI X/M/1
queueingrootsbatch servicegeneral bulk service ruleMarkovian arrival process (MAP)matrix-exponential (ME)phase-type (PH)rational Laplace-Stieltjes transformqueue-length
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)
Cites Work
- Robustness of Rootfinding in Single-Server Queueing Models
- Title not available (Why is that?)
- A Simple and Extended Computational Analysis of M/Gj(a,b)/1 and M/Gj(a,b)/1/(B + b) Queues Using Roots
- Computational analysis of steady-state probabilities of \(M/G^{a,b}/1\) and related nonbulk queues
- Applications of bulk queues to group testing models with incomplete identification
- A General Class of Bulk Queues with Poisson Input
- A simple eigenvalue method for low-order D-BMAP/G/1 queues
- On bulk-service MAP/PH\(^{L,N}\)/1/N G-queues with repeated attempts
- A simple and complete computational analysis of MAP/R/1 queue using roots
- A unified framework for numerically inverting Laplace transforms
- Analysis of a finite MAP/\(G\)/1 queue with group services
- Title not available (Why is that?)
- Analysis of the MAP/G\(^{a,b}\)/1/N queue
- Modelling and analysis of \(M/G^{a,b}/1/N\) queue -- A simple alternative approach
- Characterizations of generalized hyperexponential distribution functions
- Markov chains with transition delta-matrix: Ergodicity conditions, invariant probability measures and applications
- Characterization of Matrix-Exponential Distributions
- Queueing theory. A linear algebraic approach
- A multi-server retrial queue with BMAP arrivals and group services
- Linear independence of root equations for \(M/G/1\) type Markov chains
- NEWTON'S METHOD FOR ZERO POINTS OF A MATRIX FUNCTION AND ITS APPLICATIONS TO QUEUEING MODELS
- A COMPUTATIONAL METHOD FOR THE BOUNDARY VECTOR OF A BMAP/G/1 QUEUE
- Complete characterisation of the customer delay in a queueing system with batch arrivals and batch service
- Delay analysis of two batch-service queueing models with batch arrivals: \(Geo^{X }/Geo^{c}/1\)
Cited In (12)
- Analytical and computational studies of the BMAP/G(a,Y)/1 queue
- Stationary joint distribution of a discrete-time group-arrival and batch-size-dependent service queue with single and multiple vacation
- A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches
- Computational and numerical investigation of the batch Markovian arrival process subject to renewal generated geometric catastrophes
- Stationary queue and server content distribution of a batch-size-dependent service queue with batch Markovian arrival process: BMAP/Gn(a,b)/1
- Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline
- A simple analysis of system characteristics in the batch service queue with infinite-buffer and Markovian service process using the roots method: \(\mathrm{GI}/\mathrm{C-MSP}^{a,b}/1/\infty\)
- Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process
- Analysis of the MAP/G\(^{a,b}\)/1/N queue
- Analysis of BMAP∕R∕1 Queues Under Gated-Limited Service with the Server’s Single Vacation Policy
- Analytically explicit results for the GI/C-MSP/1/\(\infty \) queueing system using roots
- A sufficient condition for the subexponential asymptotics of GI/G/\(1\)-type Markov chains with queueing applications
This page was built for publication: Computational analysis of bulk service queue with Markovian arrival process: MAP/R\(^{(a,b)}/1\) queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505201)