Related papers: Necessary condition for null controllability in ma…
This paper presents a second-order heavy traffic analysis of a single server queue that processes customers having deadlines using the earliest-deadline-first scheduling policy. For such systems, referred to as real-time queueing systems,…
We consider the joint scheduling-and-power-allocation problem of a downlink cellular system. The system consists of two groups of users: real-time (RT) and non-real-time (NRT) users. Given some average power constraint on the base station,…
We study the use of the System Optimum (SO) Dynamic Traffic Assignment (DTA) problem to design optimal traffic flow controls for freeway networks as modeled by the Cell Transmission Model, using variable speed limit, ramp metering, and…
In this paper we study an optimal control problem with nonsmooth mixed state and control constraints. In most of the existing results, the necessary optimality condition for optimal control problems with mixed state and control constraints…
Extreme weather events, like flooding, disrupt urban transportation networks by reducing speeds and capacities, and by closing roadways. These hazards create regime-dependent uncertainty in link performance and travel-time distribution…
Contemporary technological challenges often involve many degrees of freedom in a distributed or networked setting. Three aspects are notable: the variables are usually associated with the nodes of a graph with limited communication…
In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a…
In this paper, we consider a load balancing system under a general pull-based policy. In particular, each arrival is randomly dispatched to one of the servers whose queue lengths are below a threshold, if there are any; otherwise, this…
We consider a large-scale flexible service system with two large server pools and two types of customers. Servers in pool 1 can only serve type 1 customers, while server in pool 2 are flexible -- they can serve both types 1 and 2. (This is…
We consider resource sharing networks of the form introduced in the work of Massouli\'{e} and Roberts(2000) as models for Internet flows. The goal is to study the open problem, formulated in Harrison et al. (2014), of constructing simple…
We consider a set of flows passing through a set of servers. The injection rate into each flow is governed by a flow control that increases the injection rate when all the servers on the flow's path are empty and decreases the injection…
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…
We propose a model uncertainty approach to heavy traffic asymptotics that allows for a high level of uncertainty. That is, the uncertainty classes of underlying distributions accommodate disturbances that are of order 1 at the usual…
The quantum speed limit sets the minimum time required to transfer a quantum system completely into a given target state. At shorter times the higher operation speed has to be paid with a loss of fidelity. Here we quantify the trade-off…
We consider a basic model of a dynamical distribution network, modeled as a directed graph with storage variables corresponding to every vertex and flow inputs corresponding to every edge, subject to unknown but constant inflows and…
This work is concerned with second-order necessary and sufficient optimality conditions for optimal control of a non-smooth semilinear elliptic partial differential equation, where the nonlinearity is the non-smooth max-function and thus…
In the paper, the problems of controllability and approximate controllability are studied for the control system $w_t=\frac{1}{\rho}\left(kw_x\right)_x+\gamma w$, $\left.\left(\sqrt{\frac{k}{\rho}}w_x\right)\right|_{x=0}=u$, $x>0$,…
The temporal assumptions underpinning conventional Identity and Access Management collapse under agentic execution regimes. A sixty-second revocation window permits on the order of $6 \times 10^3$ unauthorized API calls at 100 ops/tick; at…
Congestion is a problem of paramount importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources. Sensor nodes are prone to failure and…
In previous papers we developed a deterministic fluid approximation for an overloaded Markovian queueing system having two customer classes and two service pools, known in the call-center literature as the X model. The system uses the…