Related papers: A token-based central queue with order-independent…
We consider a fundamental pricing model in which a fixed number of units of a reusable resource are used to serve customers. Customers arrive to the system according to a stochastic process and upon arrival decide whether or not to purchase…
We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The corresponding stochastic processes are represented by…
In this paper, we present a queueing model for quantum communication networks, a rapidly growing field of research inspired by its technological promise and recent experimental successes. The model consists of a primary queue and a service…
We consider a model describing the waiting time of a server alternating between two service points. This model is described by a Lindley-type equation. We are interested in the time-dependent behaviour of this system and derive explicit…
In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and…
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…
This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if…
We consider the problem of pricing a reusable resource service system. Potential customers arrive according to a Poisson process and purchase the service if their valuation exceeds the current price. If no units are available, customers…
We consider a system of $N$ parallel queues with identical exponential service rates and a single dispatcher where tasks arrive as a Poisson process. When a task arrives, the dispatcher always assigns it to an idle server, if there is any,…
To perform a queuing analysis or design in a communications context, we need to estimate the values of the input parameters, specifically the mean of the arrival rate and service time. In this paper, we propose an approach for estimating…
Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are generally staffed by people.…
We consider the $N$-model queueing system with a waiting time dependent threshold on the diagonal: the service discipline is First--Come--First--Served, but type-1 jobs can only be served by server 2 if their waiting time exceeds a…
We establish the averaging property for a queuing process with one server, M(t)/GI/1. It is a new relation between the output flow rate and the input flow rate, crucial in the study of the Poisson Hypothesis. Its implications include the…
We analyze an M/M/1 queue with a service discipline in which customers, upon arriving when the server is busy, search a sequence of stations for a vacant station at which to wait, and in which the server, upon becoming free when one or more…
The paper studies closed queueing networks containing a server station and $k$ client stations. The server station is an infinite server queueing system, and client stations are single-server queueing systems with autonomous service, i.e.…
We present an algorithm for the problem of linear distributed estimation of a parameter in a network where a set of agents are successively taking measurements. The approach considers a roaming token in a network that carries the estimate,…
The non-stationary Erlang-A queue is a fundamental queueing model that is used to describe the dynamic behavior of large scale multi-server service systems that may experience customer abandonments, such as call centers, hospitals, and…
To achieve high availability and low latency, distributed data stores often geographically replicate data at multiple sites called replicas. However, this introduces the data consistency problem. Due to the fundamental tradeoffs among…
This paper considers the time evolution of a queue that is embedded in a Poisson point process of moving wireless interferers. The queue is driven by an external arrival process and is subject to a time-varying service process that is a…
Classical queuing network control strategies typically rely on accurate knowledge of model data, i.e., arrival and service rates. However, such data are not always available and may be time-variant. To address this challenge, we consider a…