Node Repair for Adversarial Graphical Networks

Node repair on graphs is a recent variation of the distributed storage model, where connections between the storage nodes are described by a graph. Here we study this problem under the assumption that some of the nodes act as adversaries, altering the data that they store. We derive bounds on the communication complexity of repair and construct codes that support repair in the presence of adversarial nodes.