检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中原工学院,郑州450007 [2]河南职业技术学院 [3]郑州市劳动和社会保障数据管理中心,郑州450006
出 处:《中原工学院学报》2010年第4期62-64,69,共4页Journal of Zhongyuan University of Technology
摘 要:对网络中流媒体对象的用户访问行为进行了建模分析,根据相对流行度对缓存中的对象进行排序,同时结合指数分段算法,提出了基于相对流行度的流媒体分段缓存算法(RP-S),并使用真实日志记录进行仿真.仿真实验结果表明,与传统流媒体缓存算法相比,该算法具有较高的字节命中率,同时在一定程度上减少了网络延迟.Analysis of Internet user accessing of streaming media are presented in this paper at first.Streaming media object shows larger size,static content and high accessing probability on Prefix Segment and that is different from Web object.Relative Popularity(RP) is employed in this paper based on the user accessing of streaming media,and objects are ordered by Relative Popularity in the cache.Integrating with the existing exponential segment,an algorithm based on Relative Popularity(RP) named RP-S is employed.Experimental result shows that algorithm presented in this paper has a higher byte hit ratio compared with the departed caching algorithm of streaming media,and also reduces the occupied bandwidth and user latency.
分 类 号:TP312[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.62