Abstract

This paper introduces FASD, a fault-tolerant, adaptive, scalable, and distributed search layer designed to augment existing peer-to-peer applications. The FASD layer operates as a network of identical nodes that collectively pool their storage space to cache "metadata keys" and cooperatively route queries to the nodes most likely to satisfy them. A "metadata key" is a list of weighted terms that describe the information content of a document in the underlying network. Although completely decentralized, FASD's approach is able to e#ciently match the recall and precision of a centralized search engine. Simulation results indicate that latency and bandwidth consumption scale logarithmically with the size of a FASD network.

Citations