The idle period of the finite \(G/M/1\) queue with an interpretation in risk theory
type: Item
instance of: scholarly article
title: The idle period of the finite \(G/M/1\) queue with an interpretation in risk theory
zbMATH Open document ID: 1201.60087
author: Andreas Löpker
author: David Perry
published in: Queueing Systems
publication date: 2010-04-28T00:00:00Z
review text: The paper deals with the \(G/M/1\) queue where the workload (virtual waiting time) \(V_t\) is bounded by \(1\): If \(V_t\) plus the service time of an arriving customer exceeds \(1\), only \(1-V_t\) of the service requirement is accepted. The paper focus on the idle period \(I\), i.e. the duration between the time when the queue becomes empty and the next customer arrives, of this finite queue, because it can be interpreted as the deficit at ruin for a risk reserve process \(R_t\) in the compound Poisson risk model with a constant behavior strategy: when the risk reserve process reaches level \(1\) dividends are paid out with constant rate \(1\), such that \(R_t\) is constant until the next claim occurs. In the paper expressions for the LST and the distribution of \(I\) are given. Two methods are used, which base on sample path analysis: the first method bases on collecting subsequent overshoots over level \(1\) in the original \(G/M/1\) workload process and the second method on the observation that the idle period can be seen as the overshoot of the workload process in a dual \(M/G/1\) queue. The second method is used to construct a modified \(M/G/1\) process and to define a formula for the distribution of the idle period in the finite \(G/M/1\) queue with set-up time \(a\in[0,1]\), where after each busy period an arriving customer has to wait \(a\) time units until the server is ready to serve it.
reviewed by: Andreas Brandt
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 91B30
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 5702565
zbMATH Keywords: finite \(G/M/1\)
zbMATH Keywords: finite \(M/G/1\)
zbMATH Keywords: workload
zbMATH Keywords: idle period
zbMATH Keywords: sample path analysis
zbMATH Keywords: level crossing
zbMATH Keywords: risk process
zbMATH Keywords: deficit at ruin
MaRDI profile type: MaRDI publication profile
full work available at URL: s11134-010-9168-z
OpenAlex ID: W2129125448
cites work: The G/M/1 queue revisited
cites work: Risk theory with a nonlinear dividend barrier
cites work: On the distribution of dividend payments and the discounted penalty function in a risk model with linear dividend barrier
cites work: Q3026011
cites work: Q4379506
cites work: Ruin Probabilities and Deficit for the Renewal Risk Model with Phase-type Interarrival Times
cites work: Finite-buffer queues with workload-dependent service and arrival rates
cites work: A note on stochastic comparisons of excess lifetimes of renewal processes
cites work: Single-Server with Delay-Dependent Arrival Streams
cites work: Level crossing methods in stochastic models
cites work: Level Crossings in Point Processes Applied to Queues: Single-Server Case
cites work: Q5546394
cites work: Single server queue with uniformly bounded virtual waiting time
cites work: On up- and downcrossings
cites work: Q3938929
cites work: Single-server queueing systems with uniformly limited queueing time
cites work: On the probability of ruin in the presence of a linear dividend barrier
cites work: A sample path analysis of \(M/GI/1\) queues with workload restrictions
cites work: Dam processes with state dependent batch sizes and intermittent production processes with state dependent rates
cites work: Q4101255
cites work: On a class of renewal risk models with a constant dividend barrier
cites work: The compound Poisson risk model with a threshold dividend strategy
cites work: The classical risk model with a constant dividend barrier: analysis of the Gerber-Shiu discounted penalty function.
cites work: The GI/G/1 queue with uniformly limited virtual waiting times; the finite dam
cites work: A controlled \(M/G/1\) workload process with an application to perishable inventory systems
cites work: Busy period analysis for \(M/G/1\) and \(G/M/1\) type queues with restricted accessibility
cites work: The M/G/1 queue with finite workload capacity
cites work: HITTING AND RUIN PROBABILITIES FOR COMPOUND POISSON PROCESSES AND THE CYCLE MAXIMUM OF THE M/G/1 QUEUE
cites work: Q3900799
cites work: The finite dam
cites work: Q4230625
cites work: Hitting time in an M/G/1 queue
cites work: Q3292872
cites work: Q5601911
cites work: A single-server queue with limited virtual waiting time
DOI: 10.1007/S11134-010-9168-Z
Recommended article: Characterizing the idle-period distribution of GI/G/1 queues
Recommended article: Idle period approximations and bounds for the GI/G/1 queue
Recommended article: A functional approach to the stationary waiting time and idle period distributions of the \(GI/G/1\) queue
Recommended article: Q4392855
Recommended article: Asymptotically optimal idling in the \(GI/GI/N+GI\) queue
Recommended article: On the average idle time and average queue length estimates in an \(M/M/1\) queue
Recommended article: Idle and busy periods in stable M/M/k queues
description: scientific article; zbMATH DE number 5702565