Sheaf cohomology on network codings: maxflow-mincut theorem

<p>Surveying briefly a novel algebraic topological application sheaf theory into directed network coding<br />problems, we obtain the weak duality in multiple source scenario by<br />using the idea of modified graph. Furthermore,we establish the<br />maxflow-mincut theorem with network coding sheaves in the case of multiple source.</p>

The Test of Practical Network Coding

Network Coding is used to increase network throughput. In the network coding, network data packets will be encoded by the sender and the encoded data packets can be used by different receivers to recovery the same original data packets. This increases the network transmission efficiency. Coding on data will consume the computing resources and this becomes the bottleneck of network codings practicability. In this paper, we assume that the coding happens at the end of the network and we conduct some tests on the pc and hand-devices. Our results show that network coding can work well on current PC, and we need a native device support to make the network coding working on the hand-devices.