Date Added: Jan 2012
The recent file storage applications built on top of peer-to-peer distributed hash tables lack search capabilities. The authors believe that search is an important part of any document publication system. To that end, they have designed and analyzed a distributed search engine based on a distributed hash table. Their simulation results predict that the search engine can answer an average query in under one second, using under one kilobyte of bandwidth. Recent work on Distributed Hash Tables (DHTs) such as Chord, CAN, and Pastry has addressed some of the scalability and reliability problems that plagued earlier peer-to-peer overlay networks such as Napster and Gnutella.