English
Related papers

Related papers: Necessary condition for null controllability in ma…

200 papers

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…

Optimization and Control · Mathematics 2019-03-20 Ari Arapostathis , Guodong Pang

In this paper, we study the $G/\mathit{GI}/N$ queue in the Halfin--Whitt regime. Our first result is to obtain a deterministic fluid limit for the properly centered and scaled number of customers in the system which may be used to provide a…

Probability · Mathematics 2009-12-16 Josh Reed

High throughput satellites (HTSs) outpace traditional satellites due to their multi-beam transmission. The rise of low Earth orbit mega constellations amplifies HTS data rate demands to terabits/second with acceptable latency. This surge in…

Networking and Internet Architecture · Computer Science 2024-06-03 Olivier Bélanger , Olfa Ben Yahia , Stéphane Martel , Antoine Lesage-Landry , Gunes Karabulut Kurt

The paper puts forward sufficient conditions for local controllability of a control dynamical system. The results obtained are meaningful in the case when the linear approximation to this system is not completely controllable. As a…

Optimization and Control · Mathematics 2017-09-05 E. R. Avakov , G. G. Magaril-Il'yaev

The classical Okamura-Seymour theorem states that for an edge-capacitated, multi-commodity flow instance in which all terminals lie on a single face of a planar graph, there exists a feasible concurrent flow if and only if the cut…

Combinatorics · Mathematics 2015-06-18 James R. Lee , Manor Mendel , Mohammad Moharrami

We study the steady-state performance of parallel-server systems under an immediate routing architecture with two sources of heterogeneity: servers and job classes, subject to compatibility constraints. We focus on the…

Probability · Mathematics 2025-09-25 Yaosheng Xu

We consider a flow-level model of a network operating under an $\alpha$-fair bandwidth sharing policy (with $\alpha>0$) proposed by Roberts and Massouli\'{e} [Telecomunication Systems 15 (2000) 185-201]. This is a probabilistic model that…

Probability · Mathematics 2014-01-16 D. Shah , J. N. Tsitsiklis , Y. Zhong

We consider a queueing system composed of a dispatcher that routes deterministically jobs to a set of non-observable queues working in parallel. In this setting, the fundamental problem is which policy should the dispatcher implement to…

Performance · Computer Science 2025-02-23 Jonatha Anselmi , Bruno Gaujal , Tommaso Nesti

A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…

Probability · Mathematics 2014-01-17 Yunan Liu , Ward Whitt

This paper concerns rollout and certainty-equivalent rollout policies for stochastic shortest path problems with absorbing terminal states. The main result provides a direct non-asymptotic performance certificate for a fixed rollout policy:…

Optimization and Control · Mathematics 2026-05-25 Anders Hansson , Bo Wahlberg

This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal processes and after completing service, a customer either leaves…

Probability · Mathematics 2016-11-09 Marko Boon , Rob van der Mei , Erik Winands

We consider general large-scale service systems with multiple customer classes and multiple server (agent) pools, mean service times depend both on the customer class and server pool. It is assumed that the allowed activities (routing…

Probability · Mathematics 2015-03-17 Alexander L. Stolyar , Elena Yudovina

We address the problem of checking state reachability for programs running under Total Store Order (TSO). The problem has been shown to be decidable but the cost is prohibitive, namely non-primitive recursive. We propose here to give up…

Programming Languages · Computer Science 2015-01-13 Ahmed Bouajjani , Georgel Calin , Egor Derevenetc , Roland Meyer

Most existing necessary conditions for optimal control based on adjoining methods require both state and costate information, yet the unobservability of costates for a given feasible trajectory impedes the determination of optimality in…

Optimization and Control · Mathematics 2025-10-27 Yunan Wang , Chuxiong Hu , Yujie Lin , Zeyang Li , Shize Lin , Suqin He

Parallel server systems in transportation, manufacturing, and computing heavily rely on dynamic routing using connected cyber components for computation and communication. Yet, these components remain vulnerable to random malfunctions and…

Systems and Control · Electrical Eng. & Systems 2023-08-22 Qian Xie , Jiayi Wang , Li Jin

Self-organized bistability (SOB) stands as a critical behavior for the systems delicately adjusting themselves to the brink of bistability, characterized by a first-order transition. Its essence lies in the inherent ability of the system to…

Adaptation and Self-Organizing Systems · Physics 2024-01-08 Md Sayeed Anwar , Nikita Frolov , Alexander E. Hramov , Dibakar Ghosh

This paper investigates the near optimal control for a kind of linear stochastic control systems governed by the forward backward stochastic differential equations, where both the drift and diffusion terms are allowed to depend on controls…

Optimization and Control · Mathematics 2015-01-23 Liangquan Zhang , Jianhui Huang , Xun Li

We introduce a "system-wide safety staffing" (SWSS) parameter for multiclass multi-pool networks of any tree topology, Markovian or non-Markovian, in the Halfin-Whitt regime. This parameter can be regarded as the optimal reallocation of the…

Probability · Mathematics 2021-06-17 Hassan Hmedi , Ari Arapostathis , Guodong Pang

We investigate the optimal transport (OT) problem over networks, wherein supply and demand are conceptualized as temporal marginals governing departure rates of particles from source nodes and arrival rates at sink nodes. This setting…

Optimization and Control · Mathematics 2026-02-17 Anqi Dong , Karl H. Johansson , Johan Karlsson

We investigate the scheduling of a common resource between several concurrent users when the feasible transmission rate of each user varies randomly over time. Time is slotted and users arrive and depart upon service completion. This may…

Performance · Computer Science 2015-03-18 U. Ayesta , M. Erausquin , M. Jonckheere , I. M. Verloop