Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient search in unstructured peer-to-peer networks
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Understanding churn in peer-to-peer networks
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
ATEC '06 Proceedings of the annual conference on USENIX '06 Annual Technical Conference
Optimizing Peer Relationships in a Super-Peer Network
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
| Hi-index | 0.01 |
Resource and data indexing in distributed, self-manageable systems can leverage on the experience gained from peer-to-peer networks, often built using distributed indexing. This paper presents FASE, a distributed indexing algorithm for unstructured overlays with flat topologies. FASE combines a replication policy and a search space division technique to achieve low hop counts using a small number of messages. The unexpected departure of nodes from the overlay, which may be observed in heterogeneous networks built over an unreliable medium, is mitigated by a distributed monitoring algorithm designed with FASE in mind. Simulation results validate FASE efficiency when compared to other search algorithms. The evaluation of the distributed monitoring algorithm shows that it maintains FASE performance when subjected to a constant arrival and departure of nodes.