Related papers: Overlap Times in the $GI^B/GI/\infty$ Queue
Delay or queue length information has the potential to influence the decision of a customer to use a service system. Thus, it is imperative for service system managers to understand how the information that they provide will affect the…
We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting time distribution. For the special case of Poisson arrivals…
In discrete time, customers arrive at random. Each waits until one of three servers is available; each thereafter departs at random. We seek the distribution of maximum line length of idle customers. Algebraic expressions obtained for the…
Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several…
We consider the problem of customer equilibrium strategies in an M/M/1 queue under dynamic service control. The service rate switches between a low and a high value depending on system congestion. Arriving customers do not observe the…
Time spent in processing zones at an airport are an important part of the passenger's airport experience. It undercuts the time spent in the rest of the airport, and therefore the revenue that could be generated from shopping and dining. It…
Modern Internet services, such as those at Google, Yahoo!, and Amazon, handle billions of requests per day on clusters of thousands of computers. Because these services operate under strict performance requirements, a statistical…
The effect of signals on stability, throughput region, and delay in a two-user slotted ALOHA based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model…
This short communication considers an infinite-server system with overdispersed input. The objective is to identify the exact tail asymptotics of the number of customers present at a given point in time under a specific scaling of the model…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…
We investigate the potential impact of communication and human performance uncertainties on runway operations. Specifically, we consider these impacts within the context of an arrival scenario with two converging flows: a straight-in…
We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding…
We present a statistical test that can be used to verify supervisory requirements concerning overlapping time windows for the long-term calibration in rating systems. In a first step, we show that the long-run default rate is approximately…
Consider an M/M/$s$ queue with the additional feature that the arrival rate is a random variable of which only the mean, variance, and range are known. Using semi-infinite linear programming and duality theory for moment problems, we…
In this paper, we propose a new measure for detecting overlap in multivariate Gaussian clusters. The aim of online learning from data streams is to create clustering, classification, or regression models that can adapt over time based on…
Motivated by demand prediction for the custodial prison population in England and Wales, this paper describes an approach to the study of service systems using infinite server queues, where the system has non-empty initial state and the…
We consider a system consisting of a server alternating between two service points. At both service points there is an infinite queue of customers that have to undergo a preparation phase before being served. We are interested in the…
This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly…
The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon…
In this paper, we introduce and study a time-changed variant of the Erlang queue with multiple arrivals where the time-changing component used is the first hitting time of a tempered stable subordinator. The system of fractional…