The authors consider the problem of efficient recovery of the data stored in any individual node of a distributed storage system, from the rest of the nodes. Applications include handling failures and degraded reads. They measure efficiency in terms of the amount of data-read and the download required. To minimize the download, they focus on the minimum bandwidth setting of the 'Regenerating codes' model for distributed storage. Under this model, the system has a total of n nodes, and the data stored in any node must be (efficiently) recoverable from any d of the other (n-1) nodes.