3-Competitive Policy for Minimizing Age of Information in Multi-Source M/G/1 Queuing Model
暂无分享,去创建一个
[1] Eytan Modiano,et al. Optimizing Age of Information in Wireless Networks with Throughput Constraints , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.
[2] Roy D. Yates,et al. Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.
[3] Eytan Modiano,et al. Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks , 2018, IEEE/ACM Transactions on Networking.
[4] 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.
[5] Mehul Motani,et al. Throughput Maximization with an Average Age of Information Constraint in Fading Channels , 2019, 2020 IEEE International Conference on Communications Workshops (ICC Workshops).
[6] Kumar Saurav,et al. Game of Ages in a Distributed Network , 2021, IEEE Journal on Selected Areas in Communications.
[7] Roy D. Yates,et al. Status updates through queues , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).
[8] Kumar Saurav,et al. Minimizing the Sum of Age of Information and Transmission Cost under Stochastic Arrival Model , 2021, IEEE INFOCOM 2021 - IEEE Conference on Computer Communications.
[9] J. Norris. Appendix: probability and measure , 1997 .
[10] Kumar Saurav,et al. Online Energy Minimization Under A Peak Age of Information Constraint , 2021, 2021 19th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt).
[11] Eytan Modiano,et al. Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals , 2019, IEEE Transactions on Mobile Computing.