Results 1  10
of
185,220
Heavytraffic limits for loss proportions in singleserver queues
 Queueing Syst
, 2004
"... Abstract. We establish heavytraffic stochasticprocess limits for the queuelength and overflow stochastic processes in the standard singleserver queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related singleserver models ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. We establish heavytraffic stochasticprocess limits for the queuelength and overflow stochastic processes in the standard singleserver queue with finite waiting room (G/G/1/K). We show that, under regularity conditions, the content and overflow processes in related singleserver models
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
MultipleInput HeavyTraffic RealTime Queues
, 2000
"... A single queueing station which serves K input streams is considered. Each stream is an independent renewal process, with customers having random leadtimes. Customers are served by processor sharing across streams. Within each stream, two disciplines are considered { earliestdeadlinerst and rstin ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
rstout. The set of current lead times of the K streams is modeled as a Kdimensional vector of random counting measures on R , and the limit of this vector of measurevalued processes is obtained under heavy trac conditions. Short title: MultipleInput Queues Keywords: Due dates, heavy trac
Heavytraffic limits for the G/H∗ 2 /n/m queue
 Math. Oper. Res
, 2005
"... We establish heavytraffic stochasticprocess limits for queuelength, waitingtime and overflow stochastic processes in a class of G/GI/n/m queueing models with n servers and m extra waiting spaces. We let the arrival process be general, only requiring that it satisfy a functional central limit th ..."
Abstract

Cited by 51 (12 self)
 Add to MetaCart
We establish heavytraffic stochasticprocess limits for queuelength, waitingtime and overflow stochastic processes in a class of G/GI/n/m queueing models with n servers and m extra waiting spaces. We let the arrival process be general, only requiring that it satisfy a functional central limit
Large Deviations and Overflow Probabilities for the General SingleServer Queue, With Applications
, 1994
"... We consider from a thermodynamic viewpoint queueing systems where the workload process is assumed to have an associated large deviation principle with arbitrary scaling: there exist increasing scaling functions (a t ; v t ; t 2 R+ ) and a rate function I such that if (W t ; t 2 R+ ) denotes the wo ..."
Abstract

Cited by 213 (19 self)
 Add to MetaCart
We consider from a thermodynamic viewpoint queueing systems where the workload process is assumed to have an associated large deviation principle with arbitrary scaling: there exist increasing scaling functions (a t ; v t ; t 2 R+ ) and a rate function I such that if (W t ; t 2 R+ ) denotes
HEAVYTRAFFIC LIMITS FOR MANYSERVER QUEUES WITH SERVICE INTERRUPTIONS
, 2008
"... We establish manyserver heavytraffic limits for G/M/n + M queueing models, allowing customer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queuelength process where the limit is an ordinary diffe ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We establish manyserver heavytraffic limits for G/M/n + M queueing models, allowing customer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queuelength process where the limit is an ordinary
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
Stabilizing Performance in a SingleServer Queue with TimeVarying Arrival Rate
, 2014
"... We consider a general Gt/Gt/1 singleserver queue with unlimited waiting space and a timevarying arrival rate, where the the service rate at each time is subject to control. We study the ratematching control, where the the service rate is made proportional to the arrival rate. We show that the mod ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
waiting time with the ratematching servicerate control becomes inversely proportional to the arrival rate in a heavytraffic limit. We also show that no control that stabilizes the queue length asymptotically in heavytraffic can also stabilize the virtual waiting time. Then we consider two square
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
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
Results 1  10
of
185,220