Related papers: An asymptotic optimality result for the multiclass…
This paper deals with the unconstrained and constrained cases for continuous-time Markov decision processes under the finite-horizon expected total cost criterion. The state space is denumerable and the transition and cost rates are allowed…
We study single commodity network flows with suitable robustness and efficiency specs. An original use of a maximum entropy problem for distributions on the paths of the graph turns this problem into a steering problem for Markov chains…
We address the problem of giving robust performance bounds based on the study of the asymptotic behavior of the insensitive load balancing schemes when the number of servers and the load scales jointly. These schemes have the desirable…
We present a learning-augmented online algorithm for the preemptive FIFO buffer management problem, where packets arrive online to a finite-capacity buffer, must be transmitted in FIFO order, and the algorithm may preemptively discard…
We develop asymptotically optimal policies for the multi armed bandit (MAB), problem, under a cost constraint. This model is applicable in situations where each sample (or activation) from a population (bandit) incurs a known bandit…
Recent work in decentralized, schedule-driven traffic control has demonstrated the ability to significantly improve traffic flow efficiency in complex urban road networks. However, in situations where vehicle volumes increase to the point…
In this paper, we present a novel method for computing the asymptotic values of both the optimal threshold, and the probability of success in sequences of optimal stopping problems. This method, based on the resolution of a first-order…
Motivated by the operational problems in click and collect systems, such as curbside pickup programs, we study a joint admission control and capacity allocation problem. We consider a system where arriving customers have preferred service…
Autonomous agents are promising in applications such as intelligent transportation and smart manufacturing, and scheduling of agents has to take their inertial constraints into consideration. Most current researches require the obedience of…
We consider the scheduling control problem for a family of unitary networks under heavy traffic, with general interarrival and service times, probabilistic routing and infinite horizon discounted linear holding cost. A natural…
We consider optimal transport problems where the cost is optimized over controlled dynamics and the end time is free. Unlike the classical setting, the search for optimal transport plans also requires the identification of optimal "stopping…
The emerging connected-vehicle technology provides a new dimension in developing more intelligent traffic control algorithms for signalized intersections in networked transportation systems. An important challenge for the scheduling problem…
We provide simple necessary and sufficient conditions under which a path constitutes a solution to an infinite-horizon, continuous-time optimal control problem. We prove transversality conditions under standard assumptions. We also present…
In this paper we consider a real time queuing system with rewards and deadlines. We assume that packet processing time is known upon arrival, as is the case in communication networks. This assumption allows us to demonstrate that the well…
Scheduling and managing queues with bounded buffers are among the most fundamental problems in computer networking. Traditionally, it is often assumed that all the properties of each packet are known immediately upon arrival. However, as…
We consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out. Our objective is to maximize the total…
This paper introduces an optimization problem (P) and a solution strategy to design variable-speed-limit controls for a highway that is subject to traffic congestion and uncertain vehicle arrival and departure. By employing a finite…
We consider a model of priced resource sharing that combines both queueing behavior and strategic behavior. We study a priority service model where a single server allocates its capacity to agents in proportion to their payment to the…
In this paper, we aim to improve the percentage of packets meeting their deadline in discrete-time M/M/1 queues with infrequent monitoring. More specifically, we look into policies that only monitor the system (and subsequently take…
We address a single server queue control problem (QCP) in heavy traffic originating from Lee and Weerasinghe (2011). The state process represents the offered waiting time, the customer arrival has a state-dependent intensity, and the…