Sojourn time in a single-server queue with threshold service rate control

DOI10.1137/14097046XMaRDI QIDQ2789363zbMATH OpenOpenAlexFDO

Authors Bernardo D'Auria, Ivo Adan

Publication date 29 February 2016

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1509.04111

zbMATH Keywords

adaptable service speedmatrix generating functionsingle-server queuesojourn time distribution

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Processes in random environments (60K37) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Queues and service in operations research (90B22)

Abstract: We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at low or high rate, which can be adapted at exponential inspection times. When the number of customers in the system is above a given threshold, the service rate is upgraded to the high rate, and otherwise, it is downgraded to the low rate. The state dependent changes in the service rate make the analysis of the sojourn time a challenging problem, since the sojourn time now also depends on future arrivals. We determine the Laplace transform of the stationary sojourn time and describe a procedure to compute all moments as well. First we analyze the special case of continuous inspection, where the service rate immediately changes once the threshold is crossed. Then we extend the analysis to random inspection times. This extension requires the development of a new methodological tool, that is "matrix generating functions". The power of this tool is that it can also be used to analyze generalizations to phase-type services and inspection times.

Review text

The paper under review considers a single-server queueing system, where customers arrive according to a Poisson stream with rate \(\lambda\) and receive service in order of arrival. The service requirements are exponentially distributed with mean 1. The rate of the server can be either \(\mu_0\) or \(\mu_1\) and this service rate can be adapted at random inspection times that occur according to a Poisson stream with rate \(\gamma\). For convenience, it is assumed that \(\mu_1>\mu_0\) even if under the stability condition this assumption may be removed. When the number of customers in the system is above the threshold \(K\), the service rate is upgraded to the high rate \(\mu_1\), otherwise it is downgraded to the low rate \(\mu_0\). The aim of the paper is to determine the stationary distribution of the sojourn time. This is a challenging problem, since due to adaptable service rate, the sojourn time does not only depend on the state seen at arrival, but it also depends on future arrivals. The paper under review determines the Laplace transform of the stationary sojourn time and describes a procedure to compute all moments. The special case of continuous inspection is analyzed first, where the service rate immediately changes once the threshold is crossed. Then, the analysis is extended to random inspection times. This extension requires the development of a new methodological tool, namely, matrix generating functions. The power of this tool is that it can also be used to analyze generalizations to phase-type services and inspection times.

Recommendations

• Sojourn and waiting times in a single-server system with state-dependent mean service rate
• SOJOURN TIMES IN NON-HOMOGENEOUS QBD PROCESSES WITH PROCESSOR SHARING
• Sojourn time distributions for the M/M/1 queue in a Markovian environment
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• Sojourn times in a processor sharing queue with service interruptions

Cited in

(5)

• Sojourn and waiting times in a single-server system with state-dependent mean service rate
• Batch arrival single-server queue with variable service speed and setup time
• Designing cost-efficient inspection schemes for stochastic streamflow environment using an effective Hamiltonian approach
• Minimizing the Maximum Expected Waiting Time in a Periodic Single-Server Queue with a Service-Rate Control
• Sojourn time tails in the single server queue with heavy-tailed service times

This page was built for publication: Sojourn time in a single-server queue with threshold service rate control

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