arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0908.0722cs.NI
收藏

基于网络编码的最大流保护

Max-Flow Protection using Network Coding

Osameh M. Al-Kofahi, Ahmed E. Kamal

摘要:

在任何通信网络中,任何一对通信节点S和T之间的链路不相交路径的最大数量受到S-T最小链路切割的限制。文献中已经提出了多路径路由协议,以利用这些S-T路径来增强S-T信息流的生存性。这通常通过使用这些路径的子集来从S向T转发冗余数据单元或组合(如果允许网络编码)来实现。因此,这种生存性的增强降低了有用的S-T信息速率。在本文中,我们提出了一种新的方法来提高生存性的S-T信息流,而不损害最大可达的S-T信息速率。要做到这一点,瓶颈链路(在最小割中)应该只转发有用的信息,而不是冗余的数据单元。我们引入了关于某个S-T最大流的额外源或目的连通性的概念,然后我们研究了两个问题:即切前保护和切后保护。虽然我们在这两个问题中的目标是相同的,我们的目标是最大限度地提高保护路径的数量,我们的分析表明,这两个问题的性质是非常不同的,并且预切保护问题要困难得多。具体来说,我们证明了预切保护问题的难度,将其表示为一个整数线性规划,并提出了一种启发式方法来解决它。模拟表明,即使在相对较大的网络的启发式的性能是可以接受的。在后切割问题中,我们证明了所有的数据单元,转发的最小切割边不入射到T,可以后切割保护。

英文摘要:

In any communication network, the maximum number of link-disjoint paths between any pair of communicating nodes, S and T, is limited by the S-T minimum link-cut. Multipath routing protocols have been proposed in the literature to make use of these S-T paths in enhancing the survivability of the S-T information flow. This is usually accomplished by using a subset of these paths to forward redundant data units or combinations (if network coding is allowed) from S to T. Therefore, this enhancement in survivability reduces the useful S-T information rate. In this paper we present a new way to enhance the survivability of the S-T information flow without compromising the maximum achievable S-T information rate. To do this, bottleneck links (in the min-cut) should only forward useful information, and not redundant data units. We introduce the idea of extra source or destination connectivity with respect to a certain S-T max-flow, and then we study two problems: namely, pre-cut protection and post-cut protection. Although our objective in both problems is the same, where we aim to maximize the number of protected paths, our analysis shows that the nature of these two problems are very different, and that the pre-cut protection problem is much harder. Specifically, we prove the hardness of the pre-cut protection problem, formulate it as an integer linear program, and propose a heuristic approach to solve it. Simulations show that the performance of the heuristic is acceptable even on relatively large networks. In the post-cut problem we show that all the data units, forwarded by the min-cut edges not incident to T, can be post-cut-protected.

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

↑