Storage and search in dynamic peer-to-peer networks
Join (topology)
DOI:
10.1145/2486159.2486170
Publication Date:
2013-07-16T18:06:58Z
AUTHORS (6)
ABSTRACT
We study robust and efficient distributed algorithms for searching, storing, maintaining data in dynamic Peer-to-Peer (P2P) networks. P2P networks are highly that experience heavy node churn (i.e., nodes join leave the network continuously over time). Our goal is to guarantee, despite high rate, a large number of can store, retrieve, maintain items. main contributions fast randomized guarantee above with probability even under adversarial churn. In particular, we present following results:
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (49)
CITATIONS (26)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....