1,751 research outputs found
Inference for double Pareto lognormal queues with applications
In this article we describe a method for carrying out Bayesian inference for the double Pareto lognormal (dPlN) distribution which has recently been proposed as a model for heavy-tailed phenomena. We apply our approach to inference for the dPlN/M/1 and M/dPlN/1 queueing systems. These systems cannot be analyzed using standard techniques due to the fact that the dPlN distribution does not posses a Laplace transform in closed form. This difficulty is overcome using some recent approximations for the Laplace transform for the Pareto/M/1 system. Our procedure is illustrated with applications in internet traffic analysis and risk theory.Heavy tails, Bayesian inference, Queueing theory
Waiting time dynamics of priority-queue networks
We study the dynamics of priority-queue networks, generalizations of the
binary interacting priority queue model introduced by Oliveira and Vazquez
[Physica A {\bf 388}, 187 (2009)]. We found that the original AND-type protocol
for interacting tasks is not scalable for the queue networks with loops because
the dynamics becomes frozen due to the priority conflicts. We then consider a
scalable interaction protocol, an OR-type one, and examine the effects of the
network topology and the number of queues on the waiting time distributions of
the priority-queue networks, finding that they exhibit power-law tails in all
cases considered, yet with model-dependent power-law exponents. We also show
that the synchronicity in task executions, giving rise to priority conflicts in
the priority-queue networks, is a relevant factor in the queue dynamics that
can change the power-law exponent of the waiting time distribution.Comment: 5 pages, 3 figures, minor changes, final published versio
Transform-domain analysis of packet delay in network nodes with QoS-aware scheduling
In order to differentiate the perceived QoS between traffic classes in heterogeneous packet networks, equipment discriminates incoming packets based on their class, particularly in the way queued packets are scheduled for further transmission. We review a common stochastic modelling framework in which scheduling mechanisms can be evaluated, especially with regard to the resulting per-class delay distribution. For this, a discrete-time single-server queue is considered with two classes of packet arrivals, either delay-sensitive (1) or delay-tolerant (2). The steady-state analysis relies on the use of well-chosen supplementary variables and is mainly done in the transform domain. Secondly, we propose and analyse a new type of scheduling mechanism that allows precise control over the amount of delay differentiation between the classes. The idea is to introduce N reserved places in the queue, intended for future arrivals of class 1
Evaluation of Pareto/D/1/k Queue by Simulation
The finding that Pareto distributions are adequate to model Internet packet interarrival times has
motivated the proposal of methods to evaluate steady-state performance measures of Pareto/D/1/k queues.
Some limited analytical derivation for queue models has been proposed in the literature, but their solutions are
often of a great mathematical challenge. To overcome such limitations, simulation tools that can deal with general
queueing system must be developed. Despite certain limitations, simulation algorithms provide a mechanism to
obtain insight and good numerical approximation to parameters of queues. In this work, we give an overview of
some of these methods and compare them with our simulation approach, which are suited to solve queues with
Generalized-Pareto interarrival time distributions. The paper discusses the properties and use of the Pareto
distribution. We propose a real time trace simulation model for estimating the steady-state probability showing the
tail-raising effect, loss probability, delay of the Pareto/D/1/k queue and make a comparison with M/D/1/k. The
background on Internet traffic will help to do the evaluation correctly. This model can be used to study the long-
tailed queueing systems. We close the paper with some general comments and offer thoughts about future work
On the Performance of Short Block Codes over Finite-State Channels in the Rare-Transition Regime
As the mobile application landscape expands, wireless networks are tasked
with supporting different connection profiles, including real-time traffic and
delay-sensitive communications. Among many ensuing engineering challenges is
the need to better understand the fundamental limits of forward error
correction in non-asymptotic regimes. This article characterizes the
performance of random block codes over finite-state channels and evaluates
their queueing performance under maximum-likelihood decoding. In particular,
classical results from information theory are revisited in the context of
channels with rare transitions, and bounds on the probabilities of decoding
failure are derived for random codes. This creates an analysis framework where
channel dependencies within and across codewords are preserved. Such results
are subsequently integrated into a queueing problem formulation. For instance,
it is shown that, for random coding on the Gilbert-Elliott channel, the
performance analysis based on upper bounds on error probability provides very
good estimates of system performance and optimum code parameters. Overall, this
study offers new insights about the impact of channel correlation on the
performance of delay-aware, point-to-point communication links. It also
provides novel guidelines on how to select code rates and block lengths for
real-time traffic over wireless communication infrastructures
- …