P2P缓存系统中总开销最小的协作缓存策略  

Cooperative caching scheme based on the minimization of total cost for P2P caches

作　　者：刘银龙[1] 汪敏[2] 马伟[1] 周旭[1] 胡亚辉[1] 

机构地区：[1]中国科学院信息工程研究所,北京100093 [2]北京城市学院信息学部,北京100083

出　　处：《通信学报》2015年第3期86-93,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(61303251;61102076);国家科技重大专项基金资助项目(2013ZX03002-001);中国科学院战略性先导科技专项基金资助项目(XDA06010302)~~

摘　　要：为降低P2P缓存系统中的全局开销,提出一种基于总开销最小的协作缓存策略。该策略综合考虑P2P缓存系统中的传输开销和存储开销,使用跨ISP域间链路开销、流行度、文件大小、存储开销来衡量文件的缓存增益。需要替换时,首先替换掉缓存增益最小的内容。实验结果表明,所提策略能够有效降低系统的总开销。To reduce the total cost of P2P cache system, a cooperative cache scheme based on the minimization of total cost is proposed. In the scheme, delivery cost and storage cost are taken into account, and inter-ISP cost, popularity, file size, storage cost are used to evaluate each object＇s caching gain value, which is a new concept defined to estimate the benefits of storing or replacing an object. When a replacement is needed, the objects with the minimum caching gain value will be evicted. Simulation results show that the proposed scheme can effectively reduce the total cost of P2P cache system

关 键 词：P2P缓存 协同缓存 总开销 缓存增益 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]