This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
In this paper we develop a model for random walk-based search mechanisms in unstructured P2P networks. This model is used to obtain analytical expressions for the performance metr...
Despite the many research efforts invested recently in peerto-peer search engines, none of the proposed system has reached the level of quality and efficiency of their centralized...
Pascal Felber, Toan Luu, Martin Rajman, Etienne Ri...
A lot of recent work has dealt with improving performance of content searching in peer-to-peer file sharing systems. In this paper we attack this problem by modifying the overlay ...
Although Gnutella is the most popular Peer-to-Peer protocol for file sharing, drawbacks are often found in searching and locating files. They include that (1) a limited number of ...
— The success of a P2P file-sharing network highly depends on the scalability and versatility of its search mechanism. Two particularly desirable search features are scope (abil...
In this paper we show how imposing an organization (topology and search mechanism) on agents in a peerto-peer network can improve system performance. The organizational structure ...
Abstract—We propose a novel search mechanism for unstructured p2p networks, and show that it is both scalable, i.e., it leads to a bounded query traffic load per peer as the pee...