Skip to main content
SpringerLink
Log in

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

  • Original Article
  • Published:
International Journal of System Assurance Engineering and Management Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20

Similar content being viewed by others

References

  • Agarwal A, Charikar M (2004) On the advantage of network coding for improving network throughput. In: Proceedings of IEEE information theory workshop

  • Ahlswede R, Cai N, Li S-Y, Yeung R (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204–1216

    Article  MathSciNet  MATH  Google Scholar 

  • Chou PA, Wu Y (2007) Network coding for the internet and wireless networks. IEEE Signal Process Mag 24(5):77–85

    Article  Google Scholar 

  • Chou PA, Wu Y, Jain K (2003) Practical network coding. In: Proceedings of 41st annual allerton conference on communication, control and computing

  • Fragouli C, Widmer J, Boudec J-YL (2006) A network coding approach to energy efficient broadcasting: from theory to practice. In: Proceedings of IEEE international conference on computer communications

  • Koetter R, Medard M (2003) An algebraic approach to network coding. IEEE/ACM Trans Netw 11(5):782–795

    Article  Google Scholar 

  • Kramer G, Savari SA (2004) Cut sets and information flow in networks of two-way channels. In: Proceedings of IEEE international symposium on information theory

  • Li Z, Li B (2004) Network coding in undirected networks. In: Proceedings of 38th annual conference on information sciences and systems, Princeton, pp 17–19

  • Li S-YR, Yeung RW, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49:371–381

    Article  MathSciNet  Google Scholar 

  • Lin Y, Li B, Liang B (2008) Stochastic analysis of network coding in epidemic routing. IEEE J Sel Areas Commun 26:794–808

    Article  Google Scholar 

  • Ning C (2009) Valuable messages and random outputs of channels in linear network coding. In: Proceedings of the 2009 IEEE international conference on symposium on information theory, vol 1, pp 413–417

  • Rakesh N, Nitin (2009) Analysis of all to all broadcast on multi mesh of trees using genetic algorithm. In: International workshop on advances in computer networks, VLSI, ANVIT

  • Rakesh N, Nitin (2011) Analysis of multi-sort algorithm on multi-mesh of trees (MMT) architecture. J Supercomput 57(3):400–431

    Article  Google Scholar 

  • Rakesh N, Tyagi V (2011a) Linear-code multicast on parallel architectures. Advances in engineering software. Elsevier 42:1074–1088

    MATH  Google Scholar 

  • Rakesh N, Tyagi V (2011b) Efficient broadcasting in parallel networks using network coding. In: Proceedings of The first international conference on parallel, distributed computing technologies and applications, Springer, CCIS 203, pp 484–494

  • Rakesh N, Tyagi V (2011c) Linear network coding on multi-mesh of trees using all to all broadcast. Int J Comput Sci Issues 8(3):462–471

    Google Scholar 

  • Sanders P, Egner S, Tolhuizen L (2003) Polynomial time algorithms for network information flow. In: Proceedings of 15th ACM symposium on parallel algorithms and architectures, pp 286–94

  • Widmer J, Fragouli C, Boudec J-YL (2005) Low-complexity energy-efficient broadcasting in wireless ad-hoc networks using network coding. In: Proceedings of network coding, theory, and applications workshop

  • Yang M, Yang Y (2009) A hypergraph approach to linear network coding in multicast networks. IEEE Trans Parallel Distrib Syst 21:968–982

    Article  Google Scholar 

  • Yeung RW, Li S-YR, Cai N, Zhang Z (2006) Network coding theory: a tutorial. Found Trends Commun Inf Theory 2:241–381

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engineering, Jaypee University of Information Technology, Waknaghat, Solan, 173215, Himachal Pradesh, India

    Nitin Rakesh

  2. Department of Computer Science & Engineering, Jaypee University of Engineering and Technology, Guna, Madhya Pradesh, India

    Vipin Tyagi

Authors
  1. Nitin Rakesh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vipin Tyagi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nitin Rakesh.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rakesh, N., Tyagi, V. Parallel architecture coding: link failure–recovery mechanism (PAC: LF–RM). Int J Syst Assur Eng Manag 4, 386–396 (2013). https://doi.org/10.1007/s13198-012-0119-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13198-012-0119-4

Keywords

Search

Navigation