Towards an efficient method for spreading information in social network

Proceedings - 2009 3rd Asia International Conference on Modelling and Simulation, AMS 2009

Volumn , Issue , 2009, Pages 152-157

  Ahmadi, Hamed ^a   Mehrbakhsh, Arman ^b   Asgarian, Ehsan ^c  

^a ISLAMIC AZAD UNIVERSITY   (Iran)

^b ISLAMIC AZAD UNIVERSITY   (Iran)

^c SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTLENECK PROBLEM; CONTENT DISTRIBUTION; EFFICIENT METHOD; GOSSIP ALGORITHMS; LOW OVERHEAD; NEW MECHANISMS; PEER-TO-PEER INFORMATION; SOCIAL NETWORKS; TWO PHASIS;

PROBLEM SOLVING;

EID: 70349743732     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AMS.2009.107     Document Type: Conference Paper

References (27)

1. M. Ge, S.V. Krishnamurthy, M. Faloutsos, "Application versus Network Layer Multicasting in Ad Hoc Networks: The ALMA Routing Protocol", Ad Hoc Networks Journal (Elsevier), Vol. 4, No. 2, 2006, pp 283-300.
2. A. Klemm, C. Lindemann, O. P. Waldhorst, "A Special-Purpose Peerto-Peer File Sharing System for Mobile Ad Hoc Networks", in proceedings of IEEE VTC-Fall, 2003.
3. Y. Fernandess, D. Malkhi, "On Collaborative Content Distribution Using Multi-Message Gossip", Journal of Parallel and Distributed Computing (JPDC), May, 2007.
4. S.A.N. Theotokis, D. Spinellis, "A Survey of Peer-to-Peer Content Distribution Technologies", ACM Computing Surveys, Vol. 36, No. 4, December 2004, pp. 335-371.
5. V. Simon, L. Bacsďi, E. Varga, T. Csvǐcs, M. Bčes, S. Szab "Overhead Reducing Information Dissemination Strategies for Opportunistic Communications",
6. P. Krishnamurthy, "Information Dissemination and Information Assurance in Vehicular Networks: A Survey", iSchool08, Los Angeles, February 2008, http://www.ischools.org/oc/conference08/ic08-P C-Papers.html.
7. S. Boyd, A. Ghosh, B. Prabhakar, D. Shah, "Gossip Algorithms: Design, Analysis and Applications", in Proceedings of IEEE Infocom, ISBN: 0-7803-8968-9, 2005.
8. J. Liang, R. Kumar, K.W. Ross. (2004, May), Understanding KaZaA. Working Paper, Polytechnic University, New York. [Online]. Available: http://cis.poly.edu/̃ross/papers/ Understanding KaZaA.pdf.
9. C. Wu, B. Li, Optimal Rate Allocation in Overlay Content Distribution, in Proc. of IFIP Networking 2007, Atlanta, Georgia, May, 2007.
10. th International Symposium on DIStributed Computing, 2001.
11. th ACM Symposium on Principles of Distributed Computing, pp. 1-12, 1987.
12. L. Alvisi, J. Doumen, R. Guerraoui, B. Koldehofe, H.C. Li, R. van Renesse, G. Trédan, "How robust are gossip-based communication protocols?", Operating Systems Review, Vol. 41 No. 5, 2007, pp. 14-18.
13. M.B. Abbott, L.L. Peterson, "A language-based approach to protocol implementation", IEEE/ACM Transactions on Networking, Vol. 1, No. 1, February 1993, pp. 4-19.
14. st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, pp. 85-92. Co-located with ACM MobiHoc, Hong Kong, China, 2008.
15. Bittorrent protocol, http://wiki.theory.org/BitTorrentSpecification.
16. L. Scully, Network File Distribution with the BitTorrent Protocol, In proceedings of the 7th Winona Computer Science Undergraduate Research Seminar, Winona, MN, US, April 19, 2007.
17. Y. Kulbak, D. Bickson, The emule protocol specification, Technical Report Leibniz Center TR-2005-03, School of Computer Science and Engineering, The Hebrew University, 2005.
18. th ACM Symposium on Operating Systems Principles (SOSP), 2003.
19. X. Zhang, J. Liu, B. Li, T.P. Yum, CoolStreaming/DONet: A Data-Driven Overlay Network for Live Media Streaming, In: Proc. of IEEE INFOCOM, 2005.
20. Y.M. Minsky, F. B. Schneider, Tolerating Malicious Gossip, Distributed Computing, Vol.16, No.1, pp.49-68, 2003.
21. th Annual Hawaii International Conference on System Sciences, Vol. 7, page 188, Washington, DC, USA, 2002. IEEE Computer Society.
22. P. Resnick, K. Kuwabara, R. Zeckhauser, E. Friedman, Reputation Systems, Commun. ACM, Vol. 43, No.12, pp. 45-48, 2000.
23. J. R. Douceur, The Sybil Attack, In IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pp. 251- 260, London, UK, 2002.
24. Y. Fernandess, D. Malkhi, On Spreading Recommendations via Social Gossip, In Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, June 14 - 16, 2008.
25. D. Kempe, A. Dobra, J. Gehrke, Efficient gossip-based aggregate computation, In PODS'06, June 26-28, Chicago, Illinois, USA, 2006.
26. K.P. Birman, M. Hayden, Z. Xiao, O. Ozkasap, M. Budio, Y. Minsky, Bimodal multicast, ACM Transactions on Computer Systems, Vol. 17, No. 2, pp. 41-88, 1999.
27. th IEEE FOCS, pp. 482-491, 2003.