20,568 research outputs found
The M/G/1+G queue revisited
We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balks or reneges when its virtual waiting time, i.e., the amount of work seen upon arrival, is larger than a certain random patience time. We consider the number of customers in the system, the maximum workload during a busy period, and the length of a busy period. We also briefl y treat the analogous model in which any customer enters the system and leaves at the end of his patience time or at the end of his virtual sojourn time, whichever occurs first
Loss systems in a random environment
We consider a single server system with infinite waiting room in a random
environment. The service system and the environment interact in both
directions. Whenever the environment enters a prespecified subset of its state
space the service process is completely blocked: Service is interrupted and
newly arriving customers are lost. We prove an if-and-only-if-condition for a
product form steady state distribution of the joint queueing-environment
process. A consequence is a strong insensitivity property for such systems.
We discuss several applications, e.g. from inventory theory and reliability
theory, and show that our result extends and generalizes several theorems found
in the literature, e.g. of queueing-inventory processes.
We investigate further classical loss systems, where due to finite waiting
room loss of customers occurs. In connection with loss of customers due to
blocking by the environment and service interruptions new phenomena arise.
We further investigate the embedded Markov chains at departure epochs and
show that the behaviour of the embedded Markov chain is often considerably
different from that of the continuous time Markov process. This is different
from the behaviour of the standard M/G/1, where the steady state of the
embedded Markov chain and the continuous time process coincide.
For exponential queueing systems we show that there is a product form
equilibrium of the embedded Markov chain under rather general conditions. For
systems with non-exponential service times more restrictive constraints are
needed, which we prove by a counter example where the environment represents an
inventory attached to an M/D/1 queue. Such integrated queueing-inventory
systems are dealt with in the literature previously, and are revisited here in
detail
Queues with Galton-Watson-type arrivals
This paper presents the analysis of a discrete-time single server queueing system with a multi-type Galton-Watson arrival process with migration. It is shown that such a process allows to capture intricate correlation in the arrival process while the corcesponding queueing analysis yields closed-form expressions for various moments of queue content and packet delay
Discrete-time queues with zero-regenerative arrivals: moments and examples
In this paper we investigate a single-server discrete-time queueing system with single-slot service times. The stationary ergodic arrival process this queueing system is subject to, satisfies a regeneration property when there are no arrivals during a slot. Expressions for the mean and the variance of the queue content in steady state are obtained for this broad class which includes among others autoregressive arrival processes and M/G/infinity-input or train arrival processes. To illustrate our results, we then consider a number of numerical examples
Max-Weight Revisited: Sequences of Non-Convex Optimisations Solving Convex Optimisations
We investigate the connections between max-weight approaches and dual
subgradient methods for convex optimisation. We find that strong connections
exist and we establish a clean, unifying theoretical framework that includes
both max-weight and dual subgradient approaches as special cases. Our analysis
uses only elementary methods, and is not asymptotic in nature. It also allows
us to establish an explicit and direct connection between discrete queue
occupancies and Lagrange multipliers.Comment: convex optimisation, max-weight scheduling, backpressure, subgradient
method
- …