Job dispatching policies for queueing systems with unknown service rates
In multi-server queueing systems where there is no central queue holding all incoming jobs,
job dispatching policies are used to assign incoming jobs to the queue at one of the servers …
job dispatching policies are used to assign incoming jobs to the queue at one of the servers …
Stability enforced bandit algorithms for channel selection in remote state estimation of Gauss-Markov processes
In this article, we consider the problem of remote state estimation of a Gauss–Markov
process, where a sensor can, at each discrete time instant, transmit on one out of M different …
process, where a sensor can, at each discrete time instant, transmit on one out of M different …
Efficient learning-based scheduling for information freshness in wireless networks
B Li - IEEE INFOCOM 2021-IEEE Conference on Computer …, 2021 - ieeexplore.ieee.org
Motivated by the recent trend of integrating artificial intelligence into the Internet-of-Things
(IoT), we consider the problem of scheduling packets from multiple sensing sources to a …
(IoT), we consider the problem of scheduling packets from multiple sensing sources to a …
Achieving Regular and Fair Learning in Combinatorial Multi-Armed Bandit
Combinatorial multi-armed bandit refers to the model that aims to maximize cumulative
rewards in the presence of uncertainty. Motivated by two important wireless network …
rewards in the presence of uncertainty. Motivated by two important wireless network …
Aging bandits: Regret analysis and order-optimal learning algorithm for wireless networks with stochastic arrivals
We consider a single-hop wireless network with sources transmitting time-sensitive
information to the destination over multiple unreliable channels. Packets from each source …
information to the destination over multiple unreliable channels. Packets from each source …
Distribution-oblivious online algorithms for age-of-information penalty minimization
The ever-increasing needs of supporting real-time applications have spurred new studies on
minimizing Age-of-Information (AoI), a novel metric characterizing the data freshness of the …
minimizing Age-of-Information (AoI), a novel metric characterizing the data freshness of the …
Thompson sampling for networked control over unknown channels
We consider a networked control system where information is transmitted over lossy
communication channels on both the uplink (sensor to controller) and downlink (controller to …
communication channels on both the uplink (sensor to controller) and downlink (controller to …
Regret of Age-of-Information Bandits in Nonstationary Wireless Networks
We consider a wireless network with a source periodically generating time-sensitive
information and transmitting it to a destination via one of non-stationary orthogonal wireless …
information and transmitting it to a destination via one of non-stationary orthogonal wireless …
Aging wireless bandits: Regret analysis and order-optimal learning algorithm
We consider a single-hop wireless network with sources transmitting time-sensitive
information to the destination over multiple unreliable channels. Packets from each source …
information to the destination over multiple unreliable channels. Packets from each source …
Adaptive Sampling for Age of Information in Non-Stationary Network Traffic
Y Gu, Z Quan - IEEE Transactions on Mobile Computing, 2024 - ieeexplore.ieee.org
Real-time status updates play an important role in low-latency cyber-physical systems, in
which the real network traffic statistics (ie, transmission delay and/or error rate) are often …
which the real network traffic statistics (ie, transmission delay and/or error rate) are often …