PSC:一种优先级选择缓存算法,用于互联网上的流媒体视频

Shin-Hung Chang, R. Chang, Jan-Ming Ho, Yen-Jen Oyang
{"title":"PSC:一种优先级选择缓存算法,用于互联网上的流媒体视频","authors":"Shin-Hung Chang, R. Chang, Jan-Ming Ho, Yen-Jen Oyang","doi":"10.1109/ICON.2003.1266189","DOIUrl":null,"url":null,"abstract":"Proxy technology is commonly used at boundaries of ISPs (Internet service providers) to reduce the bandwidth requirement in the backbone WAN. By caching portions of a video in a video proxy closed to clients, the video playback quality can be dramatically improved and the problem of insufficient WAN bandwidth is eliminated. In the loss-less network environment, the OC (optimal cache) algorithm uses minimum cache storage in the video proxy and reduces the maximum bandwidth required in the backbone WAN. However, data packets may be lost to affect video playback quality while streaming video data through the Internet. Consider an MPEG video in which an I-frame is referenced by all other frames (B- or P-frames) in the same GOP (group of picture). Losing packets belonging to an I-frame makes it difficult to decode all of subsequent frames retrieved from the same GOP. The major goal of this paper is to select maximum video data from high-priority frames (I-frames) caching in the video proxy in order to defeat decoding error caused by packet loss and improve error recovery while serving QoS-guaranteed video playback. We propose a novel PSC (priority selected cache) algorithm for solving this cache data selection problem. The PSC algorithm uses minimum cache storage in the video proxy and reduces maximum bandwidth requirement in the backbone WAN (as does the OC algorithm). Additionally, experiment results with several benchmark videos show that the PSC algorithm is 15% better than the conventional OC algorithm at caching I-frame data in a video proxy.","PeriodicalId":122389,"journal":{"name":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"PSC: a priority selected cache algorithm for streaming video over Internet\",\"authors\":\"Shin-Hung Chang, R. Chang, Jan-Ming Ho, Yen-Jen Oyang\",\"doi\":\"10.1109/ICON.2003.1266189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Proxy technology is commonly used at boundaries of ISPs (Internet service providers) to reduce the bandwidth requirement in the backbone WAN. By caching portions of a video in a video proxy closed to clients, the video playback quality can be dramatically improved and the problem of insufficient WAN bandwidth is eliminated. In the loss-less network environment, the OC (optimal cache) algorithm uses minimum cache storage in the video proxy and reduces the maximum bandwidth required in the backbone WAN. However, data packets may be lost to affect video playback quality while streaming video data through the Internet. Consider an MPEG video in which an I-frame is referenced by all other frames (B- or P-frames) in the same GOP (group of picture). Losing packets belonging to an I-frame makes it difficult to decode all of subsequent frames retrieved from the same GOP. The major goal of this paper is to select maximum video data from high-priority frames (I-frames) caching in the video proxy in order to defeat decoding error caused by packet loss and improve error recovery while serving QoS-guaranteed video playback. We propose a novel PSC (priority selected cache) algorithm for solving this cache data selection problem. The PSC algorithm uses minimum cache storage in the video proxy and reduces maximum bandwidth requirement in the backbone WAN (as does the OC algorithm). Additionally, experiment results with several benchmark videos show that the PSC algorithm is 15% better than the conventional OC algorithm at caching I-frame data in a video proxy.\",\"PeriodicalId\":122389,\"journal\":{\"name\":\"The 11th IEEE International Conference on Networks, 2003. ICON2003.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 11th IEEE International Conference on Networks, 2003. ICON2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2003.1266189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 11th IEEE International Conference on Networks, 2003. ICON2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2003.1266189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

代理技术通常用于isp (Internet服务提供商)的边界,以减少骨干广域网的带宽需求。通过在对客户端关闭的视频代理中缓存视频的部分内容,可以显著提高视频播放质量,并消除WAN带宽不足的问题。在无损耗网络环境下,OC(最优缓存)算法在视频代理中使用最小的缓存存储,减少了骨干网所需的最大带宽。但是,在通过Internet传输视频数据时,可能会丢失数据包,影响视频播放质量。考虑一个MPEG视频,其中i帧由同一GOP(图片组)中的所有其他帧(B帧或p帧)引用。丢失属于i帧的数据包使得从同一GOP检索到的所有后续帧的解码变得困难。本文的主要目标是从视频代理中的高优先级帧(i帧)缓存中选择最大的视频数据,以克服丢包导致的解码错误,提高错误恢复,同时提供qos保证的视频播放。我们提出了一种新的PSC(优先选择缓存)算法来解决这个缓存数据选择问题。PSC算法在视频代理中使用最小的缓存存储,并减少骨干WAN中的最大带宽需求(OC算法也是如此)。此外,几个基准视频的实验结果表明,PSC算法在视频代理中缓存i帧数据时比传统的OC算法好15%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PSC: a priority selected cache algorithm for streaming video over Internet
Proxy technology is commonly used at boundaries of ISPs (Internet service providers) to reduce the bandwidth requirement in the backbone WAN. By caching portions of a video in a video proxy closed to clients, the video playback quality can be dramatically improved and the problem of insufficient WAN bandwidth is eliminated. In the loss-less network environment, the OC (optimal cache) algorithm uses minimum cache storage in the video proxy and reduces the maximum bandwidth required in the backbone WAN. However, data packets may be lost to affect video playback quality while streaming video data through the Internet. Consider an MPEG video in which an I-frame is referenced by all other frames (B- or P-frames) in the same GOP (group of picture). Losing packets belonging to an I-frame makes it difficult to decode all of subsequent frames retrieved from the same GOP. The major goal of this paper is to select maximum video data from high-priority frames (I-frames) caching in the video proxy in order to defeat decoding error caused by packet loss and improve error recovery while serving QoS-guaranteed video playback. We propose a novel PSC (priority selected cache) algorithm for solving this cache data selection problem. The PSC algorithm uses minimum cache storage in the video proxy and reduces maximum bandwidth requirement in the backbone WAN (as does the OC algorithm). Additionally, experiment results with several benchmark videos show that the PSC algorithm is 15% better than the conventional OC algorithm at caching I-frame data in a video proxy.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信