Abstract
With the goal to provide high data availability, replicas of data will be distributed based on the idea of threshold, meaning that data service is guaranteed to be available so long as any k out of n peers are online. The key distribution algorithm of the model as well as its scalability, management, and other availability-related factors are presented and analyzed. © 2010 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Wu, B. Y., Chi, C. H., Liu, C., Xie, Z. H., & Ding, C. (2010). High availability data model for P2P storage network. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6488 LNCS, pp. 322–327). https://doi.org/10.1007/978-3-642-17616-6_29
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
