Queueing systems with renovation

DOI10.1155/S1048953397000464zbMATH Open0896.60068MaRDI QIDQ1379927FDOQ1379927

Authors: A. Ya. Kreĭnin 

Publication date: 1 October 1998

Published in: Journal of Applied Mathematics and Stochastic Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/47980

Recommendations

• Regeneration and renovation in queues
• Two types of single-server queueing systems with threshold-based renovation mechanism
• Stationary time characteristics of the \(GI/M/n/\infty \) system with some variants of the generalized renovation discipline
• scientific article; zbMATH DE number 4020161
• Perturbed renewal equations with applications to M/M queueing systems. II

zbMATH Keywords

queueing systemstationary distributionsemi-Markov processqueue length processrenovationergodicity conditionsarrival flow

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Cited In (13)

• The survey on Markov-modulated arrival processes and their application to the analysis of active queue management algorithms
• Models of branching walks and their use in the reliability theory
• Stationary time characteristics of the \(GI/M/n/\infty \) system with some variants of the generalized renovation discipline
• Queueing system with two input flows, preemptive priority, and stochastic dropping
• The queueing system with threshold-based direct and inverse general renovation mechanism
• A \(Geo^{[X]}/G^{[X]}/1\) retrial queueing system with removal work and total renewal discipline
• Stationary waiting time distribution in \(G|M|n|r\) with random renovation policy
• 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
• Title not available (Why is that?)
• Two types of single-server queueing systems with threshold-based renovation mechanism
• The \(GI/M/n/\infty \) queuing system with generalized renovation
• Finite capacity single-server queue with Poisson input, general service and delayed renovation

This page was built for publication: Queueing systems with renovation

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