|
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 efficiently 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. Acknowledgments and Pledge First and foremost, I thank my parents whose love, dedication, and support saw me through the long and difficult journey culminating in this thesis. Thanks also to Hania for bearing with her brother as he disappeared from, |
