Programming Languages White Papers
Conservative Network Coding
Overview Motivated by practical networking scenarios, this paper introduces a notion of restricted communication called conservative networking. Consider a network of lossless links and a number of independent sources. Each node needs to recover a certain subset of the sources. However, each node is conservative in that all information it receives can only be a function of the sources it will ultimately recover. For acyclic networks, the paper show that conservative networking admits a clean characterization; the rates achievable by integer routing, factional routing, and network coding are equal, and; this rate is determined by a simple cut bound. However, this clean characterization does not extend to cyclic networks.
| Publisher | Microsoft | File Format | |
|---|---|---|---|
| Date Published | September 2006 | ||
| Format | White Papers | ||
| Topics | |||


