An algorithmic analysis of the BMAP/MSP/1 generalized processor-sharing queue

DOI10.1016/J.COR.2016.10.001MaRDI QIDQ1652138zbMATH OpenOpenAlexFDO

Authors Souvik Ghosh, A. D. Banik

Publication date 11 July 2018

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2016.10.001

zbMATH Keywords

batch Markovian arrival process (BMAP)generalized processor-sharing (GPS) queueMarkovian service process (MSP)RG-factorization

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Recommendations

• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
• The \(\text{BMAP}/\text{G}/1/\infty\) queue with the foreground-background processor-sharing discipline
• A \(MAP_{K}/G_{K}/1/\infty\) queueing system with generalized foreground-background processor sharing discipline
• A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline

Cites work

• A decomposition theorem for infinite stochastic matrices
• A single-server queue with server vacations and a class of non-renewal arrival processes
• A solution for the \(M^ X/G/1\)-PS process response time
• A versatile Markovian point process
• Algorithm for computing the queue length distribution at various time epochs in \(\mathrm{DMAP}/G^{(1, a, b)}/1/n\) queue with batch-size-dependent service time
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Applied Probability and Queues
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• scientific article; zbMATH DE number 3736680 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• scientific article; zbMATH DE number 194776 (Why is no real title available?)
• scientific article; zbMATH DE number 1867257 (Why is no real title available?)
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• New results on the single server queue with a batch markovian arrival process
• Numerical investigation of a multiserver retrial model
• Processor sharing: a survey of the mathematical theory
• Response-Time Distribution for a Processor-Sharing System
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• Technical Note—Conditional Response Times in M/M/1 Processor-Sharing Models
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

Cited in

(15)

• Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/1 queue under random order service discipline
• A retrial queueing system with processor sharing
• Fitting procedure for the two-state batch Markov modulated Poisson process
• On the optimal control of loss probability and profit in a GI /C-BMSP /1/N queueing system
• A \(MAP_{K}/G_{K}/1/\infty\) queueing system with generalized foreground-background processor sharing discipline
• A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches
• Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
• Findings about the BMMPP for modeling dependent and simultaneous data in reliability and queueing systems
• Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• A Spectral Method for a Nonpreemptive PriorityBMAP/G/1 QUEUE
• Analysis ofBMAP/G/1 Queue with Reservation of Service
• Detailed analytical and computational studies of D-BMAP/D-BMSP1 queueing system
• Analysis of a queueing system with mixed service discipline
• Joint arrival process of multiple independent batch Markovian arrival processes

This page was built for publication: An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue

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