Results 261 to 270 of about 12,280 (289)

Algorithms for Time-Varying Networks of Many-Server Fluid Queues

INFORMS Journal on Computing, 2014
Motivated by large-scale service systems with network structure, we introduced in a previous paper a time-varying open network of many-server fluid queues with customer abandonment from each queue and time-varying proportional routing among the queues, and showed how performance functions can be determined.
Yunan Liu, Ward Whitt
openaire   +2 more sources

On the convergence to stationarity of the many-server Poisson queue

Journal of Applied Probability, 1999
We consider the many-server Poisson queue M/M/c with arrival intensity λ, mean service time 1 and λ/c < 1. Let X(t) be the number of customers in the system at time t and assume that the system is initially empty. Then pn(t) = P(X(t) = n) converges to the stationary probability πn = P(X = n). The integrals ∫0∞[E(X)-E(X(t))]dt and ∫0∞[P(X≤n) − P(X(t)≤
Stadje, Wolfgang, Parthasarathy, P. R.
openaire   +2 more sources

Light traffic approximations in many-server queues

Advances in Applied Probability, 1992
This paper complements two previous studies (Daley and Rolski (1984), (1991)) by investigating limit properties of the waiting time in k -server queues with renewal arrival process under ‘light traffic' conditions.
Daley, D. J., Rolski, T.
openaire   +1 more source

Fluid models for many-server Markovian queues in a changing environment

Operations Research Letters, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
B. Zhang (Bo), A.P. Zwart (Bert)
openaire   +2 more sources

Learning to Schedule in Multiclass Many-Server Queues with Abandonment

Operations Research
How to Learn Which Customer Class to Serve Next? In “Learning to Schedule in Multiclass Many-Server Queues with Abandonment”, Zhong, Birge, and Ward tackle the challenge of scheduling (that is, how to choose the customer that a newly available server will serve) in a multiclass many-server queueing system where customers may abandon ...
Yueyang Zhong, John R. Birge, Amy R. Ward   +2 more
openaire   +1 more source

Time-Dependent Solution of the Many-Server Poisson Queue

Operations Research, 1960
In this paper we obtain the Laplace transform of the transient probabilities of the ordered queuing problem, with Poisson inputs, multiple channels, and exponential service times. Explicit expressions are derived for the two-channel case and known equilibrium conditions are shown to hold. The proof proceeds in two stages. The first obtains the Laplace
openaire   +1 more source

Spatial Queues with Infinitely Many Servers

2003
Spatial Queues with infinitely many servers arise naturally as models for the planning process of mobile communication networks. A very useful concept has been developed by Cinlar [44], partly on the basis of Massey and Whitt [84]. This assumes single arrivals distributed in time as a non-homogeneous Poisson process. Every arrival chooses a position in
openaire   +1 more source

Conditions for ergodicity in queues with many servers and waiting

Siberian Mathematical Journal, 1983
Translation from Sib. Mat. Zh. 24, No.6(142), 168-175 (Russian) (1983; Zbl 0536.60091).
openaire   +1 more source

Some general results for many server queues

Advances in Applied Probability, 1973
Pollaczek's theory for the many server queue is generalized and extended. Pollaczek (1961) found the distribution of the actual waiting times in the model G/G/s as a solution of a set of integral equations.
openaire   +2 more sources

On the many server queue with exponential service times

Advances in Applied Probability, 1973
The general theory for the many server queue due to Pollaczek (1961) and generalized by the author (de Smit (1973)) is applied to the system with exponential service times. In this way many explicit results are obtained for the distributions of characteristic quantities, such as the actual waiting time, the virtual waiting time, the queue length, the ...
openaire   +2 more sources