Loading...

Towards an efficient method for spreading information in social network

Ahmadi, H ; Sharif University of Technology | 2009

270 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/AMS.2009.107
  3. Publisher: 2009
  4. Abstract:
  5. 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. © 2009 IEEE
  6. Keywords:
  7. Bottleneck problem ; Content distribution ; Efficient method ; Gossip algorithms ; Low overhead ; New mechanisms ; Peer-to-peer information ; Social Networks ; Two phasis ; Problem solving
  8. Source: 2009 3rd Asia International Conference on Modelling and Simulation, AMS 2009, Bandung, Bali, 25 May 2009 through 26 May 2009 ; 2009 , Pages 152-157 ; 9780769536484 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/5071975