Load-balanced migration of social media to content clouds

Load-balanced migration of social media to content clouds
复制标题

DOI:
10.1145/1989240.1989254
复制
发表时间:
2011-06
期刊:
Proceedings of the 21st international workshop on Network and operating systems support for digital audio and video
影响因子:
--
通讯作者:
Xu Cheng;Jiangchuan Liu
Xu Cheng;Jiangchuan Liu
中科院分区:
其他
文献类型:
--
作者:
Xu Cheng;Jiangchuan Liu

文献摘要

被引文献

相似文献

社交网络应用越来越流行,给网络工程带来了巨大的挑战,特别是社交媒体对带宽和存储的巨大需求。最近出现的内容云揭示了这一困境。对于向云的迁移,划分社会内容已经从文献中引起了极大的兴趣。然而,现有的工作集中在保持社会关系,而一个重要的因素,用户访问模式,在很大程度上被忽视。在本文中,通过研究大量的YouTube视频数据,我们首先证明了完全基于社会关系划分网络会导致访问方面的不平衡分区。进一步分析了社会关系在社会化媒体应用中的作用,认为在社会化媒体应用中应考虑用户的访问模式,动态地保持社会关系。我们制定的问题作为一个受约束的k-medoids聚类问题,并提出了一种新的加权分割围绕Medoids(wPAM)的解决方案。我们提出了一个相异性/相似性度量,以促进社会关系的保存。我们将我们的解决方案与其他最先进的算法进行了比较,初步结果表明,它显着降低了访问偏差在每个云服务器,并灵活地保持社会关系。
Social networked applications have been more and more popular, and have brought great challenges to the network engineering, particularly the huge demands of bandwidth and storage for social media. The recently emerged content clouds shed light on this dilemma. Towards the migration to clouds, partitioning the social contents has drawn significant interests from the literature. Yet the existing works focus on preserving the social relationship only, while an important factor, user access pattern, is largely overlooked. In this paper, by examining a large collection of YouTube video data, we first demonstrate that partitioning the network entirely based on social relationship would lead to unbalanced partitions in terms of access. We further analyze the role of social relationship in the social media applications, and conclude that user access pattern should be taken into account and social relationship should be dynamically preserved. We formulate the problem as a constrained k-medoids clustering problem, and propose a novel Weighted Partitioning Around Medoids (wPAM) solution. We present a dissimilarity/similarity metric to facilitate the preservation of the social relationship. We compare our solution with other state-of-the-art algorithms, and the preliminary results show that it significantly decreases the access deviation in each cloud server, and flexibly preserves the social relationship.