Towards an Efficient Method for Spreading Information in Social Network
Hamed Ahmadi, Arman Mehrbakhsh, Ehsan Asgarian · 2009
Nowadays, content distribution is of high attention in peer to peer information systems. There are two main problems that could be mentioned in this context. The first problem is how to disseminate fragments of information efficiently and the next is to avoid missing same rare fragments towards end of download. For overcoming these problems, a new mechanism is presented in this paper which uses gossip algorithms on basis of social networks. Our mechanism maintains simplicity of gossip and has low overhead. This mechanism includes two phases for managing traffic and solving bottleneck problem: one for spreading rumors inside the social network and finding network of interests and the other for collecting messages in the network of interests with consideration of a threshold of independent paths.