AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead

LECTURE NOTES IN COMPUTER SCIENCE, (2003): 160-169

引用421|浏览28
EI
下载 PDF 全文
引用

摘要

A peer-to-peer (p2p) distributed hash table (DHT) system allows hosts to join and fail silently (or leave), as well as to insert and retrieve files (objects). This paper explores a new point in design space in which increased memory usage and constant background communication overheads axe tolerated to reduce file lookup times and increas...更多

代码

数据

0
您的评分 :

暂无评分

标签
评论
游客768659
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn