Quickly Routing Searches Without Having to Move Content
Quickly Routing Searches Without Having to Move Content
复制标题
快速路由搜索而无需移动内容
DOI：
10.1007/11558989_15
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Brian F. Cooper
中科院分区：
文献类型：
--
作者：
Brian F. Cooper
通过战略性地移动或复制内容，已经做了大量的工作来改进对等路由。然而，有许多应用程序可能适合点对点架构，但其中内容移动是不可行的。我们认为，即使在这样的应用程序中，可以取得进展，在开发技术，确保有效的搜索。我们提出了几个这样的技术。首先，我们将网络组织成平方根拓扑结构，其中对等度与其内容受欢迎程度的平方根成正比，提供了比幂律网络更好的性能。其次，我们提出了路由优化的基础上存储在对等体的内容量，并跟踪“最好的”对等体，可以进一步提高性能。这些技术和其他技术可以提高搜索效率，即使在内容移动或复制不可行的情况下也是如此。
A great deal of work has been done to improve peer-to-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer architecture might be appropriate, but in which content movement is not feasible. We argue that even in such applications, progress can be made in developing techniques that ensure efficient searches. We present several such techniques. First, we show that organizing the network into a square-root topology, where peer degrees are proportional to the square root of the popularity of their content, provides much better performance than power-law networks. Second, we present routing optimizations based on the amount of content stored at peers, and tracking the “best” peers, that can further improve performance. These and other techniques can make searches efficient, even when content movement or replication is not feasible.