ROUTIL: P2P routing protocol based on interest links

Abstract

The social media has changed our way of communication and sharing data in the Internet. They are based on the collaboration of the members to provide and exchange information. Their efficiency motivates researchers to design novel architectures based on the social behavior of the users. We study in this paper the combination of the social computing and the P2P systems. We propose ROUTIL: a P2P routing algorithm that enriches the DHT (Distributed Hashing Table) with social links. The idea of our algorithm is to link the users with similar interest in order to give a secure and performant service. Performance evaluations of the proposed solution show that results are globally satisfactory.