Minimum-Cost Coding for Distributed Storage Systems
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
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., ,  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.
EES Examensarbete / Master Thesis, XR-EE-KT 2011:001
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-55299OAI: oai:DiVA.org:kth-55299DiVA: diva2:471240
Master of Science - Wireless Systems
Skoglund, Mikael, Professor