Results 1  10
of
344,309
HeavyTraffic Limits for Nearly Deterministic Queues
"... We establish heavytraffic limits for “nearly deterministic” queues, such as the G/D/n manyserver queue. Waiting times before starting service in the G/D/n queue are equivalent to waiting times in an associated Gn/D/1 model, where the Gn denotes “cyclic thinning ” of order n, indicating that the or ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
We establish heavytraffic limits for “nearly deterministic” queues, such as the G/D/n manyserver queue. Waiting times before starting service in the G/D/n queue are equivalent to waiting times in an associated Gn/D/1 model, where the Gn denotes “cyclic thinning ” of order n, indicating
Applied Probability Trust (12 May 2011) HEAVYTRAFFIC LIMITS FOR NEARLY DETERMINISTIC QUEUES
"... We establish heavytraffic limits for nearly deterministic queues, such as the G/D/n manyserver queue. Since waiting times before starting service in the G/D/n queue are equivalent to waiting times in an associated Gn/D/1 model, where the Gn interarrival times are the sum of n consecutive interarri ..."
Abstract
 Add to MetaCart
We establish heavytraffic limits for nearly deterministic queues, such as the G/D/n manyserver queue. Since waiting times before starting service in the G/D/n queue are equivalent to waiting times in an associated Gn/D/1 model, where the Gn interarrival times are the sum of n consecutive
THE HEAVYTRAFFIC BOTTLENECK PHENOMENON IN OPEN QUEUEING NETWORKS
, 1990
"... This note describes a simulation experiment involving nine exponential queues in series with a nonPoisson arrival process, which demonstrates that the heavytraffic bottleneck phenomenon can occur in practice (at reasonable traffic intensities) as well as in theory (in the limit). The results revea ..."
Abstract

Cited by 14 (6 self)
 Add to MetaCart
This note describes a simulation experiment involving nine exponential queues in series with a nonPoisson arrival process, which demonstrates that the heavytraffic bottleneck phenomenon can occur in practice (at reasonable traffic intensities) as well as in theory (in the limit). The results
HeavyTraffic Revenue Maximization in Parallel Multiclass Queues
"... Motivated by revenue maximization in server farms with admission control, we investigate optimal scheduling in parallel processorsharing queues. Incoming customers are distinguished in multiple classes and we define revenue as a weighted sum of class throughputs. Under these assumptions, we describ ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
describe a heavytraffic limit for the revenue maximization problem and study the asymptotic properties of the optimization model as the number of clients increases. Our main result is a simple heuristic that is able to provide tight guarantees on the optimality gap of its solutions. In the general case
Efficiencydriven heavytraffic approximations for manyserver queues with abandonments
 Management Science
, 2004
"... Motivated by the desire to understand the performance of serviceoriented call centers, which often provide lowtomoderate quality of service, this paper investigates the efficiencydriven (ED) limiting regime for manyserver queues with abandonments. The starting point is the realization that, in ..."
Abstract

Cited by 79 (38 self)
 Add to MetaCart
of delay necessarily approaches 1 in the ED regime, the ED regime can be realistic because, due to the abandonments, the delays need not be excessively large. This paper establishes ED manyserver heavytraffic limits and develops associated approximations for performance measures in the M/M/s/r + M model
© Institute of Mathematical Statistics, 2014 MANYSERVER HEAVYTRAFFIC LIMIT FOR QUEUES WITH
"... A manyserver heavytraffic FCLT is proved for the Gt/M/st + GI queueing model, having timevarying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment according to a general probability distribution. The FCLT provides theoreti ..."
Abstract
 Add to MetaCart
A manyserver heavytraffic FCLT is proved for the Gt/M/st + GI queueing model, having timevarying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment according to a general probability distribution. The FCLT provides
A selfclocked fair queueing scheme for broadband applications
 Proceedings of IEEE INFOCOM’94
, 1994
"... A n ef ic ient fa i r queueing scheme which is feasible f o r broadband implementation i s proposed and i ts performance i s analyzed. W e define fairness in a selfcontained manner, eliminating the need f o r the hypothetical fluidflow reference sys tem used in the present state of art and ther ..."
Abstract

Cited by 453 (0 self)
 Add to MetaCart
and thereby removing the associated computational complexity. The scheme i s based on the adoption of an internally generated virtual time as the index of work progress, hence the name selfclocked fair queueing. W e prove that the scheme possesses the desired fairness property and i s nearly optimal
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
, 2004
"... Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear m ..."
Abstract

Cited by 1513 (20 self)
 Add to MetaCart
Suppose we are given a vector f in RN. How many linear measurements do we need to make about f to be able to recover f to within precision ɛ in the Euclidean (ℓ2) metric? Or more exactly, suppose we are interested in a class F of such objects— discrete digital signals, images, etc; how many linear measurements do we need to recover objects from this class to within accuracy ɛ? This paper shows that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal f ∈ F decay like a powerlaw (or if the coefficient sequence of f in a fixed basis decays like a powerlaw), then it is possible to reconstruct f to within very high accuracy from a small number of random measurements. typical result is as follows: we rearrange the entries of f (or its coefficients in a fixed basis) in decreasing order of magnitude f  (1) ≥ f  (2) ≥... ≥ f  (N), and define the weakℓp ball as the class F of those elements whose entries obey the power decay law f  (n) ≤ C · n −1/p. We take measurements 〈f, Xk〉, k = 1,..., K, where the Xk are Ndimensional Gaussian
Adolescencelimited and lifecoursepersistent antisocial behavior: Adevelopmental taxonomy
 Psychological Review
, 1993
"... A dual taxonomy is presented to reconcile 2 incongruous facts about antisocial behavior: (a) It shows impressive continuity over age, but (b) its prevalence changes dramatically over age, increasing almost 10fold temporarily during adolescence. This article suggests that delinquency conceals 2 dist ..."
Abstract

Cited by 549 (4 self)
 Add to MetaCart
, children's neuropsychological problems interact cumulatively with their criminogenic environments across development, culminating in a pathological personality. According to the theory of adolescencelimited antisocial behavior, a contemporary maturity gap encourages teens to mimic antisocial behavior
Results 1  10
of
344,309