An efficient technique for video content managing in peer-to-peer computing using multilevel cache and bandwidth based cluster

M. Narayanan, C. Arun
{"title":"An efficient technique for video content managing in peer-to-peer computing using multilevel cache and bandwidth based cluster","authors":"M. Narayanan, C. Arun","doi":"10.1109/ICSPCT.2014.6884982","DOIUrl":null,"url":null,"abstract":"The Peer-to-Peer (P2P) computing is one of the rapidly growing technology, because day by day people needs and expectations are extending beyond boundaries. This P2P technology is started from file sharing, video streaming and P2P computing. Basically in this P2P computing, those who are in on-line all will act likes as a server or client. If they are having data segments then it will act as server otherwise clients. Generally the data segments are preserving at the peers in different levels such as hard cache and soft cache. Based on the popularity the video contents can be downloaded. Normally the most popular data segments are placed on the cache which is downloaded either from video server of from neighboring peers. There are so many of cache replacement algorithms have been introduced to replace the old data segments with newly arrived data segments. While arriving new data segments the old data segments removed from the queue i.e. cache, so the availability of the data content is presented very low. To overcome this problem multilevel cache is protecting the old segments in order to increase the speed. Generally P2P system the request will go at the neighbouring peer that particular neighbouring peer having is less connectivity then the client can receive the data segments slowly. Therefore overcoming this category of connectivity problem, we recommended bandwidth based cluster. After client registration, the video server build cluster based on bandwidth size. Once the request from client / server received immediately the video server finds highest bandwidth and LFU peer in their cluster and then service is redirected.","PeriodicalId":419263,"journal":{"name":"2013 International Conference on Human Computer Interactions (ICHCI)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Human Computer Interactions (ICHCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSPCT.2014.6884982","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The Peer-to-Peer (P2P) computing is one of the rapidly growing technology, because day by day people needs and expectations are extending beyond boundaries. This P2P technology is started from file sharing, video streaming and P2P computing. Basically in this P2P computing, those who are in on-line all will act likes as a server or client. If they are having data segments then it will act as server otherwise clients. Generally the data segments are preserving at the peers in different levels such as hard cache and soft cache. Based on the popularity the video contents can be downloaded. Normally the most popular data segments are placed on the cache which is downloaded either from video server of from neighboring peers. There are so many of cache replacement algorithms have been introduced to replace the old data segments with newly arrived data segments. While arriving new data segments the old data segments removed from the queue i.e. cache, so the availability of the data content is presented very low. To overcome this problem multilevel cache is protecting the old segments in order to increase the speed. Generally P2P system the request will go at the neighbouring peer that particular neighbouring peer having is less connectivity then the client can receive the data segments slowly. Therefore overcoming this category of connectivity problem, we recommended bandwidth based cluster. After client registration, the video server build cluster based on bandwidth size. Once the request from client / server received immediately the video server finds highest bandwidth and LFU peer in their cluster and then service is redirected.
基于多级缓存和基于带宽集群的点对点计算视频内容管理技术
点对点(P2P)计算是一种快速发展的技术,因为人们的需求和期望日益超越界限。这种P2P技术是从文件共享、视频流和P2P计算开始的。基本上,在这种P2P计算中,那些在线的人都将扮演服务器或客户端的角色。如果它们有数据段,那么它将充当服务器,否则充当客户端。一般情况下,数据段在对等体上以不同的级别保存,如硬缓存和软缓存。根据受欢迎程度,视频内容可以下载。通常,最流行的数据段放在缓存中,缓存要么从视频服务器下载,要么从相邻的对等端下载。为了将旧的数据段替换为新到达的数据段,已经引入了很多缓存替换算法。当到达新的数据段时,旧的数据段从队列中删除,即缓存,因此数据内容的可用性很低。为了克服这个问题,多级缓存通过保护旧段来提高速度。一般P2P系统的请求将发送到相邻的点,特定的相邻点具有较少的连通性,因此客户端可以缓慢地接收数据段。因此,为了克服这类连接问题,我们建议使用基于带宽的集群。客户端注册后,视频服务器根据带宽大小构建集群。一旦收到来自客户端/服务器的请求,视频服务器立即在其集群中找到最高带宽和LFU对等点,然后服务被重定向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信