Computational analysis of a single server queue with batch Markovian arrival and exponential single working vacation

DOI10.1007/978-981-10-7814-9_5zbMATH Open1402.90036OpenAlexW2795974957MaRDI QIDQ1625545FDOQ1625545

Authors: Souvik Ghosh, Debasis Basu, A. D. Banik 

Publication date: 29 November 2018

Full work available at URL: https://doi.org/10.1007/978-981-10-7814-9_5

Recommendations

• Analysis of single working vacation in GI\(/M/1/N\) and GI\(/M/1/\infty \) queueing systems
• Stationary analysis of a \(\mathrm{BMAP}/\mathrm{R}/1\) queue with \(\mathrm{R}\)-type multiple working vacations
• scientific article; zbMATH DE number 563342
• On the \(GI/M/1/N\) queue with multiple working vacations-analytic analysis and computation
• The analysis of a finite-buffer general input queue with batch arrival and exponential multiple vacations

zbMATH Keywords

single working vacationbatch Markovian arrival processsingle server\(RG\) factorizationinfinite buffer queue

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cited In (3)

• Stationary analysis of a \(\mathrm{BMAP}/\mathrm{R}/1\) queue with \(\mathrm{R}\)-type multiple working vacations
• Alternative approach based on roots for computing the stationary queue-length distributions in \(GI^X/M^{(1,b)}/1\) single working vacation queue
• Analysis of variant working vacations on batch arrival queues

This page was built for publication: Computational analysis of a single server queue with batch Markovian arrival and exponential single working vacation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1625545)