Network coding for large scale content distribution

Abstract

Abstrucf-We propose a new scheme for content dktribution of large files that is based on network coding. With network coding, each node o f the distribution network is able to generate and transmit encoded blocks of information. The randomization introduced by the coding process eases the scheduling of block propagation, and, thus, makes the distribution more efficient. This is particularly important in large unstructured overlay networks, where the nodes need to make block forwarding decisions based on local information only. We compare network coding to other schemes that transmit unencoded information (i.e. blocks of the original file) and, also, to schemes in which only the source is allowed to generate and transmit encoded packets.We study the performance of network coding in heterogeneous networks with dynamic node arrival and departure patterns, clustered topologies, and when incentive mechanisms to discourage free-riding are in plece. We demonstrate through simulations of scenarios of practical interest that the expected file download time improves by more than 20-30470 with network coding compared to coding at the server only and, by more than 2-3 times compared to sending unencoded information. Moreover, we show that network coding improves the robustness of the system and is able to smoothly handle extreme situations where the server and nodes leave the system.

Signing a Linear Subspace: Signature Schemes for Network Coding

“…Krohn et al [24] (see also [13]) suggest homomorphic hashing for preventing pollution attacks. In their scheme, the sender computes a hash h i = H(v i ) of each block of the file; given x = (h 1 , .…”

“…Because of these advantages, network coding has been proposed for applications in wireless and/or ad-hoc networks, where communication is at a premium and centralized control may be unavailable; it has also been suggested as an efficient means for content distribution in peer-topeer networks [24], and for improving the performance of large-scale data dissemination over the Internet [12].…”

Location-Aware Optimal Resource Selection Method for P2P-Based Contents Management and Real-Time Distribution

“…Furthermore, a P2P-based live streaming applications such as PPLive [14] have been already released, and are now attracting a large number of users. On the other hand, a mesh-based topology for the content distribution has also been proposed by existing studies [15]- [17].…”

Outburst: Efficient Overlay Content Distribution with Rateless Codes

“…Avalanche [11] is a well-known content distribution scheme with network coding. Similar to Outburst, it is robust to node dynamics and reduces delivery redundancy.…”