Polymatroidal Flows on Two Classes of Information Networks
Polymatroidal Flows on Two Classes of Information Networks
复制标题
两类信息网络上的多拟阵流
DOI：
10.1109/tit.2010.2090229
复制
发表时间：
2011
影响因子：
2.5
通讯作者：
Satish Babu Korada
中科院分区：
文献类型：
--
作者：
D. Vasudevan;Satish Babu Korada
给出了两类信息网络：多址接入信道网络(MAC)和确定性广播信道网络(DBCS)的广播容量域的内界。我们的可实现方案是一种基于分离的方案，该方案由物理层和网络层组成，物理层涉及对网络中的组成信道进行“清理”以创建点对点有线覆盖，而网络层涉及在该有线覆盖上进行路由。结果表明，寻找最优的“清理”方法等价于在“多面体”流网中寻找最大流的问题，这是一个已经解决的问题。由此得到的内界是关于产品输入分布的割集界，并且对于DBCS的网络是紧的。
We present inner bounds to the broadcast capacity region of two classes of information networks: Networks of Multiple Access Channels (MACs) and Networks of Deterministic Broadcast Channels (DBCs). Our achievability scheme is a separation based scheme consisting of a physical layer that involves “cleaning up” the constituent channels in the network to create a point-to-point wired overlay, and a network layer that involves routing over this wired overlay. It is shown that finding the optimal way to “clean-up” is equivalent to the problem of finding maximal flows in “polymatroidal” flow networks, an already solved problem. The resulting inner bounds are cut-set bounds evaluated over product input distributions and are tight for Networks of DBCs.