{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T15:25:07Z","timestamp":1777389907949,"version":"3.51.4"},"reference-count":65,"publisher":"MDPI AG","issue":"6","license":[{"start":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T00:00:00Z","timestamp":1654128000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["61901105"],"award-info":[{"award-number":["61901105"]}]},{"name":"National Natural Science Foundation of China","award":["62171119"],"award-info":[{"award-number":["62171119"]}]},{"name":"National Natural Science Foundation of China","award":["BK20190343"],"award-info":[{"award-number":["BK20190343"]}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["61901105"],"award-info":[{"award-number":["61901105"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["62171119"],"award-info":[{"award-number":["62171119"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20190343"],"award-info":[{"award-number":["BK20190343"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Zhi Shan Young Scholar Program of Southeast University","award":["61901105"],"award-info":[{"award-number":["61901105"]}]},{"name":"Zhi Shan Young Scholar Program of Southeast University","award":["62171119"],"award-info":[{"award-number":["62171119"]}]},{"name":"Zhi Shan Young Scholar Program of Southeast University","award":["BK20190343"],"award-info":[{"award-number":["BK20190343"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The age of information (AoI) metric was proposed to measure the freshness of messages obtained at the terminal node of a status updating system. In this paper, the AoI of a discrete time status updating system with probabilistic packet preemption is investigated by analyzing the steady state of a three-dimensional discrete stochastic process. We assume that the queue used in the system is Ber\/Geo\/1\/2*\/\u03b7, which represents that the system size is 2 and the packet in the buffer can be preempted by a fresher packet with probability \u03b7. Instead of considering the system\u2019s AoI separately, we use a three-dimensional state vector (n,m,l) to simultaneously track the real-time changes of the AoI, the age of a packet in the server, and the age of a packet waiting in the buffer. We give the explicit expression of the system\u2019s average AoI and show that the average AoI of the system without packet preemption is obtained by letting \u03b7=0. When \u03b7 is set to 1, the mean of the AoI of the system with a Ber\/Geo\/1\/2* queue is obtained as well. Combining the results we have obtained and comparing them with corresponding average continuous AoIs, we propose a possible relationship between the average discrete AoI with the Ber\/Geo\/1\/c queue and the average continuous AoI with the M\/M\/1\/c queue. For each of two extreme cases where \u03b7=0 and \u03b7=1, we also determine the stationary distribution of AoI using the probability generation function (PGF) method. The relations between the average AoI and the packet preemption probability \u03b7, as well as the AoI\u2019s distribution curves in two extreme cases, are illustrated by numerical simulations. Notice that the probabilistic packet preemption may occur, for example, in an energy harvest (EH) node of a wireless sensor network, where the packet in the buffer can be replaced only when the node collects enough energy. In particular, to exhibit the usefulness of our idea and methods and highlight the merits of considering discrete time systems, in this paper, we provide detailed discussions showing how the results about continuous AoI are derived by analyzing the corresponding discrete time system and how the discrete age analysis is generalized to the system with multiple sources. In terms of packet service process, we also propose an idea to analyze the AoI of a system when the service time distribution is arbitrary.<\/jats:p>","DOI":"10.3390\/e24060785","type":"journal-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T11:05:02Z","timestamp":1654167902000},"page":"785","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Age Analysis of Status Updating System with Probabilistic Packet Preemption"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0962-2063","authenticated-orcid":false,"given":"Jixiang","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, Southeast University, Nanjing 210096, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3191-6903","authenticated-orcid":false,"given":"Yinfei","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Southeast University, Nanjing 210096, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Kaul, S., Gruteser, M., Rai, V., and Kenney, J. (2011, January 27\u201330). Minimizing age of information in vehicular networks. Proceedings of the 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, Salt Lake City, UT, USA.","DOI":"10.1109\/SAHCN.2011.5984917"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1561\/1300000060","article-title":"Age of Information: A New Concept, Metric, and Tool","volume":"12","author":"Kosta","year":"2017","journal-title":"Found. Trends Netw."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1109\/JSAC.2021.3065072","article-title":"Age of Information: An Introduction and Survey","volume":"39","author":"Yates","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Kaul, S., Yates, R., and Gruteser, M. (2012, January 25\u201330). Real-time status: How often should one update?. Proceedings of the 2012 Proceedings IEEE INFOCOM, Orlando, FL, USA.","DOI":"10.1109\/INFCOM.2012.6195689"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"8305","DOI":"10.1109\/TIT.2019.2938171","article-title":"A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues","volume":"65","author":"Inoue","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1109\/TIT.2018.2871079","article-title":"The Age of Information: Real-Time Status Updating by Multiple Sources","volume":"65","author":"Yates","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Kaul, S.K., Yates, R.D., and Gruteser, M. (2012, January 21\u201323). Status updates through queues. Proceedings of the 2012 46th Annual Conference on Information Sciences and Systems (CISS), Princeton, NJ, USA.","DOI":"10.1109\/CISS.2012.6310931"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Costa, M., Codreanu, M., and Ephremides, A. (July, January 29). Age of information with packet management. Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6875100"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1897","DOI":"10.1109\/TIT.2016.2533395","article-title":"On the Age of Information in Status Update Systems With Packet Management","volume":"62","author":"Costa","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kam, C., Kompella, S., Nguyen, G.D., Wieselthier, J.E., and Ephremides, A. (2016, January 10\u201315). Age of information with a packet deadline. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541762"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"6419","DOI":"10.1109\/TIT.2018.2818739","article-title":"On the Age of Information With Packet Deadlines","volume":"64","author":"Kam","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Inoue, Y. (2018, January 17\u201322). Analysis of the Age of Information with Packet Deadline and Infinite Buffer Capacity. Proceedings of the 2018 IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437853"},{"key":"ref_13","unstructured":"Kavitha, V., Altman, E., and Saha, I. (2018). Controlling Packet Drops to Improve Freshness of information. arXiv."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1109\/JCN.2019.000036","article-title":"When to preempt? Age of information minimization under link capacity constraint","volume":"21","author":"Wang","year":"2019","journal-title":"J. Commun. Netw."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Arafa, A., Yates, R.D., and Poor, H.V. (2019, January 24\u201327). Timely Cloud Computing: Preemption and Waiting. Proceedings of the 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2019.8919891"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"3864","DOI":"10.1109\/TIT.2019.2963035","article-title":"Waiting Before Serving: A Companion to Packet Management in Status Update Systems","volume":"66","author":"Zou","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1109\/TIT.2015.2511791","article-title":"Effect of Message Transmission Path Diversity on Status Age","volume":"62","author":"Kam","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Kaswan, P., Bastopcu, M., and Ulukus, S. (2021, January 12\u201320). Freshness Based Cache Updating in Parallel Relay Networks. Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia.","DOI":"10.1109\/ISIT45174.2021.9518003"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5003","DOI":"10.1109\/TCOMM.2020.2997414","article-title":"On the Age of Information in Multi-Source Queueing Models","volume":"68","author":"Moltafet","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1109\/JSAIT.2022.3158421","article-title":"Age of Information in Multi-source Updating Systems Powered by Energy Harvesting","volume":"3","author":"Dhillon","year":"2022","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/OJCOMS.2021.3062678","article-title":"Optimizing Information Freshness in a Multiple Access Channel With Heterogeneous Devices","volume":"2","author":"Chen","year":"2021","journal-title":"IEEE Open J. Commun. Soc."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TIT.2021.3124872","article-title":"Joint Performance Analysis of Ages of Information in a Multi-Source Pushout Server","volume":"68","author":"Jiang","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Tang, Z., Sun, Z., Yang, N., and Zhou, X. (2020, January 7\u201311). Age of Information of Multi-Source Systems with Packet Management. Proceedings of the 2020 IEEE International Conference on Communications Workshops (ICC Workshops), Dublin, Ireland.","DOI":"10.1109\/ICCWorkshops49005.2020.9145326"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Farazi, S., Klein, A.G., and Brown, D.R. (2019, January 3\u20136). Average Age of Information in Multi-Source Self-Preemptive Status Update Systems with Packet Delivery Errors. Proceedings of the 2019 53rd Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/IEEECONF44664.2019.9048914"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Abd-Elmagid, M.A., and Dhillon, H.S. (2022). A Stochastic Hybrid Systems Approach to the Joint Distribution of Ages of Information in Networks. arXiv.","DOI":"10.23919\/WiOpt56218.2022.9930546"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"He, T., Chin, K.W., Zhang, Z., Liu, T., and Wen, J. (2022). Optimizing Information Freshness in RF-Powered Multi-Hop Wireless Networks. IEEE Trans. Wirel. Commun.","DOI":"10.1109\/TWC.2022.3155168"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1109\/JSAC.2021.3065060","article-title":"Optimizing Information Freshness in Two-Hop Status Update Systems under a Resource Constraint","volume":"39","author":"Gu","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/LNET.2020.2976991","article-title":"Probability Analysis of Age of Information in Multi-Hop Networks","volume":"2","author":"Ayan","year":"2020","journal-title":"IEEE Netw. Lett."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/JCN.2019.000038","article-title":"Fundamental bounds on the age of information in multi-hop global status update networks","volume":"21","author":"Farazi","year":"2019","journal-title":"J. Commun. Netw."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Talak, R., Karaman, S., and Modiano, E. (2017, January 3\u20136). Minimizing age-of-information in multi-hop wireless networks. Proceedings of the 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2017.8262777"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Moradian, M., and Dadlani, A. (2021, January 7\u201311). Average Age of Information in Two-Way Relay Networks with Service Preemptions. Proceedings of the IEEE GLOBECOM, Madrid, Spain.","DOI":"10.1109\/GLOBECOM46510.2021.9685463"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Zakeri, A., Moltafet, M., Leinonen, M., and Codreanu, M. (2021, January 7\u201311). Minimizing AoI in Resource-Constrained Multi-Source Relaying Systems with Stochastic Arrivals. Proceedings of the IEEE GLOBECOM, Madrid, Spain.","DOI":"10.1109\/GLOBECOM46510.2021.9685946"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Yuan, X., Zhu, Y., Jiang, H., Hu, Y., and Schmeink, A. (2021, January 7\u201311). Data Freshness Optimization in Relaying Network Operating with Finite Blocklength Codes. Proceedings of the IEEE GLOBECOM, Madrid, Spain.","DOI":"10.1109\/GLOBECOM46510.2021.9685691"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"14485","DOI":"10.1109\/JIOT.2021.3051417","article-title":"Optimizing Information Freshness for Cooperative IoT Systems With Stochastic Arrivals","volume":"8","author":"Li","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Hu, J., and Yang, K. (2021). Average Age of Information in Wireless Powered Relay Aided Communication Network. IEEE Internet Things J.","DOI":"10.1109\/JIOT.2021.3128358"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1109\/JSAIT.2022.3159745","article-title":"Version Age of Information in Clustered Gossip Networks","volume":"3","author":"Buyukates","year":"2022","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Yates, R.D. (2021, January 12\u201320). The Age of Gossip in Networks. Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, Australia.","DOI":"10.1109\/ISIT45174.2021.9517796"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"5712","DOI":"10.1109\/TIT.2020.2998100","article-title":"The Age of Information in Networks: Moments, Distributions, and Sampling","volume":"66","author":"Yates","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Champati, J.P., Al-Zubaidy, H., and Gross, J. (2018, January 15\u201319). Statistical guarantee optimization for age of information for the D\/G\/1 queue. Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Honolulu, HI, USA.","DOI":"10.1109\/INFCOMW.2018.8406909"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TCOMM.2020.3027877","article-title":"Statistical Guarantee Optimization for AoI in Single-Hop and Two-Hop FCFS Systems With Periodic Arrivals","volume":"69","author":"Champati","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"5661","DOI":"10.1109\/TCOMM.2020.3002994","article-title":"Finding the Exact Distribution of (Peak) Age of Information for Queues of PH\/PH\/1\/1 and M\/PH\/1\/2 Type","volume":"68","author":"Akar","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/TNET.2019.2946481","article-title":"Optimizing Information Freshness in Wireless Networks under General Interference Constraints","volume":"28","author":"Talak","year":"2020","journal-title":"IEEE-ACM Trans. Netw."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"4747","DOI":"10.1109\/TCOMM.2020.2991992","article-title":"A Reinforcement Learning Framework for Optimizing Age of Information in RF-Powered Communication Systems","volume":"68","author":"Dhillon","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1109\/TNET.2019.2918736","article-title":"Scheduling Algorithms for Optimizing Age of Information in Wireless Networks with Throughput Constraints","volume":"27","author":"Kadota","year":"2019","journal-title":"IEEE-ACM Trans. Netw."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"2269","DOI":"10.1109\/TMC.2020.2977010","article-title":"Optimizing Information Freshness in Wireless Networks: A Stochastic Geometry Approach","volume":"20","author":"Yang","year":"2021","journal-title":"IEEE. Trans. Mob. Comput."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"1887","DOI":"10.1109\/TNET.2019.2936759","article-title":"Joint Assignment and Scheduling for Minimizing Age of Correlated Information","volume":"27","author":"He","year":"2019","journal-title":"IEEE-ACM Trans. Netw."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"2903","DOI":"10.1109\/TMC.2019.2936199","article-title":"Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals","volume":"19","author":"Hsu","year":"2020","journal-title":"IEEE. Trans. Mob. Comput."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1109\/TMC.2019.2959774","article-title":"Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals","volume":"20","author":"Kadota","year":"2021","journal-title":"IEEE. Trans. Mob. Comput."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1109\/TNET.2018.2873606","article-title":"Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks","volume":"26","author":"Kadota","year":"2018","journal-title":"IEEE-ACM Trans. Netw."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1109\/TWC.2020.3032237","article-title":"On the Optimality of the Whittle\u2019s Index Policy for Minimizing the Age of Information","volume":"20","author":"Maatouk","year":"2021","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"7468","DOI":"10.1109\/TCOMM.2019.2931538","article-title":"Joint Status Sampling and Updating for Minimizing Age of Information in the Internet of Things","volume":"67","author":"Zhou","year":"2019","journal-title":"IEEE Trans. Commun."},{"key":"ref_52","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1049\/ip-cta:20050088","article-title":"Modelling and analysis of stochastic hybrid systems","volume":"153","author":"Hespanha","year":"2006","journal-title":"IEE Proc.-Control Theory Appl."},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Kosta, A., Pappas, N., Ephremides, A., and Angelakis, V. (2020, January 7\u201311). Non-linear Age of Information in a Discrete Time Queue: Stationary Distribution and Average Performance Analysis. Proceedings of the 2020 IEEE International Conference on Communications (ICC), Dublin, Ireland.","DOI":"10.1109\/ICC40277.2020.9148775"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1109\/JSAC.2021.3065045","article-title":"The Age of Information in a Discrete Time Queue: Stationary Distribution and Non-Linear Age Mean Analysis","volume":"39","author":"Kosta","year":"2021","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Brill, P. (2017). Level Crossing Methods in Stochastic Models, Springer.","DOI":"10.1007\/978-3-319-50332-5"},{"key":"ref_56","unstructured":"Tripathi, V., Talak, R., and Modiano, E. (2019). Age of Information for Discrete Time Queues. arXiv."},{"key":"ref_57","doi-asserted-by":"crossref","first-page":"14531","DOI":"10.1109\/JIOT.2021.3053768","article-title":"Discrete-Time Queueing Model of Age of Information With Multiple Information Sources","volume":"8","author":"Akar","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"ref_58","doi-asserted-by":"crossref","unstructured":"Zhang, J., and Xu, Y. (2021, January 17\u201321). On Age of Information for Discrete Time Status Updating System With Ber\/G\/1\/1 Queues. Proceedings of the IEEE Information Theory Workshop (ITW), Kanazawa, Japan.","DOI":"10.1109\/ITW48936.2021.9611393"},{"key":"ref_59","doi-asserted-by":"crossref","unstructured":"Zhang, J., and Xu, Y. (2022). On Discrete Age of Information of Infinite Size Status Updating System. arXiv.","DOI":"10.1109\/ITW54588.2022.9965796"},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Zhang, J. (2022). Discrete Packet Management: Analysis of Age of Information of Discrete Time Status Updating Systems. arXiv.","DOI":"10.1109\/ITW54588.2022.9965796"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1109\/TCOMM.2020.3036672","article-title":"Average AoI in Multi-Source Systems With Source-Aware Packet Management","volume":"69","author":"Moltafet","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_62","doi-asserted-by":"crossref","unstructured":"Feng, S., and Yang, J. (2019, January 20\u201324). Age-Optimal Transmission of Rateless Codes in an Erasure Channel. Proceedings of the 2019 IEEE International Conference on Communications (ICC), Shanghai, China.","DOI":"10.1109\/ICC.2019.8761668"},{"key":"ref_63","doi-asserted-by":"crossref","unstructured":"Zhong, J., Yates, R.D., and Soljanin, E. (2018, January 25\u201329). Timely Lossless Source Coding for Randomly Arriving Symbols. Proceedings of the 2018 IEEE Information Theory Workshop (ITW), Guangzhou, China.","DOI":"10.1109\/ITW.2018.8613380"},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"7297","DOI":"10.1109\/TCOMM.2021.3106347","article-title":"The Multi-Source Probabilistically Preemptive M\/PH\/1\/1 Queue With Packet Errors","volume":"69","author":"Akar","year":"2021","journal-title":"IEEE Trans. Commun."},{"key":"ref_65","doi-asserted-by":"crossref","unstructured":"Thekkilakattil, A., Dobrin, R., and Punnekkat, S. (2012, January 20\u201322). Probabilistic preemption control using frequency scaling for sporadic real-time tasks. Proceedings of the 7th IEEE International Symposium on Industrial Embedded Systems (SIES\u201912), Karlsruhe, Germany.","DOI":"10.1109\/SIES.2012.6356581"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/6\/785\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:24:00Z","timestamp":1760138640000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/6\/785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,2]]},"references-count":65,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2022,6]]}},"alternative-id":["e24060785"],"URL":"https:\/\/doi.org\/10.3390\/e24060785","relation":{"has-preprint":[{"id-type":"doi","id":"10.20944\/preprints202205.0010.v1","asserted-by":"object"}]},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,2]]}}}