Optimizing Information Freshness Through Computation–Transmission Tradeoff and Queue Management in Edge Computing

Edge computing applications typically require generated data to be preprocessed at the source and then transmitted to an edge server. In such cases, transmission time and preprocessing time are coupled, yielding a tradeoff between them to achieve the targeted objective. This paper presents analysis of such a system with the objective of optimizing freshness of received data at the edge server. We model this system as two queues in tandem whose service times are independent over time but the transmission service time is monotonically dependent on the computation service time in mean value. This dependence captures the natural decrease in transmission time due to lower offloaded computation. We analyze various queue management schemes in this tandem queue where the first queue has a single server, Poisson packet arrivals, general independent service and no extra buffer to save incoming status update packets. The second queue has a single server receiving packets from the first queue and service is memoryless. We consider the second queue in two forms: (i) No data buffer and (ii) One unit data buffer and last come first serve with discarding. We analyze various non-preemptive as well as preemptive cases. We perform stationary distribution analysis and obtain closed form expressions for average age of information (AoI) and average peak AoI. Our numerical results illustrate analytical findings on how computation and transmission times could be traded off to optimize AoI and reveal a consequent tradeoff between average AoI and average peak AoI.

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

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

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

[4]  Eytan Modiano,et al.  Can Determinacy Minimize Age of Information? , 2018, ArXiv.

[5]  Houman Homayoun,et al.  Optimal Allocation of Computation and Communication in an IoT Network , 2018, ACM Trans. Design Autom. Electr. Syst..

[6]  Xiao Ma,et al.  Reducing Age-of-Information for Computation-Intensive Messages via Packet Replacement , 2019, 2019 11th International Conference on Wireless Communications and Signal Processing (WCSP).

[7]  Suresh Subramaniam,et al.  Waiting Before Serving: A Companion to Packet Management in Status Update Systems , 2019, IEEE Transactions on Information Theory.

[8]  Jingxian Wu,et al.  Optimal Status Update for Age of Information Minimization With an Energy Harvesting Source , 2017, IEEE Transactions on Green Communications and Networking.

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

[10]  Tetsuya Takine,et al.  A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues , 2018, IEEE Transactions on Information Theory.

[11]  Anthony Ephremides,et al.  On the Age of Information With Packet Deadlines , 2018, IEEE Transactions on Information Theory.

[12]  Shahab Farazi,et al.  Average age of information for status update systems with an energy harvesting server , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[13]  Elif Uysal-Biyikoglu,et al.  Scheduling status updates to minimize age of information with an energy harvesting sensor , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[15]  Omur Ozel,et al.  Trading Off Computation with Transmission in Status Update Systems , 2019, 2019 IEEE 30th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC).

[16]  Elif Uysal-Biyikoglu,et al.  Age of information under energy replenishment constraints , 2015, 2015 Information Theory and Applications Workshop (ITA).

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

[18]  Sennur Ulukus,et al.  Age-Minimal Transmission in Energy Harvesting Two-Hop Networks , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

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

[20]  Ning Zhang,et al.  Joint Computation and Communication Resource Allocation for Energy-Efficient Mobile Edge Networks , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[21]  Suresh Subramaniam,et al.  Relative Age of Information: A New Metric for Status Update Systems , 2019, 2019 IEEE Information Theory Workshop (ITW).

[22]  Chao Xu,et al.  Optimizing Information Freshness in Computing-Enabled IoT Networks , 2019, IEEE Internet of Things Journal.

[23]  Suresh Subramaniam,et al.  On the Benefits of Waiting in Status Update Systems , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[24]  Rajai Nasser,et al.  Age of information: The gamma awakening , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[25]  Roy D. Yates,et al.  Status Updates through Networks of Parallel Servers , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[26]  Anthony Ephremides,et al.  The Age of Updates in a Simple Relay Network , 2018, 2018 IEEE Information Theory Workshop (ITW).

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

[28]  Jing Yang,et al.  Sening Information Through Status Updates , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).