arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.07247cs.ITmath.IT
收藏

多源多服务器网络的信息时代

Age of Information for Multiple-Source Multiple-Server Networks

Alireza Javani, Marwen Zorgui, Zhiying Wang

摘要:

在各种应用程序中,及时了解信息源的当前状态至关重要。特别地,由于处理和通信延迟,状态更新可能比其生成时间晚到达目的地。目的地的状态更新的新鲜度由信息的年龄的概念捕获。在这项研究中,我们分析了一个多传感网络,多个源,多个服务器和一个监视器(目的地)。每个来源对应一个独立的信息,其年龄是单独衡量的。给定一个特定的源,服务器独立地感知信息源,并将状态更新发送给监视器。我们假设更新到达服务器根据泊松随机过程。每个服务器都通过一个直接链接将其更新发送到监视器,该链接被建模为一个队列。传输更新的服务时间被认为是指数随机变量。我们研究同质和异质的服务和到达率的单源的情况下,只有同质的到达率和服务率的多源的情况下。我们推导出一个封闭形式的表达式的平均年龄下的信息后来先服务(LCFS)队列为一个单一的源和任意数量的同构服务器。使用递归的方法,我们推导出显式的平均年龄的信息为任何数量的源和同构服务器。我们还调查了异构服务器和一个单一的来源,并提出了算法,找到平均年龄的信息。

英文摘要:

Having timely and fresh knowledge about the current state of information sources is critical in a variety of applications. In particular, a status update may arrive at the destination later than its generation time due to processing and communication delays. The freshness of the status update at the destination is captured by the notion of age of information. In this study, we analyze a multiple sensing network with multiple sources, multiple servers, and a monitor (destination). Each source corresponds to an independent piece of information and its age is measured individually. Given a particular source, the servers independently sense the source of information and send the status update to the monitor. We assume that updates arrive at the servers according to Poisson random processes. Each server sends its updates to the monitor through a direct link, which is modeled as a queue. The service time to transmit an update is considered to be an exponential random variable. We examine both homogeneous and heterogeneous service and arrival rates for the single-source case, and only homogeneous arrival and service rates for the multiple-source case. We derive a closed-form expression for the average age of information under a last-come-first-serve (LCFS) queue for a single source and arbitrary number of homogeneous servers. Using a recursive method, we derive the explicit average age of information for any number of sources and homogeneous servers. We also investigate heterogeneous servers and a single source, and present algorithms for finding the average age of information.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