Exact analysis of the M/M/k/setup class of Markov chains via recursive renewal reward

DOI10.1007/S11134-014-9409-7MaRDI QIDQ475108zbMATH OpenOpenAlexFDO

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

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

performancequeueing theoryrenewal reward theoryrepeating chainsresource allocation

Mathematics Subject Classification ID

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

Recommendations

• Analysis of a multiserver queue with setup times
• Multiserver queues with finite capacity and setup time
• Analysis for the M/M/1 vacation queue with setup times and variable service rate
• Analysis of queues in (M₁,M₂)/(G₁,G₂)/(n₁,n₂) cyclic system with setup
• \(M/G/k\) with staggered setup

Cites work

• A distributional form of Little's law
• An M/M/s Queue With Servers’ Vacations
• Analysis of a multiserver queue with setup times
• Combining make to order and make to stock
• Conditional stochastic decompositions in the M/M/c queue with server vacations
• Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 1946758 (Why is no real title available?)
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Managing performance and power consumption in a server farm
• On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service
• Quasi-Birth-and-Death Processes with an Explicit Rate Matrix
• The \(M/M/c\) queue with \((e,d)\) setup time
• Triangular M/G/1-type and tree-like quasi-birth-death Markov chains

Cited in

(18)

• 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
• Open problems in queueing theory inspired by datacenter computing
• Difference equations approach for multi-server queueing models with removable servers
• Optimal energy-efficient policies for data centers through sensitivity-based optimization
• Delay performance of data-center queue with setup policy and abandonment
• On energy-aware M/G/1-LAS queue with batch arrivals
• Single server retrial queues with setup time
• Single server retrial queues with speed scaling: analysis and performance evaluation
• Multiserver retrial queue with setup time and its application to data centers
• Maximum weight matching with hysteresis in overloaded queues with setups
• 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
• Exact analysis of the \(\mathrm{M}/\mathrm{M}/k/\mathrm{setup}\) class of Markov chains via recursive renewal reward
• Customer-server population dynamics in heavy traffic
• Scalable Load Balancing in Networked Systems: A Survey of Recent Advances
• Join Idle Queue with Service Elasticity: Large-Scale Asymptotics of a Nonmonotone System
• Strategic analysis of retrial queues with setup times, breakdown and repairs

Describes a project that uses

Uses Software

• Dynamo

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

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