An algebraic approach to network coding
An algebraic approach to network coding
复制标题
DOI：
10.1109/tnet.2003.818197
复制
发表时间：
2003-10-01
影响因子：
3.7
通讯作者：
Médard, M
中科院分区：
文献类型：
--
作者：
Koetter, R;Médard, M
我们重新审视网络容量的问题。研究表明，网络编码是实现网络容量的重要组成部分。Li等人最近研究了多播网络的网络容量，在此基础上，我们将网络编码框架扩展到任意网络和鲁棒网络。对于限制使用线性网络码的网络，我们得到了给定网络上任意给定连接集的可行性的充分必要条件。我们还考虑了非遍历链路故障时的网络恢复问题。对于组播设置，我们证明存在提供最大鲁棒性网络的编码策略，并且不需要网络内部适应所讨论的故障模式。对无延迟网络和有延迟网络都得到了结果。
We take a new look at the issue of network capacity. It is shown that network coding is an essential ingredient in achieving the capacity of a network. Building on recent work by Li et al., who examined the network capacity of multicast networks, we extend the network coding framework to arbitrary networks and robust networking. For networks which are restricted to using linear network codes, we find necessary and sufficient conditions for the feasibility of any given set of connections over a given network. We also consider the problem of network recovery for nonergodic link failures. For the multicast setup we prove that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question. The results are derived for both delay-free networks and networks with delays.