A Proactive Mechanism for Efficient Information Discovery

In relation to decentralized search on top of P2P communication paradigm, we study a proactive mechanism that is based on the dissemination of advertisements for new sources that join a system. The system design goal of limiting the state maintained by each peer and ensuring search efficiency is the driving reason for exploiting the small-world idea, and in particular the hierarchical network model that provides theoretical bounds on search time. Starting from the study of this theoretical model, we then tried to reflect it into protocol design. Simulation results testify the theoretical bounds on search time and provide a quantification view on the search time in relation to the directory capacity requirements of the peers