Routing indices for peer-to-peer systems

被引：203

作者：

Crespo, A ^{[1
]}

Garcia-Molina, H ^{[1
]}

机构：

[1] Stanford Univ, Stanford, CA 94305 USA

来源：

22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/ICDCS.2002.1022239

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or flooding the network with queries. In this paper we introduce the concept of Routing Indices (RIs), which allow nodes to forward queries to neighbors that are more likely to have answers. If a node cannot answer a query, it forwards the query to a subset of its neighbors, based on its local RI, rather than by selecting neighbors at random or by flooding the network, by forwarding the query to all neighbors. We present three RI schemes: the compound, the hop-count, and the exponential routing indices. We evaluate their performance via simulations, and find that RIs can improve performance by one or two orders of magnitude vs. a flooding-based system, and by zip to 100% vs. a random forwarding system. We also discuss the tradeoffs between the different RI schemes and highlight the effects of key design variables on system performance.

引用

页码：23 / 32

页数：10