847 research outputs found
Achievable performance of blind policies in heavy traffic
For a GI/GI/1 queue, we show that the average sojourn time under the (blind) Randomized Multilevel Feedback algorithm is no worse than that under the Shortest Remaining Processing Time algorithm times a logarithmic function of the system load. Moreover, it is verified that this bound is tight in heavy traffic, up to a constant multiplicative factor. We obtain this result by combining techniques from two disparate areas: competitive analysis and applied probability
Achievable performance of blind policies in heavy traffic
For a GI/GI/1 queue, we show that the average sojourn time under the (blind) Randomized Multilevel Feedback algorithm is no worse than that under the Shortest Remaining Processing Time algorithm times a logarithmic function of the system load. Moreover, it is verified that this bound is tight in heavy traffic, up to a constant multiplicative factor. We obtain this result by combining techniques from two disparate areas: competitive analysis and applied probability
Heavy and light traffic regimes for M|G|infinity traffic models
The busy server process provides a class of structural models for communication network traffic. In this dissertation, we study the asymptotic behavior of a network multiplexer, modeled as a discrete-time queue, driven by an correlated arrival stream. The asymptotic regimes considered here are those of heavy and light traffic. In heavy traffic, we show that the arising limits are described in terms of the classical Brownian motion and the --stable L'{e}vy motion, under short- and long-range dependence, respectively. Salient features are then effectively captured by the exponential distribution and the Mittag-Leffler special function. In light traffic, the analysis reveals the effect of two aspects of the process, i.e., the session duration distribution and the gradual nature of the arrivals, as opposed to the instantaneous inputs of a standard queue. We exploit these asymptotic results to construct interpolation approximations for system quantities of interest, applicable to all traffic intensities
Bayesian prediction of the transient behaviour and busy period in short and long-tailed GI/G/1 queueing systems
Bayesian inference for the transient behavior and duration of a busy period in a single server queueing
system with general, unknown distributions for the interarrival and service times is investigated. Both
the interarrival and service time distributions are approximated using the dense family of Coxian distributions. A suitable reparameterization allows the definition of a non-informative prior and Bayesian
inference is then undertaken using reversible jump Markov chain Monte Carlo methods. An advantage of
the proposed procedure is that heavy tailed interarrival and service time distributions such as the Pareto
can be well approximated. The proposed procedure for estimating the system measures is based on
recent theoretical results for the Coxian/Coxian/1 system. A numerical technique is developed for every
MCMC iteration so that the transient queue length and waiting time distributions and the duration of
a busy period can be estimated. The approach is illustrated with both simulated and real data
Exact asymptotics for fluid queues fed by multiple heavy-tailed on-off flows
We consider a fluid queue fed by multiple On-Off flows with heavy-tailed
(regularly varying) On periods. Under fairly mild assumptions, we prove that
the workload distribution is asymptotically equivalent to that in a reduced
system. The reduced system consists of a ``dominant'' subset of the flows, with
the original service rate subtracted by the mean rate of the other flows. We
describe how a dominant set may be determined from a simple knapsack
formulation. The dominant set consists of a ``minimally critical'' set of
On-Off flows with regularly varying On periods. In case the dominant set
contains just a single On-Off flow, the exact asymptotics for the reduced
system follow from known results. For the case of several
On-Off flows, we exploit a powerful intuitive argument to obtain the exact
asymptotics. Combined with the reduced-load equivalence, the results for the
reduced system provide a characterization of the tail of the workload
distribution for a wide range of traffic scenarios
Transient bayesian inference for short and long-tailed GI/G/1 queueing systems
In this paper, we describe how to make Bayesian inference for the transient behaviour and busy period in a single server system with general and unknown distribution for the service and interarrival time. The dense family of Coxian distributions is used for the service and arrival process to the system. This distribution model is reparametrized such that it is possible to define a non-informative prior which allows for the approximation of heavytailed distributions. Reversible jump Markov chain Monte Carlo methods are used to estimate the predictive distribution of the interarrival and service time. Our procedure for estimating the system measures is based in recent results for known parameters which are frequently implemented by using symbolical packages. Alternatively, we propose a simple numerical technique that can be performed for every MCMC iteration so that we can estimate interesting measures, such as the transient queue length distribution. We illustrate our approach with simulated and real queues
A large-deviations analysis of the GI/GI/1 SRPT queue
We consider a GI/GI/1 queue with the shortest remaining processing time
discipline (SRPT) and light-tailed service times. Our interest is focused on
the tail behavior of the sojourn-time distribution. We obtain a general
expression for its large-deviations decay rate. The value of this decay rate
critically depends on whether there is mass in the endpoint of the service-time
distribution or not. An auxiliary priority queue, for which we obtain some new
results, plays an important role in our analysis. We apply our SRPT-results to
compare SRPT with FIFO from a large-deviations point of view.Comment: 22 page
A Tandem Fluid Network with L\'evy Input in Heavy Traffic
In this paper we study the stationary workload distribution of a fluid tandem
queue in heavy traffic. We consider different types of L\'evy input, covering
compound Poisson, -stable L\'evy motion (with ), and
Brownian motion. In our analysis we separately deal with L\'evy input processes
with increments that have finite and infinite variance. A distinguishing
feature of this paper is that we do not only consider the usual heavy-traffic
regime, in which the load at one of the nodes goes to unity, but also a regime
in which we simultaneously let the load of both servers tend to one, which, as
it turns out, leads to entirely different heavy-traffic asymptotics. Numerical
experiments indicate that under specific conditions the resulting simultaneous
heavy-traffic approximation significantly outperforms the usual heavy-traffic
approximation
- …