Building scalable and robust peer-to-peer overlay networks for broadcasting using network coding

Abstract

We propose a scheme for building peer-topeer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, constraints on bandwidth, and locality of decisions. We analyze the system theoretically and prove near optimal bounds on the parameters defining robustness and scalability. As a result we show that the effects of failures are contained locally, allowing the network to grow exponentially with server load. We also argue that adversarial failures are no more harmful than random failures.

A Survey of Linear Network Coding and Network Error Correction Code Constructions and Algorithms

“…The minimum coding distance has been defined in terms of coding redundancy at each sink as [47] d min,t = δ t + 1 (9) and can be applied in the scope of symbol-based transmission, that is, the codewords at the receiver t are vectors of symbols in F q as in (5). From the definition of coding distance follows that the number of correctable errors at the receiver t is l = (d min,t − 1)/2 , and the number of detectable errors is d min,t − 1.…”

“…The communication can be protected against attacks from malicious nodes [4], eavesdropping entities [5,6], and impairments such as noise and information losses [7,8] thanks to the property of the network of acting as a coding operator. In peer-to-peer networks, the distribution of a number of encoded versions of the source data avoids the well-known problem of the missing block at the end of the download [9,10].…”

Minimum Cost Mirror Sites Using Network Coding: Replication versus Coding at the Source Nodes

“…Also in the equations, we have the convention that if there is no edge between nodes and in , the flow is zero. For any , we have (12) where is the conditional entropy of the second formulation.…”

“…Under network coding based multicast, the problem of allocating resources such as rates and flows in the network can be solved in polynomial time [11]. Coding not only allows guaranteed optimal performance which is at least as good as tree-based approaches [12], but also does not suffer from the complexity issues associated with Steiner tree packings. Moreover, one can arrive at distributed solutions to these problems [11], [13].…”

Network Coding for Wireless Mesh Networks: A Case Study

“…The key idea is that, one can approach the broadcast capacity of the network by allowing intermediate nodes inside the network to code and decode the information carried by the different flows. Since then, network coding's popularity is increasing and many research papers have appeared on the subject [12,3,7,8,4]. Most of these papers focus on the multicast case where all receivers are interested in the same information.…”