Parallel architecture coding: link failure–recovery mechanism (PAC: LF–RM)

Parallel network coding is a new communication paradigm that takes advantage of the broadcast using characteristics of network coding for parallel architectures. Network coding has recently developed as an innovative paradigm for optimization problems for high-scale communication between several nodes of these architectures. In previous work, a decentralized approach by optimizing parallel communication with the use of network coding has been proposed. In the present paper, the chance of communication failure is evaluated and an efficient solution (PAC: LF–RM) for such situations is proposed. It is shown that since communication failure may occur and is not avoidable so to overcome such failure and the data loss, buffering at an alternate degree of network nodes will reduce this stipulation. This paper explores the combination of network coding and node buffering for handling communication failure situation in the 2D Mesh network and results are presented for various cases of communication failures.

[1]  Nitin,et al.  Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture , 2011, The Journal of Supercomputing.

[2]  Nitin,et al.  Analysis of All to All Broadcast on multi mesh of trees using genetic algorithm , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[3]  Vipin Tyagi,et al.  Efficient Broadcasting in Parallel Networks Using Network Coding , 2011 .

[4]  Shuo-Yen Robert Li,et al.  Network Coding Theory - Part I: Single Source , 2005, Found. Trends Commun. Inf. Theory.

[5]  Yuanyuan Yang,et al.  A Hypergraph Approach to Linear Network Coding in Multicast Networks , 2010, IEEE Transactions on Parallel and Distributed Systems.

[6]  Ning Cai.  Valuable messages and random outputs of channels in linear network coding , 2009, 2009 IEEE International Symposium on Information Theory.

[7]  Peter Sanders,et al.  Polynomial time algorithms for network information flow , 2003, SPAA '03.

[8]  Amit Agarwal,et al.  On the advantage of network coding for improving network throughput , 2004, ITW.

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

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

[11]  Serap A. Savari,et al.  Cut sets and information flow in networks of two-way channels , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

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

[13]  Christina Fragouli,et al.  Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding , 2005 .

[14]  Vipin Tyagi,et al.  Linear-code multicast on parallel architectures , 2011, Adv. Eng. Softw..

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

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

[17]  Jörg Widmer,et al.  A Network Coding Approach to Energy Efficient Broadcasting: From Theory to Practice , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[18]  Zongpeng Li,et al.  Network Coding in Undirected Networks , 2004 .

[19]  Baochun Li,et al.  Stochastic analysis of network coding in epidemic routing , 2008, IEEE Journal on Selected Areas in Communications.