Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Implementing Distributed Storage Systemsby Network Coding and ConsideringComplexity of Decoding
KTH, School of Electrical Engineering (EES), Communication Theory.
2012 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Recently, network coding for distributed storage system has become a popular field due to increasing applications such as video, VoIP or mail. There are lots of theoretical works in this field, yet not enough practical study. In this thesis we implement a distributed storage system using network coding. In our implementation, three strategies of coding applied to this system: replication, regenerating code and regenerating code with repair by transfer. To study advantageous or disadvantageous of these strategies, we measure probability of successful downloading, repair time and processing time after implementation. We further study regenerating code with different finite field. Moreover we propose a method for low complexity of decoding algorithm. It is to assign different number of connected storage node which a receiver uses to reconstruct an original file. Our results show that the regenerating code with repair by transfer is an optimal network code for the distributed storage system when comparing to other strategies when working in small finite field size. In particular, in GF(2), the code only uses exclusive-OR to encode and decode data. In addition when finite field is large, the probability of successful downloading increases with the cost of higher complexity comparing to network code with small finite field size. To work in small finite field and consequently reducing complexity in decoding, we show by increasing number of connected node the probability of successful downloading improves. Thus we conclude that the regenerating code with repair by transfer is optimal implementation within system. However if we only consider the regenerating code with different number of connected storage node retrieving the original file, higher number of connected storage node is better than lower number of storage node connected.

Place, publisher, year, edition, pages
2012. , 58 p.
Series
EES Examensarbete / Master Thesis, XR-EE-KT 2012:001
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-103607OAI: oai:DiVA.org:kth-103607DiVA: diva2:560898
Educational program
Master of Science - Network Services and Systems
Uppsok
Technology
Supervisors
Examiners
Available from: 2012-10-24 Created: 2012-10-16 Last updated: 2012-10-24Bibliographically approved

Open Access in DiVA

Master Thesis Report(1836 kB)338 downloads
File information
File name FULLTEXT01.pdfFile size 1836 kBChecksum SHA-512
98d982fd0bd90384d767876866ff5e0fa992d10f934637c4326bf0fa88b7635185e3b49ed0454c12c91594eae446c800983d9a1f7cc0900376a08b575ea1eb91
Type fulltextMimetype application/pdf

By organisation
Communication Theory
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 338 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 147 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf