Routing Indices For Peer-to-Peer Systems
نویسندگان
چکیده
Finding information in a peer-to-peer system currently requires either a costly and vulnerable central index, or ooding 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 ooding 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 nd that RIs can improve performance by one or two orders of magnitude vs. a ooding-based system, and by up to 100% vs. a random forwarding system. We also discuss the tradeo s between the di erent RI schemes and highlight the e ects of key design variables on system performance.
منابع مشابه
TAC: A Topology-Aware Chord-based Peer-to-Peer Network
Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...
متن کاملExploiting Local Popularity To Prune Routing Indices In Peer-to-Peer System
Routing in unstructured peer-to-peer system relies either on broadcasting (also called flooding) or on Routing Indices. An approach using Routing Indices is only scalable if the Routing Indices are of manageable size. In this paper, we present a strategy to prune Routing Indices based on the popularity of resources. The Routing Indices maintain routing information for queries to the most popula...
متن کاملAdaptive Double Routing Indices: Combining Effectiveness and Efficiency in P2P Systems
Unstructured peer-to-peer systems rely on strategies and data structures (Routing Indices) for the routing of requests in the network. For those requests corresponding to information retrieval queries, the emphasis can be either put on the effectiveness of the routing by privileging the relevance of the documents retrieved, or on the efficiency of the routing by privileging the response time. W...
متن کاملInformation Integration in Schema-Based Peer-To-Peer Networks
Peer-to-peer (P2P) networks have become an important infrastructure during the last years. Using P2P networks for distributed information systems allows us to shift the focus from centrally organized to distributed information systems where all peers can provide and have access to information. In previous papers, we have described an RDF-based P2P infrastructure called Edutella which is a speci...
متن کاملExploiting Query Feedback for Efficient Query Routing in Unstructured Peer-to-peer Networks
Unstructured peer-to-peer networks are popular due to its robustness and scalability. Query schemes that are being used in unstructured peer-to-peer such as the flooding and interest-based shortcuts suffer various problems such as using large communication overhead long delay response. The use of routing indices has been a popular approach for peer-to-peer query routing. It helps the query rout...
متن کاملAdaptive Peer-to-Peer Routing with Proximity
In this paper, we presented a routing strategy for requests in unstructured peer-to-peer networks. The strategy is based on the adaptive routing Q-routing. The strategy uses reinforcement learning to estimate the cost of routing a request. Such a strategy is scalable only if the routing indices are of reasonable size. We proposed and comparatively evaluated three methods for the pruning for the...
متن کامل