论文标题
无方向的单播网络容量：分区绑定
Undirected Unicast Network Capacity: A Partition Bound
论文作者
论文摘要
在本文中，我们提出了一项新技术，以获得无向Unicast网络信息能力的上限。使用此技术，我们根据未指向的单播网络中的对称信息流的对称速率表征了上限，称为分区结合，并给出了一种计算算法。提出了两个类别的网络，以通过路由来实现界限的紧密，从而确认了这些类别网络的无向单次猜想。我们还表明，该界限通常可以松动，并提出一种方法来拧紧它。
In this paper, we present a new technique to obtain upper bounds on undirected unicast network information capacity. Using this technique, we characterize an upper bound, called partition bound, on the symmetric rate of information flow in undirected unicast networks and give an algorithm to compute it. Two classes of networks are presented for which the bound is tight and the capacity is achievable by routing thus confirming the undirected unicast conjecture for these classes of networks. We also show that the bound can be loose in general and present an approach to tighten it.
