Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward

DOI10.1007/s11134-014-9409-7zbMath1307.60130OpenAlexW1985865469MaRDI QIDQ475108

Alan Scheller-Wolf, Sherwin Doroudi, Anshul Gandhi, Mor Harchol-Balter

Publication date: 25 November 2014

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-014-9409-7

zbMATH Keywords

performanceresource allocationqueueing theoryrenewal reward theoryrepeating chains

Mathematics Subject Classification ID

Continuous-time Markov processes on general state spaces (60J25) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Renewal theory (60K05)

Related Items (17)

Maximum weight matching with hysteresis in overloaded queues with setups ⋮ Difference equations approach for multi-server queueing models with removable servers ⋮ Single server retrial queues with setup time ⋮ A Law of Large Numbers for M/M/c/Delayoff-Setup Queues with Nonstationary Arrivals ⋮ Energy-Aware Data Centers with s-Staggered Setup and Abandonment ⋮ Customer-Server Population Dynamics in Heavy Traffic ⋮ Optimal energy-efficient policies for data centers through sensitivity-based optimization ⋮ Single server retrial queues with speed scaling: analysis and performance evaluation ⋮ Scalable Load Balancing in Networked Systems: A Survey of Recent Advances ⋮ Multiserver retrial queue with setup time and its application to data centers ⋮ Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System ⋮ Delay performance of data-center queue with setup policy and abandonment ⋮ Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward ⋮ Energy-saving policies for temperature-controlled production systems with state-dependent setup times and costs ⋮ To clean or not to clean: malware removal strategies for servers under load ⋮ On energy-aware \(M/G/1\)-LAS queue with batch arrivals ⋮ Open problems in queueing theory inspired by datacenter computing

Uses Software

• Dynamo

Cites Work

• Unnamed Item
• Unnamed Item
• Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
• The \(M/M/c\) queue with \((e,d)\) setup time
• A distributional form of Little's law
• Combining make to order and make to stock
• Managing performance and power consumption in a server farm
• Analysis of a multiserver queue with setup times
• Triangular M/G/1-Type and Tree-Like Quasi-Birth-Death Markov Chains
• Quasi-Birth-and-Death Processes with an Explicit Rate Matrix
• An M/M/s Queue With Servers’ Vacations
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Conditional stochastic decompositions in the M/M/c queue with server vacations
• On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service

This page was built for publication: Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward