• DocumentCode
    2743486
  • Title

    Implementation of Linear Network Coding on Parallel Architecture

  • Author

    Rakesh, Nitin ; Nitin, Nitin

  • Author_Institution
    Dept. of Comput. Sci. & Eng. & Inf. Technol., Jaypee Univ. of Inf. Technol., Waknaghat, India
  • fYear
    2009
  • fDate
    25-27 Nov. 2009
  • Firstpage
    450
  • Lastpage
    454
  • Abstract
    Parallel architectures involves parallel communication with the aim of fast receiving of complete information with higher information rate at each nodes. To reduce the complexity of parallel communication we have considered Multi-Mesh of Trees (MMT) architecture for parallel communication and implemented Linear Network Coding (LNC) on MMT by proposing Linear-Code Multicast with Parallel Algorithms (LCM-PA) to achieve max-flow from the source to each receiving nodes. We wish to minimize the communication steps and time complexity involved in transfer of data from processor to processor during parallel communication while achieving the desired throughput in a multicast scenario. We developed a novel distributed parallel network approach, which is enriched by linear coding.
  • Keywords
    computational complexity; linear codes; linear network analysis; parallel architectures; Implementation linear network coding; fast receiving complete information; higher information rate; linear code multicast; linear network coding; multi mesh trees; novel distributed parallel network; parallel architecture; parallel communication; time complexity; Computer networks; Computer science; Concurrent computing; Data communication; Galois fields; Information rates; Information technology; Network coding; Parallel algorithms; Parallel architectures; Linear network coding; cyclic and acyclic delay free networks; information rate; max-flow; parallel algorithms;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Modeling and Simulation, 2009. EMS '09. Third UKSim European Symposium on
  • Conference_Location
    Athens
  • Print_ISBN
    978-1-4244-5345-0
  • Electronic_ISBN
    978-0-7695-3886-0
  • Type

    conf

  • DOI
    10.1109/EMS.2009.35
  • Filename
    5358727