We consider the stochastic matching model on a non-bipartite compatibility graph and analyze the impact of adding an edge to the expected number of items in the system. One may see adding an edge as increasing the flexibility of the system, for ...

This paper considers a capacity allocation problem in a two-channel service system. Customers can receive service from either a single-server queueing system, which serves the customers waiting in line one by one, or a clearing service system, ...

We consider a stochastic matching model with a general compatibility graph, as introduced in Mairesse and Moyal (J Appl Probab 53(4):1064–1077, 2016). We prove that most common matching policies (including fcfm, priorities and random) satisfy a ...

Recently, driven by redundancy systems and matching systems, there has been renewed interest in models with product form stationary distributions. By a “product form,” we mean that the stationary distribution can be expressed as a product of terms,...

We study a type of correlated queue in which its inter-arrival and service times are correlated, with their joint distribution being characterized by a copula function. This characterization allows for very generally correlated inter-arrival and ...

A system manager makes dynamic pricing and dispatch control decisions in a queueing network model motivated by ride hailing applications. A novel feature of the model is that it incorporates travel times. Unfortunately, this renders the exact ...

We study service rate control problems for an M/M/1 queue with server breakdowns in which the breakdown rate is assumed to be a function of the service rate. Assuming that the queue has infinite capacity, we first establish the optimality ...

Batch service queueing systems are basically classified into two types: a time-based system in which the service facilities depart according to inter-departure times that follows a given distribution, such as the conventional bus system, and a ...${}^{\mathit{}}$$$$\mathit{}$${}^{\mathit{}}$$$$\mathit{}$${}^{\mathit{}}$$$${}^{}$$$$\mathit{}\mathit{}$${}^{}$$$$$${}^{}$$$

Motivated by queueing applications, we study various reflected autoregressive processes with dependencies. Among others, we study cases where the interarrival and service times are proportionally dependent on additive and/or subtracting delay, as ...

We consider the following network model motivated, in particular, by blockchains and peer-to-peer live streaming. Data packet flows arrive at the network nodes and need to be disseminated to all other nodes. Packets are relayed through the network ...$$

Various load balancing policies are known to achieve vanishing waiting times in the large-scale limit, that is, when the number of servers tends to infinity. These policies either require a communication overhead of one message per job or require ...

We study reflecting Brownian motion with drift constrained to a wedge in the plane. Our first set of results provides necessary and sufficient conditions for existence and uniqueness of a solution to the corresponding submartingale problem with ...

We consider a system of two parallel discrete-time single-server queues, queue 1 and queue 2. The service time of any customer in either queue is equal to 1 time slot. Arrivals during consecutive slots occur independently from slot to slot. ...${}_{\mathrm{}}{}_{\mathrm{}}$${}^{}$${}_{\mathrm{}}{}_{\mathrm{}}$

In this paper, we consider the occupancy distribution for an open network of infinite server queues with multivariate batch arrivals following a non-homogeneous Poisson process, and general service time distributions. We derive a probability ...

This paper concerns a modified version of the Lindley recursion, where the recursion equation is given by $W_{i+1}={[V_i{W}_i+Y_i]}^{+}$, with ${\{V_i\}}_{i=0}^{\infty }$ and ${\{Y_i\}}_{i=0}^{\infty }$ being two independent sequences of i.i.d. random variables. Additionally, we assume that the $V_i$ ...$\mathrm{}$${}_{}$${{}_{}}_{\mathrm{}}^{}$${}_{}$

This paper considers an observable double-ended queueing system of passengers and taxis, where matching times follow an exponential distribution. We assume that passengers are strategic and decide to join the queue only if their expected utility ...

Optimal scheduling in single-server queueing systems is a classic problem in queueing theory. The Gittins index policy is known to be the optimal nonanticipating policy minimizing the mean delay in the M/G/1 queue. While the Gittins index is ...

In this paper, we study a Multi-Armed Restless Bandit Problem (MARBP) subject to time fluctuations. This model has numerous applications in practice, like in cloud computing systems or in wireless communications networks. Each bandit is formed by ...