Abstrad-Searching for content in peer-to-peer networks is an interesting and challenging problem. Queries in Gnutella-Iike unstructured systems that use flooding or random walk to search must visit O ( n ) nodes in a network of size R , thus consuming significant amounts of bandwidth. In this paper, we propose a query routing protocol that allows low bandwidth consumption during query forwarding using a low cost mechanism to create and maintain information about nearby objects. To achieve this, our protocol maintains a lightweight probabilistic routing table at each node that suggests the location of each object in the network. Following the cortesponding routing table entries, a query can reach the destination in a small number of hops with high probability. However, maintaining routing tables in a large and highly dynamic network requires non-traditional mechanisms. We design a novel data structure called an Exponentially Decaying Blmm Filter (EDBF) that encodes such probabilistic routing tables in a highly compressed manner, and allows for efficient aggregation and propagation. The search primitives provided by our system can be used to search for single keys or multiple keywords with equal ease. Analytical modeling of our design predicts significant improvements in search efficiency, verified through extensive simulations in which we observed an order of magnitude reduction in query path length over previous proposal.
Exponentially Decaying Bloom Filters REF probabilistically encode routing tables in a highly compressed way that allows for efficient aggregation and propagation of routing information in unstructured peer-to-peer networks.
Efficient and scalable query routing for unstructured peer-to-peer networks
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
Computer Science