Results 1  10
of
13
Logarithmic Asymptotics For SteadyState Tail Probabilities In A SingleServer Queue
, 1993
"... We consider the standard singleserver queue with unlimited waiting space and the firstin firstout service discipline, but without any explicit independence conditions on the interarrival and service times. We find conditions for the steadystate waitingtime distribution to have smalltail asympt ..."
Abstract

Cited by 150 (14 self)
 Add to MetaCart
We consider the standard singleserver queue with unlimited waiting space and the firstin firstout service discipline, but without any explicit independence conditions on the interarrival and service times. We find conditions for the steadystate waitingtime distribution to have smalltail asymptotics of the form x  1 logP(W > x)  q * as x for q * > 0. We require only stationarity of the basic sequence of service times minus interarrival times and a Ga .. rtnerEllis condition for the cumulant generating function of the associated partial sums, i.e., n  1 log Ee qS n y(q) as n , plus regularity conditions on the decay rate function y. The asymptotic decay rate q * is the root of the equation y(q) = 0. This result in turn implies a corresponding asymptotic result for the steadystate workload in a queue with general nondecreasing input. This asymptotic result covers the case of multiple independent sources, so that it provides additional theoretical support for a concept of effective bandwidths for admission control in multiclass queues based on asymptotic decay rates.
Classifying scheduling policies with respect to unfairness in an M/GI/1
 Proc. of SIGMETRICS’03
, 2003
"... It is common to classify scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness. For example, a policy that biases towards short jobs so as to minimize mean response time, may end up being unfair to long ..."
Abstract

Cited by 86 (15 self)
 Add to MetaCart
It is common to classify scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness. For example, a policy that biases towards short jobs so as to minimize mean response time, may end up being unfair to long jobs. In this paper we define three types of unfairness and demonstrate large classes of scheduling policies that fall into each type. We end with a discussion on which jobs are the ones being treated unfairly. 1
Waitingtime tail probabilities in queues with longtail servicetime distributions
 QUEUEING SYSTEMS
, 1994
"... We consider the standard GI/G/1 queue with unlimited waiting room and the firstin firstout service discipline. We investigate the steadystate waitingtime tail probabilities P(W> x) when the servicetime distribution has a longtail distribution, i.e., when the servicetime distribution fails to ..."
Abstract

Cited by 55 (21 self)
 Add to MetaCart
We consider the standard GI/G/1 queue with unlimited waiting room and the firstin firstout service discipline. We investigate the steadystate waitingtime tail probabilities P(W> x) when the servicetime distribution has a longtail distribution, i.e., when the servicetime distribution fails to have a finite moment generating function. We have developed algorithms for computing the waitingtime distribution by Laplace transform inversion when the Laplace transforms of the interarrivaltime and servicetime distributions are known. One algorithm, exploiting Pollaczek’s classical contourintegral representation of the Laplace transform, does not require that either of these transforms be rational. To facilitate such calculations, we introduce a convenient twoparameter family of longtail distributions on the positive half line with explicit Laplace transforms. This family is a Pareto mixture of exponential (PME) distributions. These PME distributions have monotone densities and Paretolike tails, i.e., are of order x − r for r> 1. We use this family of longtail distributions to investigate the quality of approximations based on asymptotics for P(W> x) as x → ∞. We show that the asymptotic approximations with these longtail servicetime distributions can be remarkably inaccurate for typical x values of interest. We also derive multiterm asymptotic expansions for the waitingtime tail probabilities in the M/G/1 queue. Even three terms of this expansion can be remarkably inaccurate for typical x values of interest. Thus, we evidently must rely on numerical algorithms for determining the waitingtime tail probabilities in this case. When working with servicetime data, we suggest using empirical Laplace transforms.
Exponential approximations for tail probabilities in queues, I: waiting times
 Oper. Res
, 1995
"... In this paper, we focus on simple exponential approximations for steadystate tail probabilities in G/GI/1 queues based on largetime asymptotics. We relate the largetime asymptotics for the steadystate waiting time, sojourn time and workload. We evaluate the exponential approximations based on th ..."
Abstract

Cited by 39 (20 self)
 Add to MetaCart
In this paper, we focus on simple exponential approximations for steadystate tail probabilities in G/GI/1 queues based on largetime asymptotics. We relate the largetime asymptotics for the steadystate waiting time, sojourn time and workload. We evaluate the exponential approximations based on the exact asymptotic parameters and their approximations by making comparisons with exact numerical results for BMAP/GI/1 queues. Numerical examples show that the exponential approximations are remarkably accurate at the 90 th percentile and beyond. Key words: queues; approximations; asymptotics; tail probabilities; sojourn time and workload.
Effective Bandwidth in High Speed Digital Networks
 IEEE Journal on Selected Areas in Communications
