11,923 research outputs found
When Backpressure Meets Predictive Scheduling
Motivated by the increasing popularity of learning and predicting human user
behavior in communication and computing systems, in this paper, we investigate
the fundamental benefit of predictive scheduling, i.e., predicting and
pre-serving arrivals, in controlled queueing systems. Based on a lookahead
window prediction model, we first establish a novel equivalence between the
predictive queueing system with a \emph{fully-efficient} scheduling scheme and
an equivalent queueing system without prediction. This connection allows us to
analytically demonstrate that predictive scheduling necessarily improves system
delay performance and can drive it to zero with increasing prediction power. We
then propose the \textsf{Predictive Backpressure (PBP)} algorithm for achieving
optimal utility performance in such predictive systems. \textsf{PBP}
efficiently incorporates prediction into stochastic system control and avoids
the great complication due to the exponential state space growth in the
prediction window size. We show that \textsf{PBP} can achieve a utility
performance that is within of the optimal, for any ,
while guaranteeing that the system delay distribution is a
\emph{shifted-to-the-left} version of that under the original Backpressure
algorithm. Hence, the average packet delay under \textsf{PBP} is strictly
better than that under Backpressure, and vanishes with increasing prediction
window size. This implies that the resulting utility-delay tradeoff with
predictive scheduling beats the known optimal tradeoff for systems without prediction
Some aspects of queueing and storage processes : a thesis in partial fulfilment of the requirements for the degree of Master of Science in Statistics at Massey University
In this study the nature of systems consisting of a single queue are first considered. Attention is then drawn to an analogy between such systems and storage systems.
A development of the single queue viz queues with feedback is considered after first considering feedback processes in general. The behaviour of queues, some with feedback loops, combined into networks is then considered. Finally, the application of such networks to the analysis of interconnected reservoir systems is considered and the conclusion drawn that such analytic methods complement the more recently developed mathematical programming methods by providing analytic solutions for
sub systems behaviour and thus guiding the development of a system model
Exclusive Queueing Process with Discrete Time
In a recent study [C Arita, Phys. Rev. E 80, 051119 (2009)], an extension of
the M/M/1 queueing process with the excluded-volume effect as in the totally
asymmetric simple exclusion process (TASEP) was introduced. In this paper, we
consider its discrete-time version. The update scheme we take is the parallel
one. A stationary-state solution is obtained in a slightly arranged matrix
product form of the discrete-time open TASEP with the parallel update. We find
the phase diagram for the existence of the stationary state. The critical line
which separates the parameter space into the regions with and without the
stationary state can be written in terms of the stationary current of the open
TASEP. We calculate the average length of the system and the average number of
particles
Computationally Efficient Simulation of Queues: The R Package queuecomputer
Large networks of queueing systems model important real-world systems such as
MapReduce clusters, web-servers, hospitals, call centers and airport passenger
terminals. To model such systems accurately, we must infer queueing parameters
from data. Unfortunately, for many queueing networks there is no clear way to
proceed with parameter inference from data. Approximate Bayesian computation
could offer a straightforward way to infer parameters for such networks if we
could simulate data quickly enough.
We present a computationally efficient method for simulating from a very
general set of queueing networks with the R package queuecomputer. Remarkable
speedups of more than 2 orders of magnitude are observed relative to the
popular DES packages simmer and simpy. We replicate output from these packages
to validate the package.
The package is modular and integrates well with the popular R package dplyr.
Complex queueing networks with tandem, parallel and fork/join topologies can
easily be built with these two packages together. We show how to use this
package with two examples: a call center and an airport terminal.Comment: Updated for queuecomputer_0.8.
Queueing process with excluded-volume effect
We introduce an extension of the M/M/1 queueing process with a spatial
structure and excluded- volume effect. The rule of particle hopping is the same
as for the totally asymmetric simple exclusion process (TASEP). A
stationary-state solution is constructed in a slightly arranged matrix product
form of the open TASEP. We obtain the critical line that separates the
parameter space depending on whether the model has the stationary state. We
calculate the average length of the model and the number of particles and show
the monotonicity of the probability of the length in the stationary state. We
also consider a generalization of the model with backward hopping of particles
allowed and an alternate joined system of the M/M/1 queueing process and the
open TASEP.Comment: 9 figure
- …