Popularity Awareness in Temporal-DHT for P2P-based Media Streaming Applications

Abhishek Bhattacharya, Zhenyu Yang, Deng Pan
{"title":"Popularity Awareness in Temporal-DHT for P2P-based Media Streaming Applications","authors":"Abhishek Bhattacharya, Zhenyu Yang, Deng Pan","doi":"10.1109/ISM.2011.46","DOIUrl":null,"url":null,"abstract":"Application-layer overlay networks are receiving considerable popularity due to its flexibility and readily deployable nature thereby providing support for a plethora of Peer-to-Peer (P2P) applications. Currently, the real-world deployment of Internet-scale P2P media streaming systems involve the usage of tracker server for content discovery in on-demand model with asynchronous interactivity. The inherent drawbacks of tracker-server based approach are obvious due to scalability and bottleneck issues, which prompted us to pursue a structured P2P based proposition such as Distributed Hash Tables (DHT) which are already proved to be stable substrates. The challenging issue of accommodating a large number of update operations with the continuous change of user's playing position in DHT-based overlay is addressed in our previous work by the concept of Temporal-DHT which exploits the temporal dynamics of the content to estimate playing position. In this paper, we incorporate the notion of popularity awareness in the Temporal-DHT framework which will help to adapt the query resolution mechanism by addressing the skew ness of content popularity typically found in real multimedia user access patterns. The essential objective of popularity awareness mechanism is to increase the overall performance of Temporal-DHT by optimizing the search cost among the entire content set within the system. We formulate the problem and provide practical solutions with extensive simulation results that demonstrates the effectiveness of popularity-aware Temporal-DHT by achieving optimized query resolution cost and high streaming quality for on-demand systems in a dynamic network environment where user's are free to asynchronously join/leave the system.","PeriodicalId":339410,"journal":{"name":"2011 IEEE International Symposium on Multimedia","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Symposium on Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISM.2011.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Application-layer overlay networks are receiving considerable popularity due to its flexibility and readily deployable nature thereby providing support for a plethora of Peer-to-Peer (P2P) applications. Currently, the real-world deployment of Internet-scale P2P media streaming systems involve the usage of tracker server for content discovery in on-demand model with asynchronous interactivity. The inherent drawbacks of tracker-server based approach are obvious due to scalability and bottleneck issues, which prompted us to pursue a structured P2P based proposition such as Distributed Hash Tables (DHT) which are already proved to be stable substrates. The challenging issue of accommodating a large number of update operations with the continuous change of user's playing position in DHT-based overlay is addressed in our previous work by the concept of Temporal-DHT which exploits the temporal dynamics of the content to estimate playing position. In this paper, we incorporate the notion of popularity awareness in the Temporal-DHT framework which will help to adapt the query resolution mechanism by addressing the skew ness of content popularity typically found in real multimedia user access patterns. The essential objective of popularity awareness mechanism is to increase the overall performance of Temporal-DHT by optimizing the search cost among the entire content set within the system. We formulate the problem and provide practical solutions with extensive simulation results that demonstrates the effectiveness of popularity-aware Temporal-DHT by achieving optimized query resolution cost and high streaming quality for on-demand systems in a dynamic network environment where user's are free to asynchronously join/leave the system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于p2p的媒体流应用的时间dht的流行意识
应用层覆盖网络由于其灵活性和易于部署的特性,从而为大量的点对点(P2P)应用程序提供支持,正受到相当大的欢迎。目前,互联网规模的P2P流媒体系统的实际部署涉及到在按需模式下使用跟踪服务器进行内容发现,具有异步交互性。由于可扩展性和瓶颈问题,基于跟踪器服务器的方法的固有缺点是显而易见的,这促使我们追求结构化的基于P2P的命题,如分布式哈希表(DHT),这已经被证明是稳定的基础。在基于dht的覆盖中,由于用户的游戏位置不断变化而容纳大量更新操作的挑战性问题在我们之前的工作中通过利用内容的时间动态来估计游戏位置的temporal - dht概念得到了解决。在本文中,我们在Temporal-DHT框架中加入了流行度意识的概念,这将有助于通过解决真实多媒体用户访问模式中常见的内容流行度偏差来调整查询解析机制。人气感知机制的本质目标是通过优化系统内整个内容集的搜索成本来提高Temporal-DHT的整体性能。在用户可以自由异步加入/离开系统的动态网络环境中,通过优化查询解析成本和高流质量,我们阐述了问题并提供了实用的解决方案,并提供了广泛的仿真结果,证明了流行感知的time - dht的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Subjective Evaluation of 3D Iptv Broadcasting Implementations Considering Coding and Transmission Degradation A Low Memory Requirements Execution Flow for the Non-Uniform Grid Projection Super-Resolution Algorithm 3D Image Browsing on Mobile Devices Hybrid Video Compression Using Selective Keyframe Identification and Patch-Based Super-Resolution Automatic Bird Species Identification for Large Number of Species
×
引用
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