Reducing Age-of-Information for Computation-Intensive Messages via Packet Replacement

Freshness of data is an important performance metric for real-time applications, which can be measured by age-of-information. For computation-intensive messages, the embedded information is not available until being computed. In this paper, we study the age-of-information for computation-intensive messages, which are firstly transmitted to a mobile edge server, and then processed there to extract the embedded information. The packet generation follows zero-wait policy, by which a new packet is generated when the last one is just delivered to the edge server. The queue in front of the edge server adopts one-packet-buffer replacement policy, meaning that only the latest received packet is preserved. We derive the expression of average age-of-information for exponentially distributed transmission time and computing time. Numerical results show that the average age with packet replacement is smaller than that without packet replacement, especially when transmission rate is close to or greater than computing rate. In addition, the region where edge computing outperforms local computing is characterized.

[1]  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).

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

[3]  K. B. Letaief,et al.  A Survey on Mobile Edge Computing: The Communication Perspective , 2017, IEEE Communications Surveys & Tutorials.

[4]  Xiao Ma,et al.  Age-of- Information for Computation- Intensive Messages in Mobile Edge Computing , 2019, 2019 11th International Conference on Wireless Communications and Signal Processing (WCSP).

[5]  Roy D. Yates,et al.  Status updates through queues , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[6]  Vaneet Aggarwal,et al.  Joint Information Freshness and Completion Time Optimization for Vehicular Networks , 2018, IEEE Transactions on Services Computing.

[7]  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.

[8]  Roy D. Yates,et al.  The Age of Information in Networks: Moments, Distributions, and Sampling , 2018, IEEE Transactions on Information Theory.

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

[10]  Roy D. Yates,et al.  Age of information in a network of preemptive servers , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[11]  Roy D. Yates,et al.  Lazy is timely: Status updates by an energy harvesting source , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[12]  Marian Codreanu,et al.  On the Age of Information in Status Update Systems With Packet Management , 2015, IEEE Transactions on Information Theory.