{"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}
引用次数: 2
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
