Related papers: Delay Bounds for Multiclass FIFO
In several real world applications, machine learning models are deployed to make predictions on data whose distribution changes gradually along time, leading to a drift between the train and test distributions. Such models are often…
We study the matching of jobs to workers in a queue, e.g. a ridesharing platform dispatching drivers to pick up riders at an airport. Under FIFO dispatching, the heterogeneity in trip earnings incentivizes drivers to cherry-pick, increasing…
Time delays are components that make time-lag in systems response. They arise in physical, chemical, biological and economic systems, as well as in the process of measurement and computation. In this work, we implement Genetic Algorithm…
In this paper, we propose a class of discrete-time approximation schemes for stochastic optimal control problems under the $G$-expectation framework. The proposed schemes are constructed recursively based on piecewise constant policy. We…
The present paper provides some new stochastic inequalities for the characteristics of the $M/GI/1/n$ and $GI/M/1/n$ loss queueing systems. These stochastic inequalities are based on substantially deepen up- and down-crossings analysis, and…
We study an uplink multi secondary user (SU) system having statistical delay constraints, and an average interference constraint to the primary user (PU). SUs with heterogeneous interference channel statistics, to the PU, experience…
Since Age of Information (AoI) has been proposed as a metric that quantifies the freshness of information updates in a communication system, there has been a constant effort in understanding and optimizing different statistics of the AoI…
We present consistent algorithms for multiclass learning with complex performance metrics and constraints, where the objective and constraints are defined by arbitrary functions of the confusion matrix. This setting includes many common…
This paper establishes the equivalence between systems described by a single first-order hyperbolic partial differential equation and systems described by integral delay equations. System-theoretic results are provided for both classes of…
In this paper, we propose a cross-layer scheduling algorithm that achieves a throughput "epsilon-close" to the optimal throughput in multi-hop wireless networks with a tradeoff of O(1/epsilon) in delay guarantees. The algorithm aims to…
Providing end-to-end network delay guarantees in packet-switched networks such as the Internet is highly desirable for mission-critical and delay-sensitive data transmission, yet it remains a challenging open problem. Due to the looseness…
Computing accurate deterministic performance bounds is a strong need for communication technologies having strong requirements on latency and reliability. Beyond new scheduling protocols such as TSN, the FIFO policy remains at work within…
There has been considerable recent work developing a new stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open problem has been the development of utility-optimal algorithms…
This paper considers a multichannel preemptive-resume priority queueing system with a Poisson input and an arbitrary service time distribution depending on the priority of job. Jobs of the same priority are serviced according to the LIFO…
In this paper, we analyze the accuracy of gradient estimates obtained by linear interpolation when the underlying function is subject to bounded measurement noise. The total gradient error is decomposed into a deterministic component…
This paper studies the heavy-traffic asymptotics for the multiclass FIFO M${}^X$/G/1 queue. We first derive the probability generating function of the joint queue length distribution. Using the probability generating function, we then…
We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…
We consider an overloaded multiclass nonidling first-in-first-out single-server queue with abandonment. The interarrival times, service times, and deadline times are sequences of independent and identically, but generally distributed random…
We consider the age-of-information in a multi-class $M/G/1$ queueing system, where each class generates packets containing status information. Age of information is a relatively new metric that measures the amount of time that elapsed…
We study a multiclass M/M/1 queueing control problem with finite buffers under heavy-traffic where the decision maker is uncertain about the rates of arrivals and service of the system and by scheduling and admission/rejection decisions…