Related papers: On open problems in polling systems

Two multivehicle routing problems are considered in the framework that a visit to a location must take place during a specific time window in order to be counted and all time windows are the same length. In the first problem, the goal is to…

A discrete-time decentralized routing problem in a service system consisting of two service stations and two controllers is investigated. Each controller is affiliated with one station. Each station has an infinite size buffer. Exogenous…

Demand for studying queueing systems with multiple servers providing correlated services was created about 60 years ago, motivated by various applications. In recent years, the importance of such studies has been significantly increased,…

Consider a population of customers each of which needs to decide independently when to arrive to a facility that provides a service during a fixed period of time, say a day. This is a common scenario in many service systems such as a bank,…

This paper considers a network of infinite-server queues with the special feature that, triggered by specific events, the network population vector may undergo a linear transformation (a `multiplicative transition'). For this model we…

A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a…

Our comments are in two parts. First, we make some observations regarding the methodology in Chambers et al. [arXiv:0708.0302]. Second, we briefly describe another interesting network monitoring problem that arises in the context of…

This paper presents a second-order heavy traffic analysis of a single server queue that processes customers having deadlines using the earliest-deadline-first scheduling policy. For such systems, referred to as real-time queueing systems,…

Polling systems are a well-established subject in queueing theory. However, their formal treatments generally rely heavily on relatively sophisticated theoretical tools, such as moment generating functions and Laplace transforms, and…

We investigate Markovian queues that are examined by a controller at random times determined by a Poisson process. Upon examination, the controller sets the service speed to be equal to the minimum of the current number of customers in the…

Social choice has become a foundational component of modern machine learning systems. From auctions and resource allocation to the alignment of large generative models, machine learning pipelines increasingly aggregate heterogeneous…

This paper studies a spatial queueing system on a circle, polled at random locations by a myopic server that can only observe customers in a bounded neighborhood. The server operates according to a greedy policy, always serving the nearest…

Social networks are increasingly being used to conduct polls. We introduce a simple model of such social polling. We suppose agents vote sequentially, but the order in which agents choose to vote is not necessarily fixed. We also suppose…

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…

We consider many-server queueing systems with heterogeneous exponential servers and renewal arrivals. The service rate of each server is a random variable drawn from a given distribution. We develop a framework for analyzing the heavy…

Consider the reliability problem in a system with two different devices, which can break down.

We consider a GI/H/n queueing system. In this system, there are multiple servers in the queue. The inter-arrival time is general and independent, and the service time follows hyper-exponential distribution. Instead of stochastic…

In this paper, we present a condition to obtain instability for a class of queueing networks where the arrival rates in each server are constant and the departure rate in each server is a decreasing function of the queue lengths of other…

Interacting networks are different in nature to single networks. The study of queuing processes on interacting networks is underdeveloped. It presents new mathematical challenges and is of importance to applications. This area of operations…

We consider $M/G/\infty$ queues with gated service and obtain results on the distribution of the stage length and the number of customers served in a stage when the system is stationary. The stage length density is expressed as an infinite…