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

网络拓扑的等价性

On Equivalence Between Network Topologies

Michelle Effros, Tracey Ho, Shirin Jalali

摘要:

网络编码中的一个主要问题是描述一般多源多需求网络的容量域。现有的一些计算工具可用于限制一般网络的容量,但它们的计算复杂性随着网络的规模迅速增长。这促使我们提出了一种新的分层方法,该方法可以为给定的网络找到较小尺寸的上下边界网络。这种方法顺序地用更简单的结构替换网络的组件,即,具有更少的链路或节点,使得所得到的网络更适合于计算分析,并且其容量提供了原始网络容量的上限或下限。由此产生的界限的准确性可以作为一个功能的链接容量的有界。令人惊讶的是,我们能够简化一些网络结构族,而不会损失任何准确性。

英文摘要:

One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for bounding the capacity of general networks, but their computational complexity grows very quickly with the size of the network. This motivates us to propose a new hierarchical approach which finds upper and lower bounding networks of smaller size for a given network. This approach sequentially replaces components of the network with simpler structures, i.e., with fewer links or nodes, so that the resulting network is more amenable to computational analysis and its capacity provides an upper or lower bound on the capacity of the original network. The accuracy of the resulting bounds can be bounded as a function of the link capacities. Surprisingly, we are able to simplify some families of network structures without any loss in accuracy.

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

↑