Minimizing Age of Information for Multiple Flows
2018 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)(2018)
摘要
Age of Information (AoI) is an emerging metric measuring the freshness of a flow at its destination, which is critical for time-sensitive applications. We consider multiple flows served by a single server. To minimize the average AoI over all flows, we formulate preemptive and non-preemptive Maximum Age Difference (MAD) algorithms, and experimentally observe their superior performance with respect to various other scheduling algorithms for multi-flow networks. We also observe that both MAD and MAF (Maximum Age First) respond favorably to flow diversity, with a reduction in AoI.
更多查看译文
关键词
multiflow networks,flow diversity,multiple flows,time-sensitive applications,single server,nonpreemptive maximum age difference algorithms,age of information minimization,average AoI minimization,MAD algorithm,scheduling algorithms,MAF algorithm,maximum age first algorithm,Internet
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络