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

网络函数计算能力上界的改进

Improved Upper Bound on the Network Function Computing Capacity

Xuan Guang, Raymond W. Yeung, Shenghao Yang, Congduan Li

摘要:

研究了有向无环网络上的网络函数计算问题。在这样的网络中,汇聚节点期望以零误差计算{ \em目标函数},其输入在多个源节点处生成。网络中的边被假定为无差错的,并且具有有限的容量。网络中的节点被假定为具有无限的计算能力,并能够执行网络编码。可以在网络上计算目标函数的网络代码的{ \em计算速率}是对于网络的一次使用以零误差计算目标函数的平均次数。在本文中,我们得到了一个改进的上界的计算能力,这是适用于任意目标函数和任意网络拓扑结构。这个改进的上界不仅是以前的上界的增强,但也是第一个严格的上界计算的算术和在一定的非树网络,这已在文献中得到广泛的研究。我们还介绍了一个多维数组的方法,便于评估改进的上限。此外,我们将这个界限的问题计算一个向量线性函数的网络。有了这个界,我们不仅能够加强以前的结果计算一个向量线性函数在网络上,但也大大简化了证明。最后,我们证明了对于计算反向蝶形网络上的二进制最大值函数,我们改进的上界是不可实现的。这一结果表明,在一般情况下,我们改进的上限是不可实现的,但它是否是渐近可实现的或没有保持开放。

英文摘要:

The problem of network function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node desires to compute with zero error a {\em target function}, of which the inputs are generated at multiple source nodes. The edges in the network are assumed to be error-free and have limited capacity. The nodes in the network are assumed to have unbounded computing capability and be able to perform network coding. The {\em computing rate} of a network code that can compute the target function over the network is the average number of times that the target function is computed with zero error for one use of the network. In this paper, we obtain an improved upper bound on the computing capacity, which is applicable to arbitrary target functions and arbitrary network topologies. This improved upper bound not only is an enhancement of the previous upper bounds but also is the first tight upper bound on the computing capacity for computing an arithmetic sum over a certain non-tree network, which has been widely studied in the literature. We also introduce a multi-dimensional array approach that facilitates evaluation of the improved upper bound. Furthermore, we apply this bound to the problem of computing a vector-linear function over a network. With this bound, we are able to not only enhance a previous result on computing a vector-linear function over a network but also simplify the proof significantly. Finally, we prove that for computing the binary maximum function over the reverse butterfly network, our improved upper bound is not achievable. This result establishes that in general our improved upper bound is non achievable, but whether it is asymptotically achievable or not remains open.

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

↑