Results 221 to 230 of about 6,164 (256)
Some of the next articles are maybe not open access.
Operations Research, 1966
In this study the theory of derived Markov chains is applied to a queuing system with n servers and group service. Application to a queuing system with only one server and group service or arrival in batches has been dealt with already. Although the quasi-derived Poisson servicing is not without its restrictions on the batch size distribution, it ...
openaire +2 more sources
In this study the theory of derived Markov chains is applied to a queuing system with n servers and group service. Application to a queuing system with only one server and group service or arrival in batches has been dealt with already. Although the quasi-derived Poisson servicing is not without its restrictions on the batch size distribution, it ...
openaire +2 more sources
Transient Properties of Many-Server Queues and Related QBDs
Queueing Systems, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asmussen, S., Pihlsgård, M.
openaire +2 more sources
Virtual allocation policies for many-server queues with abandonment
Mathematical Methods of Operations Research, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhenghua Long, Jiheng Zhang
openaire +3 more sources
A Many Server Queueing Problem with Variable Departures
ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1969AbstractThe present paper studies the behaviour of a queueing system in which arrivals form a Poisson distribution and departures occur in batches of variable size. Service is accomplished in M parallel channels and each channel has the same fixed capacity of serving at the most K units. Service is ordered and instantaneous.
openaire +2 more sources
Analysis of SITA queues with many servers and spacetime geometry
ACM SIGMETRICS Performance Evaluation Review, 2012SITA queues were introduced in [4] as a means for reducing job size variance at individual hosts in a server farm. It turns out that SITA queues are mathematically very interesting. For example, they satisfy a duality that is typical of automorphic forms in number theory.
Eitan Bachmat, Assaf Natanzon
openaire +1 more source
The Probability Distribution of the AoI in Queues with Infinitely Many Servers
IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2020In this paper, we derive an explicit expression for the probability distribution of the age of information (AoI) in the $\mathrm{GI}/\mathrm{GI}/\infty$ queue with loss. Two special cases $\mathrm{M}/\mathrm{GI}/\infty$ and $\mathrm{D}/\mathrm{GI}/\infty$ are discussed, where the distribution function of the AoI is shown to take a simple closed ...
openaire +1 more source
A correlated queue with infinitely many servers
Journal of Applied Probability, 1986This work analyses a queueing mechanism with infinitely many servers in which the interarrival interval T preceding the arrival of a customer and his service time S are assumed correlated. A bivariate distribution with negative exponential marginals is used and the Laplace transforms pn (z) of the system probabilities in transient state
openaire +1 more source
On the convergence to stationarity of the many-server Poisson queue
Journal of Applied Probability, 1999We 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, 1992This 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
Time-Dependent Solution of the Many-Server Poisson Queue
Operations Research, 1960In 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