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

DOI10.1007/978-3-319-51917-3_31zbMATH Open1390.90268OpenAlexW2588846262MaRDI QIDQ4567983FDOQ4567983

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

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/\infty \) 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

zbMATH Keywords

queueing systemfinite capacityLCFSrenovationFCFS

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

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

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)