Optimal-cost repair in multi-hop distributed storage systems
2011 (English)In: IEEE International Symposium on Information Theory - Proceedings, IEEE , 2011, 1437-1441 p.Conference paper (Refereed)
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. Therepairprocess causes traffic in the network. Recent results in e.g., ,  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 therepairprocess. We formulate the minimum costrepairproblem in joint and decoupled methods. We investigate the required field size for the joint method. For the decoupled method, we show that the optimization problem is linear for the linear cost. We further show that the cooperation of surviving nodes could efficiently exploit the network topology and reduce therepaircost. 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
IEEE , 2011. 1437-1441 p.
Costs; Data storage equipment; Electric network topology; Information theory; Numerical methods; Optimization; Reliability theory; Topology
IdentifiersURN: urn:nbn:se:kth:diva-67509DOI: 10.1109/ISIT.2011.6033777ISI: 000297465101125ScopusID: 2-s2.0-80054801287ISBN: 978-145770595-3OAI: oai:DiVA.org:kth-67509DiVA: diva2:485067
2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011, St. Petersburg, 31 July-5 August, 2011
QC 201202082012-01-272012-01-272012-04-03Bibliographically approved