视频点播业务缓存替换方案的优化

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing Pub Date : 2013-12-21 DOI:10.1109/DASC.2013.61

Xiaocui Sun, Zhijun Wang

{"title":"视频点播业务缓存替换方案的优化","authors":"Xiaocui Sun, Zhijun Wang","doi":"10.1109/DASC.2013.61","DOIUrl":null,"url":null,"abstract":"Video caching has gained significant attention due to its cost efficiency. In this paper, we propose an optimized cache replacement scheme based on the user request arrival pattern. The users are grouped among all possible request intervals, and the user density is calculated in each interval. The groups with highest user density are cached. Whenever a group with high user density arrives, the groups with lower density will be replaced. The simulation results show that the proposed schemes can double the hit ratio compared with the Least recently Used (LRU) scheme.","PeriodicalId":179557,"journal":{"name":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimized Cache Replacement Scheme for Video on Demand Service\",\"authors\":\"Xiaocui Sun, Zhijun Wang\",\"doi\":\"10.1109/DASC.2013.61\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Video caching has gained significant attention due to its cost efficiency. In this paper, we propose an optimized cache replacement scheme based on the user request arrival pattern. The users are grouped among all possible request intervals, and the user density is calculated in each interval. The groups with highest user density are cached. Whenever a group with high user density arrives, the groups with lower density will be replaced. The simulation results show that the proposed schemes can double the hit ratio compared with the Least recently Used (LRU) scheme.\",\"PeriodicalId\":179557,\"journal\":{\"name\":\"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DASC.2013.61\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DASC.2013.61","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

视频缓存由于其成本效率而获得了极大的关注。本文提出了一种基于用户请求到达模式的优化缓存替换方案。将用户分组到所有可能的请求间隔中，并在每个间隔中计算用户密度。具有最高用户密度的组被缓存。每当一个用户密度高的群体到来，密度低的群体就会被取代。仿真结果表明，与LRU (Least recently Used)算法相比，该算法的命中率提高了一倍。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Optimized Cache Replacement Scheme for Video on Demand Service

Video caching has gained significant attention due to its cost efficiency. In this paper, we propose an optimized cache replacement scheme based on the user request arrival pattern. The users are grouped among all possible request intervals, and the user density is calculated in each interval. The groups with highest user density are cached. Whenever a group with high user density arrives, the groups with lower density will be replaced. The simulation results show that the proposed schemes can double the hit ratio compared with the Least recently Used (LRU) scheme.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 IEEE 11th International Conference on Dependable, Autonomic and Secure Computing

自引率

0.00%

发文量