Social VoD: A Social Feature-Based P2P System

Wei Chang, Jie Wu
{"title":"Social VoD: A Social Feature-Based P2P System","authors":"Wei Chang, Jie Wu","doi":"10.1109/ICPP.2015.66","DOIUrl":null,"url":null,"abstract":"Video-on-demand (VoD) service has been explosively growing since its first appearance. For maintaining an acceptable buffering delay, the bandwidth costs have become a huge burden for the service providers. Complementing the conventional client-server architecture with a peer-to-peer system(P2P) can significantly reduce the central server's bandwidth demands. However, the previous works focus on establishing a P2P overlay for each video, producing a high maintenance cost on users. Per-channel-based overlay construction was first introduced by Social Tube, which clusters the users subscribed to the same video channels into one P2P overlay. However, the current per-channel overlay structure is not suitable for users developing new watching preferences. Consider that a channel's subscribers tend to watch not only the videos from the channel, but also other videos from similar channels. In this paper, we propose a new overlay structure by exploring the existing social relations of users and the similarities of video channels. Our system creates a hierarchical overlay: subscribers of the same channel form the low-level overlay (also known as groups), and in high-level overlay, different groups are connected based on their similarities. The new structure has the small-world property, the existence of which has been found in most data-sharing patterns. Based on the new structure, we propose a routing algorithm for both channel subscribed and unsubscribed users. Extensive simulation results show the efficiency of our approach.","PeriodicalId":423007,"journal":{"name":"2015 44th International Conference on Parallel Processing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 44th International Conference on Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.2015.66","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Video-on-demand (VoD) service has been explosively growing since its first appearance. For maintaining an acceptable buffering delay, the bandwidth costs have become a huge burden for the service providers. Complementing the conventional client-server architecture with a peer-to-peer system(P2P) can significantly reduce the central server's bandwidth demands. However, the previous works focus on establishing a P2P overlay for each video, producing a high maintenance cost on users. Per-channel-based overlay construction was first introduced by Social Tube, which clusters the users subscribed to the same video channels into one P2P overlay. However, the current per-channel overlay structure is not suitable for users developing new watching preferences. Consider that a channel's subscribers tend to watch not only the videos from the channel, but also other videos from similar channels. In this paper, we propose a new overlay structure by exploring the existing social relations of users and the similarities of video channels. Our system creates a hierarchical overlay: subscribers of the same channel form the low-level overlay (also known as groups), and in high-level overlay, different groups are connected based on their similarities. The new structure has the small-world property, the existence of which has been found in most data-sharing patterns. Based on the new structure, we propose a routing algorithm for both channel subscribed and unsubscribed users. Extensive simulation results show the efficiency of our approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
社交点播:基于社交特性的P2P系统
视频点播(VoD)服务自问世以来一直呈爆炸式增长。为了保持可接受的缓冲延迟,带宽成本已经成为服务提供商的巨大负担。用点对点系统(P2P)补充传统的客户机-服务器体系结构可以显著减少中央服务器的带宽需求。然而,以往的工作主要是为每个视频建立一个P2P覆盖,对用户产生了很高的维护成本。基于每个频道的覆盖结构最早是由Social Tube引入的,它将订阅相同视频频道的用户聚类到一个P2P覆盖中。然而,目前的每频道覆盖结构不适合用户发展新的观看偏好。考虑到一个频道的订阅者不仅倾向于观看来自该频道的视频,还倾向于观看来自类似频道的其他视频。在本文中,我们通过探索用户现有的社会关系和视频频道的相似性,提出了一种新的覆盖结构。我们的系统创建了一个分层覆盖:同一频道的订阅者形成低级覆盖(也称为组),在高级覆盖中,不同的组根据它们的相似性连接在一起。这种新结构具有小世界特性,这种特性在大多数数据共享模式中都存在。在此基础上,提出了一种针对信道订阅用户和非订阅用户的路由算法。大量的仿真结果表明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Elastic and Efficient Virtual Network Provisioning for Cloud-Based Multi-tier Applications Design and Implementation of a Highly Efficient DGEMM for 64-Bit ARMv8 Multi-core Processors Leveraging Error Compensation to Minimize Time Deviation in Parallel Multi-core Simulations Crowdsourcing Sensing Workloads of Heterogeneous Tasks: A Distributed Fairness-Aware Approach TAPS: Software Defined Task-Level Deadline-Aware Preemptive Flow Scheduling in Data Centers
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1