An Algebraic Approach to Link Failures Based on Network Coding
An Algebraic Approach to Link Failures Based on Network Coding
复制标题
DOI：
10.1109/tit.2006.889736
复制
发表时间：
2007-02
影响因子：
2.5
通讯作者：
Kai Cai;Pingyi Fan
中科院分区：
文献类型：
--
作者：
Kai Cai;Pingyi Fan
在本文中，我们基于网络编码的最新成果研究了链路失效问题。我们提出了一个概念，称为网络容量因子，它是影响网络容量的最小链路集，作为我们的基本工具。我们定义了网络各链路的容量等级来表征其临界性，并提出了p稳定网络的概念。在此基础上，导出了容量因子大小的上界，构造了一类p稳定网络
In this correspondence, we investigate the link failure problem based on the recent results of network coding. We propose a concept, named capacity factor of a network, which is the minimum link set that can influence the network capacity, as our basic tool. We define the capacity rank to each link of the network to characterize its criticality and present the concept of the p-stable network. Based on these notions, an upper bound for the capacity factor size is derived and a family of p-stable networks is constructed