Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
158 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Minimizing Age of Information with Generate at Will Status Updates and Age-Agnostic Cyclic Scheduling (2311.18791v2)

Published 30 Nov 2023 in cs.IT, cs.NI, and math.IT

Abstract: We study the scheduling problem for a multi-source single-server generate-at-will (GAW) status update system with sources having heterogeneous service times and weights, with the goal of minimizing the weighted sum age of information (AoI). In particular, we study \emph{age-agnostic} schedulers which rely only on the first two moments of the source service times and they are relatively easier to implement than their age-aware counterparts which make use of the actual realizations of the service times. In particular, we focus on age-agnostic cyclic schedulers with $O(1)$ runtime complexity where status updates from multiple sources are scheduled according to a fixed finite transmission pattern. We first develop an analytical method to obtain the exact average AoI of each source when a transmission pattern is given. Then, we derive the optimum transmission pattern in closed form for the specific case of two sources. For general number of sources, we propose a novel algorithm, called IS (Insertion Search), for constructing transmission patterns, and we show that IS is capable of producing the optimum pattern for two-source systems, and it outperforms other existing age-agnostic schemes, for the case of more than two sources. Numerical examples are presented to showcase the effectiveness of the proposed approach.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (25)
  1. R. D. Yates, Y. Sun, D. R. Brown, S. K. Kaul, E. Modiano, and S. Ulukus, “Age of information: An introduction and survey,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1183–1210, May 2021.
  2. A. Kosta, N. Pappas, and V. Angelakis, “Age of information: A new concept, metric, and tool,” Foundations and Trends in Networking, vol. 12, no. 3, pp. 162–259, 2017.
  3. I. Kadota, A. Sinha, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, “Scheduling policies for minimizing age of information in broadcast wireless networks,” IEEE/ACM Transactions on Networking, vol. 26, no. 6, pp. 2637–2650, 2018.
  4. Q. He, D. Yuan, and A. Ephremides, “Optimal link scheduling for age minimization in wireless systems,” IEEE Transactions on Information Theory, vol. 64, no. 7, pp. 5381–5394, 2018.
  5. A. Maatouk, S. Kriouile, M. Assad, and A. Ephremides, “On the optimality of the Whittle’s index policy for minimizing the age of information,” IEEE Transactions on Wireless Communications, vol. 20, no. 2, pp. 1263–1277, 2021.
  6. S. Kriouile, M. Assaad, and A. Maatouk, “On the global optimality of Whittle’s index policy for minimizing the age of information,” IEEE Transactions on Information Theory, vol. 68, no. 1, pp. 572–600, 2022.
  7. N. Akar and E. O. Gamgam, “Distribution of age of information in status update systems with heterogeneous information sources: An absorbing Markov chain-based approach,” IEEE Communications Letters, vol. 27, no. 8, pp. 2024–2028, 2023.
  8. C. Li, S. Li, Q. Liu, Y. T. Hou, W. Lou, and S. Kompella, “Eywa: A general approach for scheduler design in AoI optimization,” in IEEE Infocom, May 2023.
  9. S. Kaul, R. D. Yates, and M. Gruteser, “Real-time status: How often should one update?” in IEEE Infocom, March 2012.
  10. R. D. Yates and S. K. Kaul, “The age of information: Real-time status updating by multiple sources,” IEEE Transactions on Information Theory, vol. 65, no. 3, pp. 1807–1827, March 2019.
  11. E. Najm and E. Telatar, “Status updates in a multi-stream M/G/1/1 preemptive queue,” in IEEE Infocom, April 2018.
  12. R. D. Yates, “The age of information in networks: Moments, distributions, and sampling,” IEEE Transactions on Information Theory, vol. 66, no. 9, pp. 5712–5728, 2020.
  13. M. A. Abd-Elmagid and H. S. Dhillon, “Closed-form characterization of the MGF of AoI in energy harvesting status update systems,” IEEE Transactions on Information Theory, vol. 68, no. 6, pp. 3896–3919, 2022.
  14. M. Moltafet, M. Leinonen, and M. Codreanu, “Moment generating function of age of information in multisource M/G/1/1 queueing systems,” IEEE Transactions on Communications, vol. 70, no. 10, pp. 6503–6516, 2022.
  15. A. Maatouk, M. Assaad, and A. Ephremides, “Analysis of an age-dependent stochastic hybrid system,” in IEEE ISIT, June 2022.
  16. A. M. Bedewy, Y. Sun, S. Kompella, and N. B. Shroff, “Optimal sampling and scheduling for timely status updates in multi-source networks,” IEEE Transactions on Information Theory, vol. 67, no. 6, pp. 4019–4034, 2021.
  17. C. Joo and A. Eryilmaz, “Wireless scheduling for information freshness and synchrony: Drift-based design and heavy-traffic analysis,” IEEE/ACM Transactions on Networking, vol. 26, no. 6, pp. 2556–2568, Dec. 2018.
  18. I. Kadota and E. Modiano, “Minimizing the age of information in wireless networks with stochastic arrivals,” IEEE Transactions on Mobile Computing, vol. 20, no. 3, pp. 1173–1185, 2021.
  19. I. Kadota, A. Sinha, and E. Modiano, “Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints,” IEEE/ACM Transactions on Networking, vol. 27, no. 4, pp. 1359–1372, 2019.
  20. E. Fountoulakis, T. Charalambous, A. Ephremides, and N. Pappas, “Scheduling policies for AoI minimization with timely throughput constraints,” IEEE Transactions on Communications, vol. 71, no. 7, pp. 3905–3917, 2023.
  21. K. Saurav and R. Vaze, “Scheduling to minimize age of information with multiple sources,” IEEE Journal on Selected Areas in Information Theory, vol. 4, pp. 539–550, 2023.
  22. V. Tripathi, N. Jones, and E. Modiano, “Fresh-CSMA: A distributed protocol for minimizing age of information,” in IEEE Infocom, May 2023.
  23. N. Jones and E. Modiano, “Minimizing age of information in spatially distributed random access wireless networks,” in IEEE Infocom, May 2023.
  24. C. Li, “Optimizing information freshness in wireless networks,” Ph.D. dissertation, Virginia Polytechnic Institute and State University, 2023.
  25. M. Moltafet, M. Leinonen, and M. Codreanu, “Moment generating function of the AoI in a two-source system with packet management,” IEEE Wireless Communications Letters, vol. 10, no. 4, pp. 882–886, 2021.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now