Decentralized minimum-cost repair for distributed storage systems
2013 (English)In: Communications (ICC), 2013 IEEE International Conference on, IEEE conference proceedings, 2013, 1910-1914 p.Conference paper (Refereed)
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.
, IEEE International Conference on Communications, ISSN 1550-3607
Centralized control, Cloud storages, Code construction, Convex optimization problems, Distributed storage system, Dual decomposition, Optimal transmission, Transmission costs
IdentifiersURN: urn:nbn:se:kth:diva-140990DOI: 10.1109/ICC.2013.6654801ISI: 000349673801001ScopusID: 2-s2.0-84891352830ISBN: 978-146733122-7OAI: oai:DiVA.org:kth-140990DiVA: diva2:693807
2013 IEEE International Conference on Communications, ICC 2013; Budapest; Hungary; 9 June 2013 through 13 June 2013
QC 201402052014-02-052014-02-052015-12-07Bibliographically approved