Stationary waiting time distribution in G|M|n|r with random renovation policy

DOI10.1007/978-3-319-51917-3_31MaRDI QIDQ4567983zbMATH OpenOpenAlexFDO

Authors Ivan Zaryadov, Rostislav Razumchik, Tatiana Milovanova

Publication date 20 June 2018

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-51917-3_31

zbMATH Keywords

queueing systemfinite capacityLCFSrenovationFCFS

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Recommendations

• The general renovation as the active queue management mechanism. Some aspects and results
• Queueing systems with renovation
• Stationary time characteristics of the GI/M/n/ system with some variants of the generalized renovation discipline
• Two types of single-server queueing systems with threshold-based renovation mechanism
• A NEW APPROACH FOR THE STUDY OF THE M^X/G/1 QUEUE USING RENEWAL ARGUMENTS

Cites work

• A queueing system with Markov arrivals and random discipline
• An SM\(_2/\text{MSP}/n/r\) system with random-service discipline and a common buffer
• Analysis of the multi-server Markov queuing system with unlimited buffer and negative customers
• Delay analysis of a queue with re-sequencing buffer and Markov environment
• Queueing Theory
• Queueing systems with renovation
• Random-order-of-service for heterogeneous customers: waiting time analysis
• Stationary time characteristics of the GI/M/n/ system with some variants of the generalized renovation discipline
• The \(GI/M/n/\infty \) queuing system with generalized renovation
• When random-order-of-service outperforms first-come-first-served

Cited in

(5)

• The survey on Markov-modulated arrival processes and their application to the analysis of active queue management algorithms
• The queueing system with threshold-based direct and inverse general renovation mechanism
• Characteristics of lost and served packets for retrial queueing system with general renovation and recurrent input flow
• The general renovation as the active queue management mechanism. Some aspects and results
• Two types of single-server queueing systems with threshold-based renovation mechanism

This page was built for publication: Stationary waiting time distribution in \(G|M|n|r\) with random renovation policy

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