, 1999
"... The theory of large deviations provides a simple unified basis for statistical mechanics, information theory and queueing theory. The objective of this paper is to use large deviation theory and the Laplace method of integration to provide an simple intuitive overview of the recently developed theor ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
The theory of large deviations provides a simple unified basis for statistical mechanics, information theory and queueing theory. The objective of this paper is to use large deviation theory and the Laplace method of integration to provide an simple intuitive overview of the recently developed theory of effective bandwidth for high speed digital networks, especially ATM networks. This includes (i) identification of the appropriate energy function, entropy function and effective bandwidth function of a source, (ii) the calculus of the effective bandwidth functions, (iii) bandwidth allocation and buffer management, (iv) traffic descriptors, and (v) envelope processes and conjugate processes for fast simulations and bounds.
Fairness and Classifications
"... The growing trend in computer systems towards using scheduling policies that prioritize jobs with small service requirements has resulted in a new focus on the fairness of such policies. In particular, researchers have been interested in whether prioritizing small job sizes results in large jobs bei ..."
Abstract

Cited by 13 (8 self)
 Add to MetaCart
The growing trend in computer systems towards using scheduling policies that prioritize jobs with small service requirements has resulted in a new focus on the fairness of such policies. In particular, researchers have been interested in whether prioritizing small job sizes results in large jobs being treated “unfairly.” However, fairness is an amorphous concept and thus difficult to define and study. This article provides a short survey of recent work in this area.
A HeavyTraffic Expansion For Asymptotic Decay Rates Of Tail Probabilities In MultiChannel Queues
 RES. LETTERS
, 1992
"... We establish a heavytraffic asymptotic expansion (in powers of one minus the traffic intensity) for the asymptotic decay rates of queuelength and workload tail probabilities in stable infinitecapacity multichannel queues. The specific model has multiple independent heterogeneous servers, each wi ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
We establish a heavytraffic asymptotic expansion (in powers of one minus the traffic intensity) for the asymptotic decay rates of queuelength and workload tail probabilities in stable infinitecapacity multichannel queues. The specific model has multiple independent heterogeneous servers, each with i.i.d. service times, that are independent of the arrival process, which is the superposition of independent nonidentical renewal processes. Customers are assigned to the first available server in the order of arrival. The heavytraffic expansion yields relatively simple approximations for the tails of steadystate distributions and higher percentiles, yielding insight into the impact of the first three moments of the defining distributions.
Numerical Transform Inversion to Analyze Teletraffic Models
 IN THE EVOLUTION OF TELECOMMUNICATIONS NETWORKS, PROCEEDINGS OF THE 14 TH INTERNATIONAL TELETRAFFIC CONGRESS
, 1994
"... ..."
Maximum values in queueing processes
 Prob. Engrg. and Info. Sci
, 1995
"... Motivated by extremevalue engineering in service systems, we develop and evaluate simple approximations for the distributions of maximum values of queueing processes over large time intervals. We provide approximations for several different processes, such as the waiting times of successive custome ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Motivated by extremevalue engineering in service systems, we develop and evaluate simple approximations for the distributions of maximum values of queueing processes over large time intervals. We provide approximations for several different processes, such as the waiting times of successive customers, the remaining workload at an arbitrary time, and the queue length at an arbitrary time, in a variety of models. All our approximations are based on extremevalue limit theorems. Our first approach is to approximate the queueing process by onedimensional reflected Brownian motion (RBM). We then apply the extremevalue limit for RBM, which we derive here. Our second approach starts from exponential asymptotics for the tail of the steadystate distribution. We obtain an approximation by relating the given process to an associated sequence of i.i.d. random variables with the same asymptotic exponential tail. We use estimates of the asymptotic variance of the queueing process to determine an approximate number of variables in this associated i.i.d. sequence. Our third approach is to simplify GI/G/1 extremevalue limiting formulas in Iglehart (1972) by approximating the distribution of an idle period by the stationaryexcess distribution of an interarrival time. We use simulation to evaluate the quality of these approximations for the maximum workload. From the simulations, we obtain a rough estimate of the time when the extreme value limit theorems begin to yield good approximations.
Realtime delay estimation based on delay history
, 2007
"... Motivated by interest in making delay announcements to arriving customers who must wait in call centers and related service systems, we study the performance of alternative realtime delay estimators based on recent customer delay experience. The main estimators considered are: (i) the delay of the ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
Motivated by interest in making delay announcements to arriving customers who must wait in call centers and related service systems, we study the performance of alternative realtime delay estimators based on recent customer delay experience. The main estimators considered are: (i) the delay of the last customer to enter service (LES), (ii) the delay experienced so far by the customer at the head of the line (HOL), and (iii) the delay experienced by the customer to have arrived most recently among those who have already completed service (RCS). We compare these delayhistory estimators to the estimator based on the queue length (QL), which requires knowledge of the mean interval between successive service completions in addition to the queue length. We characterize performance by the mean squared error (MSE). We do analysis and conduct simulations for the standard GI/M/s multiserver queueing model, emphasizing the case of large s. We obtain analytical results for the conditional distribution of the delay given the observed HOL delay. An approximation to its mean value serves as a refined estimator. For all three candidate delay estimators, the MSE relative to the square of the mean is asymptotically negligible in the manyserver and classical heavytraffic limiting regimes.