English
Related papers

Related papers: Optimal control of Markov-modulated multiclass man…

200 papers

This paper focuses on an infinite-server queue modulated by an independently evolving finite-state Markovian background process, with transition rate matrix $Q\equiv(q_{ij})_{i,j=1}^d$. Both arrival rates and service rates are depending on…

Probability · Mathematics 2015-06-17 Joke Blom , Koen De Turck , Michel Mandjes

We study ergodic properties of a class of Markov-modulated general birth-death processes under fast regime switching. The first set of results concerns the ergodic properties of the properly scaled joint Markov process with a parameter that…

Probability · Mathematics 2019-09-17 Ari Arapostathis , Guodong Pang , Yi Zheng

In this paper we study the Markov-modulated M/M/$\infty$ queue, with a focus on the correlation structure of the number of jobs in the system. The main results describe the system's asymptotic behavior under a particular scaling of the…

Probability · Mathematics 2016-01-13 Joke Blom , Koen de Turck , Michel Mandjes

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…

Performance · Computer Science 2023-03-30 R. Núñez-Queija , B. J. Prabhu , J. A. C. Resing

This paper studies the steady-state properties of the Join the Shortest Queue model in the Halfin-Whitt regime. We focus on the process tracking the number of idle servers, and the number of servers with non-empty buffers. Recently,…

Probability · Mathematics 2019-06-12 Anton Braverman

In this paper, we equip the conventional discrete-time queueing network with a Markovian input process, that, in addition to the usual short-term stochastics, governs the mid- to long-term behavior of the links between the network nodes.…

Systems and Control · Electrical Eng. & Systems 2020-04-07 Richard Schoeffauer , Gerhard Wunder

In this paper, we study a controllable tandem queueing system consisting of two nodes and a controller, in which customers arrive according to a Poisson process and must receive service at both nodes before leaving the system. A decision…

Probability · Mathematics 2015-04-07 Liu Zaiming , Chen Gang , Wu Jinbiao

We consider the so-called GI/GI/N queueing network in which a stream of jobs with independent and identically distributed service times arrive according to a renewal process to a common queue served by $N$ identical servers in a…

Probability · Mathematics 2017-12-06 Reza Aghajani , Kavita Ramanan

We present discrete-time approximation of optimal control policies for infinite horizon discounted/ergodic control problems for controlled diffusions in $\Rd$\,. In particular, our objective is to show near optimality of optimal policies…

Optimization and Control · Mathematics 2025-02-11 Somnath Pradhan , Serdar Yuksel

We consider Markovian many-server systems with admission control operating in a QED regime, where the relative utilization approaches unity while the number of servers grows large, providing natural Economies-of-Scale. In order to determine…

Probability · Mathematics 2014-11-12 Jaron Sanders , S. C. Borst , A. J. E. M. Janssen , J. S. H. van Leeuwaarden

The finite state semi-Markov process is a generalization over the Markov chain in which the sojourn time distribution is any general distribution. In this article we provide a sufficient stochastic maximum principle for the optimal control…

Optimization and Control · Mathematics 2014-07-14 Amogh Deshpande

In this work, we focus on the stationary analysis of a specific class of continuous time Markov-modulated reflected random walks in the quarter plane with applications in the modelling of two-node Markov-modulated queueing networks with…

Probability · Mathematics 2020-06-02 Ioannis Dimitriou

We consider a multi-class queueing model of a telephone call center, in which a system manager dynamically allocates available servers to customer calls. Calls can terminate through either service completion or customer abandonment, and the…

Systems and Control · Electrical Eng. & Systems 2025-03-07 Baris Ata , Ebru Kasikaralar

The focus of this paper is on the asymptotics of large-time numbers of customers in time-periodic Markovian many-server queues with customer abandonment in heavy traffic. Limit theorems are obtained for the periodic number-of-customers…

Probability · Mathematics 2014-06-03 Anatolii A. Puhalskii

Motivated by queues with many servers, we study Brownian steady-state approximations for continuous time Markov chains (CTMCs). Our approximations are based on diffusion models (rather than a diffusion limit) whose steady-state, we prove,…

Probability · Mathematics 2014-09-12 Itai Gurvich

A many-server queueing system is considered in which customers with independent and identically distributed service times enter service in the order of arrival. The state of the system is represented by a process that describes the total…

Probability · Mathematics 2010-10-05 Haya Kaspi , Kavita Ramanan

A multiclass queueing system is considered, with heterogeneous service stations, each consisting of many servers with identical capabilities. An optimal control problem is formulated, where the control corresponds to scheduling and routing,…

Probability · Mathematics 2007-05-23 Rami Atar

Motivated by queueing systems with heterogeneous parallel servers, we consider a class of structured multi-dimensional Markov processes whose state space can be partitioned into two parts: a finite set of boundary states and a structured…

Probability · Mathematics 2015-10-02 Jori Selen , Ivo J. B. F. Adan , Johan S. H. van Leeuwaarden

We characterize heavy-traffic process and steady-state limits for systems staffed according to the square-root safety rule, when the service requirements of the customers are perfectly correlated with their individual patience for waiting…

Probability · Mathematics 2020-09-01 Lun Yu , Ohad Perry

We consider a heterogeneous queueing system consisting of one large pool of $O(r)$ identical servers, where $r\to\infty$ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in…

Probability · Mathematics 2011-05-04 David Gamarnik , Alexander Stolyar