Data Replication Based on Common Interests in P2P Social Networks

This paper proposes SocialRank - a content replication protocol that can be used by services deployed in peer-to-peer networks. The proposed solution extends EasyRank replication protocol, by using the knowledge specific to social networks. For this purpose SocialRank includes in the ranking formula a parameter corresponding to the common interests of nodes taking part in the replication. Additionally, expanding the list of nodes that keep replicas was added, and the possibility of withdrawing replicas created during the incomplete replication procedure is provided. The proposed improvements have been a subject to simulation tests, which proved that SocialRank protocol increases the efficiency of the replication. The paper discusses in detail the results obtained during simulation tests, and compares the proposed solution and the EasyRank protocol.