On the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks

Most current-generation P2P content distribution protocols use line-granularity blocks to distribute content to all the peers in a decentralized fashion. Such protocols often suffer from a significant degree of imbalance in block distributions, such that certain blocks become rare or even unavailable, adversely affecting content availability. It has been pointed out that randomized network coding may improve block availability in P2P networks, as coded blocks are equally innovative and useful to peers. However, the computational complexity of network coding mandates that, in reality, network coding needs to be performed within segments, each containing a subset of blocks. In this paper, using both theoretical analysis and simulations, we quantitatively evaluate how segment-based network coding may improve resilience to peer dynamics and content availability. The objective of this paper is to explore the fundamental tradeoff between the resilience gain of network coding and its inherent coding complexity. We introduce a differential equations approach to quantify the resilience gain of network coding as a function of the number of blocks in a segment, as well as various other tunable parameters. We conclude that a small number of blocks in each segment is sufficient to realize the major benefits of network coding, with acceptable coding complexity.

[1]  Muriel Medard,et al.  On Randomized Network Coding , 2003 .

[2]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Muriel Médard,et al.  Algebraic gossip: a network coding approach to optimal multiple rumor mongering , 2006, IEEE Transactions on Information Theory.

[4]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[5]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[6]  Yunnan Wu.  Network Coding for Multicasting , 2005 .

[7]  Dmitri Loguinov,et al.  On Lifetime-Based Node Failure and Stochastic Resilience of Decentralized Peer-to-Peer Networks , 2005, IEEE/ACM Transactions on Networking.

[8]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[9]  Michael Mitzenmacher,et al.  Load balancing and density dependent jump Markov processes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[10]  Bin Fan,et al.  Stochastic Analysis and File Availability Enhancement for BT-like File Sharing Systems , 2006, 200614th IEEE International Workshop on Quality of Service.

[11]  M I C H A E L M I T Z E N M A C H,et al.  Studying Balanced Allocations with Differential Equations † , 1999 .

[12]  Philippe Jacquet,et al.  Entropy Computations via Analytic Depoissonization , 1999, IEEE Trans. Inf. Theory.

[13]  Devavrat Shah,et al.  Information Dissemination via Network Coding , 2006, 2006 IEEE International Symposium on Information Theory.

[14]  Raymond W. Yeung.  Avalanche: A Network Coding Analysis , 2007, Commun. Inf. Syst..

[15]  Stephen A. Jarvis,et al.  Stochastic Analysis and Improvement of the Reliability of DHT-Based Multicast , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[16]  Christos Gkantsidis,et al.  Comprehensive view of a live network coding P2P system , 2006, IMC '06.

[17]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[18]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[19]  Gustavo de Veciana,et al.  Performance of peer-to-peer networks: Service capacity and role of resource sharing policies , 2006, Perform. Evaluation.

[20]  S. Resnick.  Adventures in stochastic processes , 1992 .

[21]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[22]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[23]  Laurent Massoulié,et al.  Coupon replication systems , 2005, IEEE/ACM Transactions on Networking.

[24]  Muriel Medard,et al.  How good is random linear coding based distributed networked storage , 2005 .

[25]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..

[26]  Christos Gkantsidis,et al.  Anatomy of a P2P Content Distribution system with Network Coding , 2006, IPTPS.

[27]  Gustavo de Veciana,et al.  Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.

[28]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[29]  T. Kurtz.  Approximation of Population Processes , 1987 .