Probabilistic Models and Algorithms for Data Synchronization/Broadcast Via Network Coding

We investigate the problem of data synchronization in which a sender has a set of packets to be distributed to all the receivers via a broadcast channel. Initially, each receiver has some fraction of the packets. At each time slot, the sender might broadcast a packet to all the receivers. The goal is to find a broadcast scheme that minimizes the number of time slots until all the receivers successfully obtain all the packets. We propose two probabilistic models on how the initial fractions of packets at receivers are distributed. These models arise naturally in many large-scale systems, such as peer-to-peer networks, data centers, and distributed storage systems. Based on these models, we establish probabilistic bounds and asymptotic results on the minimum number of time slots to successfully transmit all the packets to all the receivers. Next, we propose and analyze a number of random network coding algorithms for finding the approximately optimal solution. Theoretical analysis and simulations are provided to verify the probabilistic bounds and the proposed algorithms.

[1]  K. Jain,et al.  Practical Network Coding , 2003 .

[2]  René Peeters,et al.  Orthogonal representations over finite fields and the chromatic number of graphs , 1996, Comb..

[3]  Alexander Sprintson,et al.  On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks , 2007, 2007 IEEE Information Theory Workshop.

[4]  Colin Cooper,et al.  On the distribution of rank of a random matrix over a finite field , 2000, Random Struct. Algorithms.

[5]  M.A.R. Chaudhry,et al.  Efficient algorithms for Index Coding , 2008, IEEE INFOCOM Workshops 2008.

[6]  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..

[7]  Xiuzhen Cheng,et al.  Wireless data center networking , 2011, IEEE Wireless Communications.

[8]  Muriel Médard,et al.  XORs in the Air: Practical Wireless Network Coding , 2006, IEEE/ACM Transactions on Networking.

[9]  Asuman E. Ozdaglar,et al.  On the Delay and Throughput Gains of Coding in Unreliable Networks , 2008, IEEE Transactions on Information Theory.

[10]  Yitzhak Birk,et al.  Coding on demand by an informed source (ISCOD) for efficient broadcast of different supplemental data to caching clients , 2006, IEEE Transactions on Information Theory.

[11]  Herbert A. David,et al.  Order Statistics , 2011, International Encyclopedia of Statistical Science.

[12]  April Rasala Lehman,et al.  Complexity classification of network information flow problems , 2004, SODA '04.

[13]  David R. Karger,et al.  The complexity of matrix completion , 2006, SODA '06.

[14]  Yunnan Wu,et al.  Network Coding for the Internet and Wireless Networks , 2007, IEEE Signal Processing Magazine.

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

[16]  Robert D. Kleinberg,et al.  Index coding via linear programming , 2010, ArXiv.

[17]  Alexander Sprintson,et al.  On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.

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

[19]  Thinh P. Nguyen,et al.  A hybrid network coding technique for single-hop wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

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

[21]  Thierry Turletti,et al.  Network coding for wireless mesh networks: a case study , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[22]  Michael Langberg,et al.  On the complementary Index Coding problem , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[23]  Paramvir Bahl,et al.  Augmenting data center networks with multi-gigabit wireless links , 2011, SIGCOMM 2011.

[24]  Michael Langberg,et al.  On the Hardness of Approximating the Network Coding Capacity , 2008, IEEE Transactions on Information Theory.

[25]  Alexander Sprintson,et al.  Algorithms for weakly secure data exchange , 2013, 2013 International Symposium on Network Coding (NetCod).

[26]  D. Towsley,et al.  The Throughput Order of Ad Hoc Networks Employing Network Coding and Broadcasting , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[27]  Alexander Sprintson,et al.  Deterministic Algorithm for Coded Cooperative Data Exchange , 2010, QSHINE.

[28]  David M Levinson,et al.  Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering , 2009, Complex.

[29]  Jianping Wang,et al.  Data Dissemination in Wireless Sensor Networks with Network Coding , 2010, EURASIP J. Wirel. Commun. Netw..

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

[31]  Akira Tanaka,et al.  The worst-case time complexity for generating all maximal cliques and computational experiments , 2006, Theor. Comput. Sci..

[32]  Anthony Ephremides,et al.  On Joint MAC and Network Coding in Wireless Ad Hoc Networks , 2007, IEEE Transactions on Information Theory.

[33]  Ziv Bar-Yossef,et al.  Index Coding With Side Information , 2011, IEEE Trans. Inf. Theory.

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

[35]  Xiuzhen Cheng,et al.  Wireless link scheduling for data center networks , 2011, ICUIMC '11.

[36]  B. Arnold,et al.  Bounds on Expectations of Linear Systematic Statistics Based on Dependent Samples , 1979 .

[37]  Kenneth W. Shum,et al.  Generation of innovative and sparse encoding vectors for broadcast systems with feedback , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[38]  Dong Nguyen,et al.  Wireless Broadcast Using Network Coding , 2009, IEEE Transactions on Vehicular Technology.

[39]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[40]  Xiaohong Jiang,et al.  Network coding-based reliable multicast in wireless networks , 2010, Comput. Networks.

[41]  Richard D. Wesel,et al.  Coded Cooperative Data Exchange in Multihop Networks , 2012, IEEE Transactions on Information Theory.

[42]  Alexander Sprintson,et al.  A randomized algorithm and performance bounds for coded cooperative data exchange , 2010, 2010 IEEE International Symposium on Information Theory.

[43]  Alexander Sprintson,et al.  On coding for cooperative data exchange , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[44]  Muriel Médard,et al.  Symbol-level network coding for wireless mesh networks , 2008, SIGCOMM '08.