When multi-hop peer-to-peer lookup matters
PEER-TO-PEER SYSTEMS III(2004)
摘要
Distributed hash tables have been around for a long time [1,2]. A number of recent projects propose peer-to-peer DHTs, based on multi-hop lookup optimizations. Some of these systems also require data permanence. This paper presents an analysis of when these optimizations are useful. We conclude that the multi-hop optimizations make sense only for truly vast and very dynamic peer networks. We also observe that resource trends indicate this scale is on the rise.
更多查看译文
关键词
recent project,hash table,long time,multi-hop lookup optimizations,data permanence,peer-to-peer dhts,multi-hop optimizations,multi-hop peer-to-peer lookup matter,resource trend,distributed hash table
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要