Provided by: WasatchWare
Date Added: May 2013
Network coding has been shown to achieve optimal multicast throughput, yet at an expensive computation cost: every node in the network has to code. Interested in minimizing resource consumption of network coding while maintaining its performance, in this paper, the authors propose a practical network coder placement algorithm which achieves comparable content distribution time as network coding, and at the same time, substantially reduces the number of network coders compared to a full network coding solution in which all peers have to encode, i.e. become encoders.