Modelling and analysis of \(GI/BMSP/1\) queueing system
From MaRDI portal
Publication:2239008
DOI10.1007/S40840-021-01120-ZzbMath1480.60281OpenAlexW3167226463MaRDI QIDQ2239008
Publication date: 2 November 2021
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-021-01120-z
queueingrenewal processMarkov renewal theorybatch Markovian service processvector probability generating function
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Computational analysis of \(GI^{[X}/D-MSP^{(a,b)}/1\) queueing system via \textit{RG}-factorization]
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
- Analytic and computational analysis of the discrete-time \(GI/D\)-\(MSP/1\) queue using roots
- Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacations
- On the finite buffer queue with renewal input and batch Markovian service process: \(\mathrm{GI}/\mathrm{BMSP}/1/N\)
- Analyzing state-dependent arrival in \(GI/\mathrm{BMSP}/1/\infty \) queues
- Loss pattern of \(\mathrm{DBMAP}/\mathrm{DMSP}/1/K\) queue and its application in wireless local communications
- Analysis of stationary discrete-time \(GI/D-MSP/1\) queue with finite and infinite buffers
- On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals
- The stationary characteristics of the G/MSP/\(1/r\) queueing system
- A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
- A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)]
- Analyzing discrete-time \(GI^{[X}/D-MSP/1/\infty\) queueing system using \(RG\)-factorization]
- On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system
- Sojourn-time distribution of the \(G I/M S P/1\) queueing system
- Complete analysis of finite and infinite buffer \(GI/MSP/1\) queue-a computational approach
- A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches
- An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue
- ANALYTICALLY EXPLICIT RESULTS FOR THE GI/C-MSP/1/∞ QUEUEING SYSTEM USING ROOTS
- New results on the single server queue with a batch markovian arrival process
- Asymptotics for steady-state tail probabilities in structured markov queueing models
- Some steady-state distributions for theMAP /SM /1 queue
- Characterizing the BMAP/MAP/1 Departure Process via the ETAQA Truncation
- Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and/or Markovian service process
This page was built for publication: Modelling and analysis of \(GI/BMSP/1\) queueing system
