Percolation in dense storage arrays

DOI10.1016/S0378-4371(02)01153-6zbMATH Open1001.68003MaRDI QIDQ1850367FDOQ1850367

Harald Huels, Robert B. Garner, Scott Kirkpatrick, Winfried W. Wilcke

Publication date: 3 December 2002

Published in: Physica A (Search for Journal in Brave)

zbMATH Keywords

data communication environmentredundancy strategiesshortest path lengths

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Network design and communication in computer systems (68M10)

Cites Work

• A note on two problems in connexion with graphs
• Sudden emergence of a giant \(k\)-core in a random graph

Cited In (6)

• Bootstrap percolation via automated conjecturing
• Finite-size effects for anisotropic bootstrap percolation: Logarithmic corrections
• Sharp thresholds for contagious sets in random graphs
• Exact solution of a jamming transition: Closed equations for a bootstrap percolation problem
• Bootstrap percolation in strong products of graphs
• Bootstrap and diffusion percolation transitions in three-dimensional lattices

   Recommendations

• Percolation of hard disks 👍 👎
• Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory 👍 👎
• Flexible usage of redundancy in disk arrays 👍 👎
• Failure of random networks 👍 👎
• Routing complexity of faulty networks 👍 👎

This page was built for publication: Percolation in dense storage arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850367)