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
Decentralized minimum-cost repair for distributed storage systems
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-5407-0835
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9810-3478
KTH, School of Electrical Engineering (EES), Communication Theory. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0002-7926-5081
2013 (English)In: Communications (ICC), 2013 IEEE International Conference on, IEEE conference proceedings, 2013, 1910-1914 p.Conference paper, Published paper (Refereed)
Abstract [en]

There have been emerging lots of applications for distributed storage systems e.g., those in wireless sensor networks or cloud storage. Since storage nodes in wireless sensor networks have limited battery, it is valuable to find a repair scheme with optimal transmission costs (e.g., energy). The optimal-cost repair has been recently investigated in a centralized way. However a centralized control mechanism may not be available or is very expensive. For the scenarios, it is interesting to study optimal-cost repair in a decentralized setup. We formulate the optimal-cost repair as convex optimization problems for the network with convex transmission costs. Then we use primal and dual decomposition approaches to decouple the problem into subproblems to be solved locally. Thus, each surviving node, collaborating with other nodes, can minimize its transmission cost such that the global cost is minimized. We further study the optimality and convergence of the algorithms. Finally, we discuss the code construction and determine the field size for finding feasible network codes in our approaches.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013. 1910-1914 p.
Series
IEEE International Conference on Communications, ISSN 1550-3607
Keyword [en]
Centralized control, Cloud storages, Code construction, Convex optimization problems, Distributed storage system, Dual decomposition, Optimal transmission, Transmission costs
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:kth:diva-140990DOI: 10.1109/ICC.2013.6654801ISI: 000349673801001Scopus ID: 2-s2.0-84891352830ISBN: 978-146733122-7 (print)OAI: oai:DiVA.org:kth-140990DiVA: diva2:693807
Conference
2013 IEEE International Conference on Communications, ICC 2013; Budapest; Hungary; 9 June 2013 through 13 June 2013
Note

QC 20140205

Available from: 2014-02-05 Created: 2014-02-05 Last updated: 2015-12-07Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Xiao, MingFischione, CarloSkoglund, Mikael

Search in DiVA

By author/editor
Gerami, MajidXiao, MingFischione, CarloSkoglund, Mikael
By organisation
Communication TheoryACCESS Linnaeus CentreAutomatic Control
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 76 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