English
Related papers

Related papers: Diffusion Models for Double-ended Queues with Rene…

200 papers

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

This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…

Probability · Mathematics 2011-03-22 Mariana Olvera-Cravioto , Peter W. Glynn

Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on…

Probability · Mathematics 2017-08-22 Harsha Honnappa , Rahul Jain

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

This note details the development of a discrete-time diffusion process to approximate the midnight customer count process in a $M_\textrm{per}/\textrm{Geo}_\textrm{2timeScale}/N$ system. We prove a limit theorem that supports this diffusion…

Probability · Mathematics 2015-08-24 J. G. Dai , Pengyi Shi

The present paper is concerned with diffusion processes running on tubular domains with conditions on nonreaching the boundary, respectively, reflecting at the boundary, and corresponding processes in the limit where the thin tubular…

Probability · Mathematics 2012-10-15 Sergio Albeverio , Seiichiro Kusuoka

We consider a two-queue polling model with switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$) in each queue. The major benefit of the $k$-limited service discipline is that it -…

Probability · Mathematics 2016-03-07 Marko Boon , Erik Winands

A single-server queuing model is considered with customers that have deadlines. If a customer's deadline elapses before service is offered, the customer abandons the system (customers do not abandon while being served). When the server…

Probability · Mathematics 2014-08-21 Rami Atar , Anup Biswas , Haya Kaspi

Aggregations are emergent features common to many biological systems. Mathematical models to understand their emergence are consequently widespread, with the aggregation-diffusion equation being a prime example. Here we study the…

Analysis of PDEs · Mathematics 2023-09-28 Jonathan R. Potts , Kevin J. Painter

A large-scale service system with multiple customer classes and multiple server pools is considered, with the mean service time depending both on the customer class and server pool. The allowed activities (routing choices) form a tree (in…

Probability · Mathematics 2014-03-28 Alexander Stolyar

We consider the Halfin-Whitt diffusion process $X_d(t)$, which is used, for example, as an approximation to the $m$-server $M/M/m$ queue. We use recently obtained integral representations for the transient density $p(x,t)$ of this diffusion…

Probability · Mathematics 2015-05-06 Qiang Zhen , Charles Knessl

We study the optimal timing strategies for trading a mean-reverting price process with afinite deadline to enter and a separate finite deadline to exit the market. The price process is modeled by a diffusion with an affine drift that…

Trading and Market Microstructure · Quantitative Finance 2018-01-09 Yerkin Kitapbayev , Tim Leung

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…

Optimization and Control · Mathematics 2026-05-27 Amir Anastasios Alwan , Baris Ata , Yuwei Zhou

In this thesis, we propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction $p$ of an available resource is deployed in a centralized manner…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-03-23 Kuang Xu

In this paper, we study optimal control problems for multiclass GI/M/n+M queues in an alternating renewal (up-down) random environment in the Halfin-Whitt regime. Assuming that the downtimes are asymptotically negligible and only the…

Optimization and Control · Mathematics 2019-08-20 Ari Arapostathis , Guodong Pang , Yi Zheng

Diffusion processes are instrumental to describe the movement of a continuous quantity in a generic network of interacting agents. Here, we present a probabilistic framework for diffusion in networks and propose to classify agent…

Social and Information Networks · Computer Science 2015-08-28 Wai Hong Ronald Chan , Matthias Wildemeersch , Tony Q. S. Quek

In this paper, we consider an $N$-queue overloaded polling network attended by a single cyclically roving server. Upon the completion of his service, a customer is either routed to another queue or leaves the system. All the switches are…

Probability · Mathematics 2017-01-17 Zaiming Liu , Yuejiao Wang , Yuqing Chu , Yingqiu Li

We consider a two-component competition-diffusion system with equal diffusion coefficients and inhomogeneous Dirichlet boundary conditions. When the interspecific competition parameter tends to infinity, the system solution converges to…

Analysis of PDEs · Mathematics 2007-07-13 E. C. M. Crooks , E. N. Dancer , D. Hilhorst

We introduce a unified framework for solving first passage times of time-homogeneous diffusion processes. According to the killed version potential theory and the perturbation theory, we are able to deduce closed-form solutions for…

Probability · Mathematics 2026-01-14 Angelos Dassios , Luting Li

We develop diffusion approximations for parallel-queueing systems with the randomized longest-queue-first scheduling algorithm by establishing new mean-field limit theorems as the number of buffers $n\to\infty$. We achieve this by allowing…

Probability · Mathematics 2014-10-10 A. B. Dieker , Tonghoon Suk