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
Minimum-Cost Coding for Distributed Storage Systems
KTH, School of Electrical Engineering (EES), Communication Theory.
2011 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

In distributed storage systems reliability is achieved through redundant storage nodes distributed in the network. Then a data collector can recover source information even if some nodes fail. To maintain reliability, an autonomous and efficient protocol should be used to reconstruct the failed node. The repair process causes traffic in the network. Recent results in e.g., [1], [2] found the optimal traffic-storage tradeoff, and proposed regenerating codes to achieve the optimality. We investigate the link costs and the impact of network topologies during the repair process. We formulate the minimum cost repair problem in joint and decoupled methods. We investigate the required field size for the joint method. For the decoupled method, we show that the problem is linear for the linear cost. We further show that the cooperation of surviving nodes could efficiently exploit the network topology and reduce the repair cost. The numerical results in tandem, star and grid networks show the benefits of our methods in term of the repair cost.

Place, publisher, year, edition, pages
2011. , 55 p.
Series
EES Examensarbete / Master Thesis, XR-EE-KT 2011:001
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-55299OAI: oai:DiVA.org:kth-55299DiVA: diva2:471240
Educational program
Master of Science - Wireless Systems
Uppsok
Technology
Examiners
Available from: 2012-01-19 Created: 2012-01-02 Last updated: 2012-03-15Bibliographically approved

Open Access in DiVA

fulltext(1357 kB)286 downloads
File information
File name FULLTEXT01.pdfFile size 1357 kBChecksum SHA-512
a51598ed4c7e9db5b34f1c18b4e960106deeff7ba22b5d05353da7f5ae031a4fda00698427074421a54e4dacb3cf211abb8c60bcc14dfa3dfdd03fb730c8c162
Type fulltextMimetype application/pdf

By organisation
Communication Theory
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 286 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: 119 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