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

DOI10.1016/j.cor.2016.10.001zbMath1391.90183OpenAlexW2529337564MaRDI QIDQ1652138

Souvik Ghosh, Abhijit Datta 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

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

Mathematics Subject Classification ID

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) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55)

Related Items (9)

A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches ⋮ Detailed analytical and computational studies of \(D-BMAP/D-BMSP1\) queueing system ⋮ Analysis of a queueing system with mixed service discipline ⋮ 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 ⋮ Joint arrival process of multiple independent batch Markovian arrival processes ⋮ Fitting procedure for the two-state batch Markov modulated Poisson process ⋮ Findings about the BMMPP for modeling dependent and simultaneous data in reliability and queueing systems ⋮ On the optimal control of loss probability and profit in a \(GI /C\)-\(BMSP /1/N\) queueing system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
• 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
• Numerical investigation of a multiserver retrial model
• Processor sharing: a survey of the mathematical theory
• A solution for the \(M^ X/G/1\)-PS process response time
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• Batch arrival processor-sharing with application to multi-level processor-sharing scheduling
• Response-Time Distribution for a Processor-Sharing System
• New results on the single server queue with a batch markovian arrival process
• A single-server queue with server vacations and a class of non-renewal arrival processes
• A versatile Markovian point process
• Technical Note—Conditional Response Times in M/M/1 Processor-Sharing Models
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Applied Probability and Queues
• A decomposition theorem for infinite stochastic matrices
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

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