Multimedia contents dissemination with gossip algorithms in distributed social networks
Authors: 
Bo Yang, Guangxi Zhu, Weimin WuAuthors Info & Claims
Bo Yang, Guangxi Zhu, Weimin WuAuthors Info & ClaimsPages 178 - 182
Abstract
This paper studies the dissemination of multimedia contents in distributed social networks, which are composed of a set of smart handsets. Gossip algorithms are used to spread social multimedia contents in a decentralized way with robustness and simplicity. The performance of gossip algorithms is analyzed and an upper bound on the convergence time is obtained. Simulation results show that each user requires only about 12 iterations on average to obtain 100 contents in the network and the communication cost for each user does not grow when the scale of the network becomes larger. The dynamic topology of the network due to mobility is considered as well, which is proved to be able to significantly reduce the communication cost.
References
[1]
Matt Murphy and Mary Meeker. Top mobile internet trends. Technical report, KPCB, 2011.
[2]
Tian Yonghong, J. Srivastava, Huang Tiejun, and N. Contractor. Social multimedia computing. Computer, 43(8):27--36, 2010.
[3]
D. M Boyd and N. B Ellison. Social network sites: Definition, history, and scholarship. Journal of Computer-Mediated Communication, 13(1), 2007.
[4]
S. D. Roy, G. Lotan, and Zeng Wenjun. Social multimedia signals: Sense, process, and put them to work. MultiMedia, IEEE, 20(1):7--13, 2013.
[5]
Mary Meeker. Internet trends. Technical report, All Things D, 2012.
[6]
Morgan Stanley. Internet trends. Technical report, June 7 2010.
[7]
K. Doppler, M. Rinne, C. Wijting, C. B. Ribeiro, and K. Hugl. Device-to-device communication as an underlay to lte-advanced networks. Communications Magazine, IEEE, 47(12):42--49, 2009.
[8]
S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah. Randomized gossip algorithms. Information Theory, IEEE Transactions on, 52(6):2508--2530, 2006.
[9]
Shah Devavrat. Gossip Algorithms, volume 3 of Foundations and Trends in Networking. Now Publisher, Delft, 2009.
[10]
A. G. Dimakis, S. Kar, J. M. F. Moura, M. G. Rabbat, and A. Scaglione. Gossip algorithms for distributed signal processing. Proceedings of the IEEE, 98(11):1847--1864, 2010.
[11]
Xiang Zhe, Zhang Qian, Wenwu Zhu, Zhang Zhen-sheng, and Zhang Ya-Qin. Peer-to-peer based multimedia distribution service. Multimedia, IEEE Transactions on, 6(2):343--355, 2004.
[12]
K. C. J. Lin, Wang Chun-Po, Chou Cheng-Fu, and L. Golubchik. Socionet: A social-based multimedia access system for unstructured p2p networks. Parallel and Distributed Systems, IEEE Transactions on, 21(7):1027--1041, 2010.
[13]
H. Ahmadi, A. Mehrbakhsh, and E. Asgarian. Towards an efficient method for spreading information in social network. In Modelling and Simulation, 2009. AMS '09. Third Asia International Conference on, pages 152--157, 2009.
[14]
H. V. Zhao, W. S. Lin, and K. J. R. Liu. Behavior modeling and forensics for multimedia social networks. Signal Processing Magazine, IEEE, 26(1):118--139, 2009.
[15]
W. S. Lin, H. V. Zhao, and K. J. R. Liu. Game-theoretic strategies and equilibriums in multimedia fingerprinting social networks. Multimedia, IEEE Transactions on, 13(2):191--205, 2011.
[16]
A. Kovacevic, O. Heckmann, N. C. Liebau, and R. Steinmetz. Location awareness-improving distributed multimedia communication. Proceedings of the IEEE, 96(1):131--142, 2008.
[17]
A. D. Sarwate and A. G. Dimakis. The impact of mobility on gossip algorithms. Information Theory, IEEE Transactions on, 58(3):1731--1742, 2012.
Index Terms
- Multimedia contents dissemination with gossip algorithms in distributed social networks
Recommendations
Tracking freeriders in gossip-based content dissemination systems
Gossip-based protocols have proven very efficient for disseminating high-bandwidth content such as video streams in a peer-to-peer fashion. However, for the protocols to work, nodes are required to collaborate by devoting a fraction of their upload ...
On spreading recommendations via social gossip
SPAA '08: Proceedings of the twentieth annual symposium on Parallelism in algorithms and architecturesThis paper introduces and analyzes a variant of distributed gossip which is motivated by the sharing of recommendations in a social network. The social settings bear two implications on gossip. First, rumors fade after a few hops, and so does our gossip ...
Modeling gossip-based content dissemination and search in distributed networking
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and distributed networks. When using random gossiping, communication with ...
Comments
Information & Contributors
Information
Published In
August 2013
419 pages
ISBN:9781450322522
DOI:10.1145/2499788
- Conference Chair:
- Tat-Seng Chua,
- General Chairs:
- Ke Lu,
- Tao Mei,
- Xindong Wu
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- NSF of China: National Natural Science Foundation of China
- University of Sciences & Technology, Hefei: University of Sciences & Technology, Hefei
- Beijing ACM SIGMM Chapter
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 August 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
ICIMCS '13
Sponsor:
- NSF of China
- University of Sciences & Technology, Hefei
ICIMCS '13: International Conference on Internet Multimedia Computing and Service
August 17 - 19, 2013
Huangshan, China
Acceptance Rates
ICIMCS '13 Paper Acceptance Rate 20 of 94 submissions, 21%;
Overall Acceptance Rate 163 of 456 submissions, 36%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 100Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 10 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in