Approximate Hash-Based Set Reconciliation for Distributed Replica Repair
暂无分享,去创建一个
[1] Jeffrey Considine,et al. Fast Approximate Reconciliation of Set Differences , 2002 .
[2] Ernst W. Biersack,et al. A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.
[3] Werner Vogels,et al. Dynamo: amazon's highly available key-value store , 2007, SOSP.
[4] David A. Patterson,et al. Nye's Trie and Floret Estimators: Techniques for Detecting and Repairing Divergence in the SCADS Distributed Storage Toolkit , 2010 .
[5] Florian Schintke,et al. Scalaris: reliable transactional p2p key/value store , 2008, ERLANG '08.
[6] Seif Haridi,et al. Symmetric Replication for Structured Peer-to-Peer Systems , 2005, DBISP2P.
[7] Michael T. Goodrich,et al. Invertible bloom lookup tables , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[8] Salma Ktari,et al. Performance evaluation of replication strategies in DHTs under churn , 2007, MUM.
[9] Burton H. Bloom,et al. Space/time trade-offs in hash coding with allowable errors , 1970, CACM.
[10] Kang Li,et al. Approximate caches for packet classification , 2004, IEEE INFOCOM 2004.
[11] Sasu Tarkoma,et al. Theory and Practice of Bloom Filters for Distributed Systems , 2012, IEEE Communications Surveys & Tutorials.
[12] Jon Crowcroft,et al. A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.
[13] Effiziente Reparatur von Repliken in Distributed Hash Tables , 2012 .
[14] Ralph C. Merkle,et al. A Certified Digital Signature , 1989, CRYPTO.
[15] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[16] Josh Cates,et al. Robust and efficient data management for a distributed hash table , 2003 .
[17] Rodrigo Rodrigues,et al. High Availability in DHTs: Erasure Coding vs. Replication , 2005, IPTPS.
[18] Michael Mitzenmacher,et al. Less Hashing, Same Performance: Building a Better Bloom Filter , 2006, ESA.
[19] Michael Mitzenmacher,et al. Compressed bloom filters , 2001, PODC '01.
[20] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.
[21] Bernard Chazelle,et al. The Bloomier filter: an efficient data structure for static support lookup tables , 2004, SODA '04.