G. Sakarian and H. Unger (Germany)
P2P, Information Search, WEB Communities
P2P-networks become more and more interesting not only because of the emergence of file sharing systems like Gnutella. Such decentralized systems have a lot of advan tages compared to centralized client-server systems. How ever, information search is still a central problem in such P2P web communities, since the used complete search with message chains may cause high search response times. In this paper we emphasize that these search times can be significantly influenced by the message forward algorithm and by the topology of the community, which can be easily changed by respective, local executed algorithms. For do ing so, content and traffic oriented methods were proposed. Their efficiency has been proved through a simulation and the respective results.
Important Links:
Go Back
