<filename>content/publication/hu-cooperative-2010/cite.bib<gh_stars>0
@article{hu_cooperative_2010,
 abstract = {This paper studies the recovery from multiple node failures in distributed storage systems. We design a mutually cooperative recovery (MCR) mechanism for multiple node failures. Via a cut-based analysis of the information flow graph, we obtain a lower bound of maintenance bandwidth based on MCR. For MCR, we also propose a transmission scheme and design a linear network coding scheme based on (¿, ¿) strong-MDS code, which is a generalization of (¿, ¿) MDS code. We prove that the maintenance bandwidth based on our transmission and coding schemes matches the lower bound, so the lower bound is tight and the transmission scheme and coding scheme for MCR are optimal. We also give numerical comparisons of MCR with other redundancy recovery mechanisms in storage cost and maintenance bandwidth to show the advantage of MCR.},
 author = {<NAME> <NAME> <NAME> <NAME> <NAME>.},
 doi = {10.1109/JSAC.2010.100216},
 issn = {1558-0008},
 journal = {IEEE Journal on Selected Areas in Communications},
 keywords = {Bandwidth, Computer science, High performance computing, distributed storage systems, network coding, Network coding, linear codes, Telecommunication traffic, network theory (graphs), Availability, cooperative recovery, Costs, cut-based analysis, Distributed computing, Flow graphs, Information analysis, information flow graph, linear network coding scheme, low bound, maintenance bandwidth, multiple node failures, mutually cooperative recovery mechanism, Network coding, Distributed storage system, Erasure coding, Multiple loss recovery, redundancy recovery mechanisms, strong-MDS code},
 month = {February},
 note = {Conference Name: IEEE Journal on Selected Areas in Communications},
 number = {2},
 pages = {268--276},
 title = {Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding},
 volume = {28},
 year = {2010}
}

