Unstructured peer-to-peer (P2P) file-sharing networks are popular in the mass market. As the peers participating in unstructured networks interconnect randomly, they rely on flooding query messages to discover objects of interest and thus introduce remarkable network traffic. Empirical measurement studies indicate that the peers in P2P networks have similar preferences, and have recently proposed unstructured P2P networks that organize participating peers by exploiting their similarity. The resultant networks may not perform searches efficiently and effectively because existing overlay topology construction algorithms often create unstructured P2P networks without performance guarantees.
Thus, we propose a novel overlay formation algorithm for unstructured P2P networks. Based on the file sharing pattern exhibiting the power-law property, our proposal is unique in that it poses rigorous performance guarantees. Theoretical performance results conclude that in a constant probability, 1) searching an object in our proposed network efficiently takes hops (where c is a small constant), and 2) the search progressively and effectively exploits the similarity of peers. In addition, the success ratio of discovering an object approximates 100 percent. We validate our theoretical analysis and compare our proposal to competing algorithms in simulations.
Based on the simulation results, our proposal clearly outperforms the competing algorithms in terms of 1) the hop count of routing a query message, 2) the successful ratio of resolving a query, 3) the number of messages required for resolving a query, and 4) the message overhead for maintaining and formatting the overlay.
Content distribution is a centralized one, where the content is distributed from the centralized server to all clients requesting the document. Clients send request to the centralized server for downloading the file. Server accepts the request and sends the file as response to the request. In most client-server setups; the server is a dedicated computer whose entire purpose is to distribute files.
Investigating in the file-sharing preference of users and correlation between different resources categories in a real peer-to-peer network.
Analytic methods from complex networks theory to investigate the File sharing.
Relation between the users and the resources could be described by a bipartite sharing graph, with one subset for the users and the other for the resources.
Using weighted user network, users built connections based on their sharing interests to similar resources, and different resources are correlated together due to many users’ sharing behaviors, with weighted edges indicating their interaction strengths.
- Peer login