Stationary Waiting Time Distribution in G|M|n|r with Random Renovation Policy
From MaRDI portal
Publication:4567983
DOI10.1007/978-3-319-51917-3_31zbMath1390.90268OpenAlexW2588846262MaRDI QIDQ4567983
Tatiana Milovanova, Ivan Zaryadov, Rostislav Razumchik
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
Related Items (5)
Two types of single-server queueing systems with threshold-based renovation mechanism ⋮ The queueing system with threshold-based direct and inverse general renovation mechanism ⋮ The Survey on Markov-Modulated Arrival Processes and Their Application to the Analysis of Active Queue Management Algorithms ⋮ 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
Cites Work
- Delay analysis of a queue with re-sequencing buffer and Markov environment
- 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
- Queueing systems with renovation
- An SM\(_2/\text{MSP}/n/r\) system with random-service discipline and a common buffer
- When random-order-of-service outperforms first-come-first-served
- A queueing system with Markov arrivals and random discipline
- The \(GI/M/n/\infty \) queuing system with generalized renovation
- Random-order-of-service for heterogeneous customers: waiting time analysis
- Queueing Theory
This page was built for publication: Stationary Waiting Time Distribution in G|M|n|r with Random Renovation Policy
