Results 251 to 260 of about 12,280 (289)

A Many-Server Queue with Service Interruptions

Operations Research, 1968
A steady-state M/M/N queuing system where each server is subject to random breakdowns of exponentially distributed duration is studied and analyzed. The moment generating function of the queue size is obtained in explicit form for N≦ 2. For larger values of N a numerical method is suggested.
Mitrani I, Avi-Itzhak B
openaire   +2 more sources

Approximating many-server queues by means of single-server queues

Advances in Applied Probability, 1978
Obtaining time dependent results for many server queues is, under general structural assumptions, a hard problem. This paper makes an attempt to approximate stochastically the behaviour of a general many server queue by using single server queues as stochastic bounds. We propose three alternative ways of constructing approximating single server queues.
Elja Arjas, Tapani Lehtonen
openaire   +1 more source

A Many Server Bulk Queue

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

Transient Properties of Many-Server Queues and Related QBDs

Queueing Systems, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Asmussen, S., Pihlsgård, M.
openaire   +2 more sources

The Impact of Delay Announcements in Many-Server Queues with Abandonment

Operations Research, 2009
This paper studies the performance impact of making delay announcements to arriving customers who must wait before starting service in a many-server queue with customer abandonment. The queue is assumed to be invisible to waiting customers, as in most customer contact centers, when contact is made by telephone, e-mail, or instant messaging.
Mor Armony, Nahum Shimkin, Ward Whitt
openaire   +1 more source

Virtual allocation policies for many-server queues with abandonment

Mathematical Methods of Operations Research, 2019
zbMATH 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, 1969
AbstractThe 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, 2012
SITA 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), 2020
In 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, 1986
This 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