[ Pagewise preview ]
| Category | Value | ||
| Available via | http://dbpubs.stanford.edu/pub/2001-48 | ||
| Submitted on | 6th of November 2001 | ||
| Author | Crespo, Arturo; Garcia-Molina, Hector | ||
| Title | Routing Indices For Peer-to-Peer Systems | ||
| Date of publication | 3rd of November 2001 | ||
| Published in | Submitted for publication | ||
| Citation | Crespo, Arturo; Garcia-Molina, Hector. Routing Indices For Peer-to-Peer Systems, Submitted for publication | ||
| Number of pages | 27 | ||
| Language | English | ||
| Project | Database Group; Digital Libraries | ||
| Type | Technical Report | ||
| Subject group | Computer Science; Databases and the Web; Digital Libraries; Distributed Systems; Miscellaneous | ||
| Abstract | 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 up 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. | ||
| Keywords | Peer-to-peer systems, Routing Index, Query Processing, Query Forwarding, Approximate Indices, Content Discovery, Distributed Search Mechanisms | ||
| Fulltext source |
| Management of the document by | pubs@db.stanford.edu
| |
[ Pagewise preview ]