• Corpus ID: 239049484

Scheduling Algorithms for Age of Information Differentiation with Random Arrivals

@article{Akar2021SchedulingAF,
  title={Scheduling Algorithms for Age of Information Differentiation with Random Arrivals},
  author={Nail Akar and Ezhan Karasan},
  journal={ArXiv},
  year={2021},
  volume={abs/2110.10992}
}
We study age-agnostic scheduling in a non-preemptive status update system with two sources sending time-stamped information packets at random instances to a common monitor through a single server. The server is equipped with a waiting room holding the freshest packet from each source called "single-buffer per-source queueing". The server is assumed to be work-conserving and when the waiting room has two waiting packets (one from each source), a probabilistic scheduling policy is applied so as… 

Figures and Tables from this paper

References

SHOWING 1-10 OF 24 REFERENCES
Average Age of Information in Multi-Source Self-Preemptive Status Update Systems with Packet Delivery Errors
TLDR
This paper studies the "age of information" (AoI) in a multi-source status update system where multiple sources send updates of their process to a monitor through a last-come first-served server with preemption in service and packet delivery errors, and shows that source agnostic preempting in service results in better average AoI than self preempt in service for all sources.
Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals
TLDR
A lower bound on the AoI performance achievable by any given network operating under any queueing discipline is derived, which shows that the performance of the Max-Weight policy is close to the analytical lower bound.
The Age of Information: Real-Time Status Updating by Multiple Sources
  • R. Yates, S. Kaul
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2019
TLDR
An age of information timeliness metric is formulated and a general result for the AoI that is applicable to a wide variety of multiple source service systems is derived that makes AoI evaluation to be comparable in complexity to finding the stationary distribution of a finite-state Markov chain.
Age of information of multiple sources with queue management
TLDR
Considering that queuing delay can unnecessarily increase the age of a critical status update, this work proposes here a queue management technique, in which a queue is maintained with only the latest status packet of each source, overwriting any previously queued update from that source.
Average Age of Information for a Multi-Source M/M/1 Queueing Model With Packet Management
TLDR
The average age of information (AoI) of the considered M/M/1 queueing model is derived by using the stochastic hybrid systems (SHS) technique and results are provided to show the effectiveness of the proposed policy.
Updates with Multiple Service Classes
TLDR
It is shown that each high-probability service class has an associated age-optimal update arrival rate while low-prolific service classes incur an average age that is always decreasing in the update arrival rates.
Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
TLDR
This is the first work to derive performance guarantees for scheduling policies that attempt to minimize AoI in wireless networks with unreliable channels and shows that both the Max-Weight and Whittle’s Index policies outperform the other scheduling policies in every configuration simulated, and achieve near optimal performance.
Age of information: The gamma awakening
  • E. Najm, Rajai Nasser
  • Computer Science, Mathematics
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
TLDR
This work considers a scenario where a monitor is interested in being up to date with respect to the status of some system which is not directly accessible to this monitor, and considers two packet management schemes: LCFS with preemption and LCFS without preemption.
Age-of-information in the presence of error
  • Kun Chen, Longbo Huang
  • Computer Science
    2016 IEEE International Symposium on Information Theory (ISIT)
  • 2016
TLDR
The peak age-of-information in an M/M/1 queueing system with packet delivery error is considered and two types of policies are focused on, one is to adopt Last-Come-First-Served scheduling, and the other is to utilize retransmissions, i.e., keep transmitting the most recent packet.
A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues
TLDR
A general formula is derived that the stationary distribution of the AoI is given in terms of the stationary distributions of the system delay and the peak AoI, which holds for a wide class of information update systems.
...
1
2
3
...