AoI Scheduling with Maximum Thresholds

Age of Information (AoI) is an application layer performance metric that quantifies the freshness of information. This paper investigates scheduling problems at network edge when each source node has an AoI requirement (which we call Maximum AoI Threshold (MAT)). Specifically, we want to determine whether or not a vector of MATs for the source nodes is schedulable, and if so, find a feasible scheduler for it. For a small network, we present an optimal procedure called Cyclic Scheduler Detection (CSD) that can determine the schedulability with absolute certainty. For a large network where CSD is not applicable, we present a novel low-complexity procedure, called Fictitious Polynomial Mapping (FPM), and prove that FPM can find a feasible scheduler for any MAT vector when the load is under ln 2. We use extensive numerical results to validate our theoretical results and show that the performance of FPM is significantly better than a state-of-the-art scheduling algorithm.

[1]  Magnus Jonsson,et al.  Switched real-time ethernet with earliest deadline first scheduling protocols and traffic handling , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[2]  Eytan Modiano,et al.  Optimizing age of information in wireless networks with perfect channel state information , 2018, 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[3]  Eytan Modiano,et al.  Minimizing age-of-information in multi-hop wireless networks , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[4]  Tung-Wei Kuo,et al.  Minimum Age TDMA Scheduling , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[5]  Rachid El Azouzi,et al.  Forever Young: Aging Control For Hybrid Networks , 2010, MobiHoc.

[6]  A. B. Kahn,et al.  Topological sorting of large networks , 1962, CACM.

[7]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.

[8]  Atilla Eryilmaz,et al.  Wireless scheduling for information freshness and synchrony: Drift-based design and heavy-traffic analysis , 2017, 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[9]  Eytan Modiano,et al.  Age Optimal Information Gathering and Dissemination on Graphs , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[10]  Yiwei Thomas Hou,et al.  Kronos: A 5G Scheduler for AoI Minimization Under Dynamic Channel Conditions , 2019, 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS).

[11]  Roy D. Yates,et al.  Update or wait: How to keep your data fresh , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[12]  Eytan Modiano,et al.  Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks , 2018, 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[13]  Anthony Ephremides,et al.  Optimal Link Scheduling for Age Minimization in Wireless Systems , 2018, IEEE Transactions on Information Theory.

[14]  Roy D. Yates,et al.  Two Freshness Metrics for Local Cache Refresh , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[15]  Vangelis Angelakis,et al.  Age of Information: A New Concept, Metric, and Tool , 2018, Found. Trends Netw..

[16]  Eytan Modiano,et al.  Minimizing the Age of Information in broadcast wireless networks , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[17]  Ness B. Shroff,et al.  Optimizing data freshness, throughput, and delay in multi-server information-update systems , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[18]  Eytan Modiano,et al.  Optimizing Information Freshness in Wireless Networks Under General Interference Constraints , 2018, IEEE/ACM Transactions on Networking.

[19]  Yiwei Thomas Hou,et al.  A General Model for Minimizing Age of Information at Network Edge , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[20]  Roy D. Yates,et al.  Age-optimal constrained cache updating , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[21]  Domenico Ferrari,et al.  Exact admission control for networks with a bounded delay service , 1996, TNET.

[22]  Eytan Modiano,et al.  Age of information: Design and analysis of optimal scheduling algorithms , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[23]  Bin Li,et al.  Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic , 2018, MobiHoc.

[24]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[25]  Sanjit Krishnan Kaul,et al.  Minimizing age of information in vehicular networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[26]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[27]  Ness B. Shroff,et al.  Age-optimal information updates in multihop networks , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[28]  Qingyu Liu,et al.  Minimizing Age-of-Information with Throughput Requirements in Multi-Path Network Communication , 2018, MobiHoc.

[29]  Yu Cheng,et al.  Only Those Requested Count: Proactive Scheduling Policies for Minimizing Effective Age-of-Information , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[30]  Eytan Modiano,et al.  Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals , 2019, IEEE Transactions on Mobile Computing.

[31]  Ness B. Shroff,et al.  Age-optimal Sampling and Transmission Scheduling in Multi-Source Systems , 2018, MobiHoc.

[32]  Matthew Andrews,et al.  Probabilistic end-to-end delay bounds for earliest deadline first scheduling , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[33]  Eytan Modiano,et al.  Optimizing Age of Information in Wireless Networks with Throughput Constraints , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.