Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline

DOI10.1007/s10479-017-2534-zzbMath1388.90040OpenAlexW2624549744MaRDI QIDQ1708522

Souvik Ghosh, Abhijit Datta Banik

Publication date: 23 March 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2534-z

zbMATH Keywords

RG-factorizationbatch Markovian arrival process (BMAP)Markovian service process (MSP)expected sojourn timerandom order service (ROS)

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (3)

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 ⋮ 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
• Analysis of \(\mathrm{BMAP}/\mathrm{MSP}/1\) queue
• Numerical investigation of a multiserver retrial model
• A factorization property for \(BMAP/G/1\) vacation queues under variable service speed
• The waiting time distribution for the random order service \(M/M/1\) queue
• Sojourn time distribution in a MAP/M/1 processor-sharing queue
• The equivalence between processor sharing and service in random order.
• An algorithmic analysis of the \(BMAP/MSP/1\) generalized processor-sharing queue
• When random-order-of-service outperforms first-come-first-served
• A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: \( GI^{[X}/C\)-\( MSP /1/\infty \)]
• Random-order-of-service for heterogeneous customers: waiting time analysis
• 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
• 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
• The N/G/1 queue and its detailed analysis
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• A NOTE ON THE RESPONSE TIME IN M/G/1 QUEUES WUTH SERVICE IN RANDOM ORDER AND BERNOULLI FEEDBACK
• Planning and Scheduling in Manufacturing and Services
• Applied Probability and Queues
• A decomposition theorem for infinite stochastic matrices
• Queues with Service in Random Order
• AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue
• Priority Queues with Random Order of Service

This page was built for publication: Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline