IPTV网络的u型转弯缓存优化

L. Sofman, B. Krogfoss, A. Agrawal
{"title":"IPTV网络的u型转弯缓存优化","authors":"L. Sofman, B. Krogfoss, A. Agrawal","doi":"10.1109/SARNOF.2009.4850338","DOIUrl":null,"url":null,"abstract":"In an IPTV network, a large amount of unicast traffic from the Video Head Office (VHO) to subscribers requires significant BW and equipment resources in the network. Caching of video content allows reduction of bandwidth and IPTV network cost. In this paper, we consider a caching architecture in which part of the content is cached at the edge of the network (e.g., at DSLAMs), and the remaining part is stored in server(s) at the VHO. We assume that the community of subscribers subtended at each cache location (DSLAM) may have unique interests. Therefore, the list of cached items is customized for each cache location (e.g., individual DSLAM), and different cache locations should store different content. We consider U-turn caching where titles cached at a given DSLAM may serve the requests of subscribers that are subtended not only at this DSLAM but also from those subtended at neighboring DSLAMs. We discuss how the U-turn caching architecture allows increased cache effectiveness (hit rate) by sharing cache resources in the access nodes (DSLAMs).","PeriodicalId":230233,"journal":{"name":"2009 IEEE Sarnoff Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-03-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"U-turn caching optimization in IPTV networks\",\"authors\":\"L. Sofman, B. Krogfoss, A. Agrawal\",\"doi\":\"10.1109/SARNOF.2009.4850338\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In an IPTV network, a large amount of unicast traffic from the Video Head Office (VHO) to subscribers requires significant BW and equipment resources in the network. Caching of video content allows reduction of bandwidth and IPTV network cost. In this paper, we consider a caching architecture in which part of the content is cached at the edge of the network (e.g., at DSLAMs), and the remaining part is stored in server(s) at the VHO. We assume that the community of subscribers subtended at each cache location (DSLAM) may have unique interests. Therefore, the list of cached items is customized for each cache location (e.g., individual DSLAM), and different cache locations should store different content. We consider U-turn caching where titles cached at a given DSLAM may serve the requests of subscribers that are subtended not only at this DSLAM but also from those subtended at neighboring DSLAMs. We discuss how the U-turn caching architecture allows increased cache effectiveness (hit rate) by sharing cache resources in the access nodes (DSLAMs).\",\"PeriodicalId\":230233,\"journal\":{\"name\":\"2009 IEEE Sarnoff Symposium\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-03-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IEEE Sarnoff Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SARNOF.2009.4850338\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE Sarnoff Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SARNOF.2009.4850338","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在IPTV网络中,从视频总部(VHO)到用户的大量单播流量需要占用大量的网络带宽和设备资源。视频内容的缓存可以减少带宽和IPTV网络成本。在本文中,我们考虑了一种缓存架构,其中部分内容缓存在网络边缘(例如,在dslam),其余部分存储在VHO的服务器中。我们假设在每个缓存位置(DSLAM)的订阅社区可能有唯一的兴趣。因此,缓存项的列表是为每个缓存位置(例如,单个DSLAM)定制的,并且不同的缓存位置应该存储不同的内容。我们考虑u型转弯缓存,其中缓存在给定DSLAM上的标题可能服务于订阅用户的请求,这些订阅用户不仅在此DSLAM上被订阅,而且在相邻DSLAM上也被订阅。我们将讨论U-turn缓存架构如何通过在访问节点(dslam)中共享缓存资源来提高缓存效率(命中率)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
U-turn caching optimization in IPTV networks
In an IPTV network, a large amount of unicast traffic from the Video Head Office (VHO) to subscribers requires significant BW and equipment resources in the network. Caching of video content allows reduction of bandwidth and IPTV network cost. In this paper, we consider a caching architecture in which part of the content is cached at the edge of the network (e.g., at DSLAMs), and the remaining part is stored in server(s) at the VHO. We assume that the community of subscribers subtended at each cache location (DSLAM) may have unique interests. Therefore, the list of cached items is customized for each cache location (e.g., individual DSLAM), and different cache locations should store different content. We consider U-turn caching where titles cached at a given DSLAM may serve the requests of subscribers that are subtended not only at this DSLAM but also from those subtended at neighboring DSLAMs. We discuss how the U-turn caching architecture allows increased cache effectiveness (hit rate) by sharing cache resources in the access nodes (DSLAMs).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MIMO NLMS-ZF data detection approach for WCDMA based HSDPA systems LASA: Low-energy adaptive slot allocation scheduling algorithm for wireless sensor networks A wavelet-based method for classification of binary digitally modulated signals Nonlinearity estimation for Specific Emitter Identification in multipath environment A dynamic intrusion detection hierarchy for MANETs
×
引用
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