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

无向单播网络容量的分区界限

Undirected Unicast Network Capacity: A Partition Bound

Satyajit Thakor, Mohammad Ishtiyaq Qureshi

备注：
ISIT'19 (c) 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works
阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

摘要：

在本文中，我们提出了一种新的技术，以获得上界的无向单播网络的信息容量。利用这一技术，我们刻画了无向单播网络中信息流对称速率的一个上界--划分界，并给出了计算该上界的一个算法，给出了两类网络，它们的上界是紧的，且容量可通过路由实现，从而证实了这两类网络的无向单播猜想。我们还表明，在一般情况下，该界可以是松散的，并提出了一种方法来收紧它。

英文摘要：

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.

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

↑