| P2P流媒体直播分布式缓存替换算法研究 |
| |
| 引用本文： | 李润知,郭纯一,范明.P2P流媒体直播分布式缓存替换算法研究[J].计算机工程与设计,2011,32(1):58-61,74. |
| |
| 作者姓名： | 李润知 郭纯一 范明 |
| |
| 作者单位： | 1. 郑州大学,信息工程学院,河南,郑州,450052;郑州大学,信息网络省重点学科开放实验室,河南,郑州,450052
2. 郑州大学,信息工程学院,河南,郑州,450052 |
| |
| 基金项目： | 国家863高技术研究发展计划基金项目(2008AA01A315) |
| |
| 摘 要： | P2P流媒体直播系统中分布式节点缓存区别于传统的Client/Server缓存结构,节点的实时同步给缓存管理提出较大挑战。分析了分布式缓存空间利用率的决定因素,通过节点成功请求比率,缓存的fresh度及数据分片点击率3个指标来评估节点缓存空间利用率,提出了频度限制与改进的LRU相结合的K-Degree&LRU2缓存替换算法。仿真实验结果表明,该算法较传统的FIFO、LRU算法具有更高的执行效率。
|
| 关 键 词： | P2P流媒体 数据驱动 缓存替换 分布式 成功请求比率 |
Research on P2P live streaming cache replacement |
| |
| LI Run-zhi,GUO Chun-yi,FAN Ming.Research on P2P live streaming cache replacement[J].Computer Engineering and Design,2011,32(1):58-61,74. |
| |
| Authors: | LI Run-zhi GUO Chun-yi FAN Ming |
| |
| Affiliation: | LI Run-zhi1,2,GUO Chun-yi1,FAN Ming1(1.College of Information Engineering,Zhengzhou University,Zhengzhou 450052,China,2.Key Lab of Information and Network,China) |
| |
| Abstract: | There are some difference between distributed cachingmodelwhich can be used in P2P live streaming and the traditional client/server cache structure.In P2P live streaming,it is difficult to resolve the peer's synchronization in real time.Three metrics are presented to analyse utilization of cache space,which include success request ratio,fresh degree and chunk hit ratio.A novel algorithm named K-Degree&LRU2 is designed.Through the results of simulation,it is indicated that the new algorithm bring higher effi... |
| |
| Keywords: | P2P streaming data-driven cache replacement distributed success request ratio |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
