Related papers: Service Rate Control in Queues with Abandonments
This article deals with asynchronous server vacation and customer retrial facility in a multi-server queueing-inventory system. The Poisson process governs the arrival of a customer. The system is comprised of c identical servers, a…
We examine the problem of managing a server farm in a way that attempts to maximize the net revenue earned by a cloud provider by renting servers to customers according to a typical Platform-as-a-Service model. The Cloud provider offers its…
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…
We consider a horizontal traffic queue (HTQ) on a periodic road segment, where vehicles arrive according to a spatio-temporal Poisson process, and depart after traveling a distance that is sampled independently and identically from a…
This paper concerns the recurrence structure of the infinite server queue, as viewed through the prism of the maximum dater sequence, namely the time to drain the current work in the system as seen at arrival epochs. Despite the importance…
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…
Motivated by applications in online marketplaces such as ride-hailing, we study how strategic servers impact the system performance. We consider a discrete-time process in which, heterogeneous types of customers and servers arrive. Each…
We study a fundamental model of resource allocation in which a finite number of resources must be assigned in an online manner to a heterogeneous stream of customers. The customers arrive randomly over time according to known stochastic…
Due to the widespread applicability of discrete-time queues in wireless networks or telecommunication systems, this paper analyzes an infinite-buffer batch-service queue with single and multiple vacation where customers/messages arrive…
We use multidimensional diffusion processes to approximate the dynamics of a queue served by many parallel servers. The queue is served in the first-in-first-out (FIFO) order and the customers waiting in queue may abandon the system without…
Congestion game is a widely used model for modern networked applications. A central issue in such applications is that the selfish behavior of the participants may result in resource overloading and negative externalities for the system…
In many-server systems it is crucial to staff the right number of servers so that targeted service levels are met. These staffing problems typically lead to constraint satisfaction problems that are hard to solve. During the last decade, a…
We consider a Markovian queue subject to Poisson generated catastrophes. Whenever a catastrophe occurs, all customers are forced to abandon the system, the server is rendered inoperative and an exponential repair time is set on. We assume…
We study infinite-horizon asymptotic average optimality for parallel server network with multiple classes of jobs and multiple server pools in the Halfin-Whitt regime. Three control formulations are considered: 1) minimizing the queueing…
In multi-server queueing systems where there is no central queue holding all incoming jobs, job dispatching policies are used to assign incoming jobs to the queue at one of the servers. Classic job dispatching policies such as…
This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters pertaining to the service times) using observations of the…
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 consider an inventory system in which inventory level fluctuates as a Brownian motion in the absence of control. The inventory continuously accumulates cost at a rate that is a general convex function of the inventory level, which can be…
We consider an arbitrary network of $M/M/\infty$ queues with controlled transitions between queues. We consider optimal control problems where the costs are linear functions of the state and inputs over a finite or infinite horizon. We…
Service time fluctuations heavily affect the performance of queueing systems, causing long waiting times and backlogs. Recently, it was shown that when service times are solely determined by the server, service resetting can mitigate the…