【24h】

A New Web Cache Replacement Algorithm: Perfect-Time-Size Least Frequently Used

机译:一种新的Web缓存替换算法:完美时间大小最小的频繁使用

获取原文
获取原文并翻译 | 示例

摘要

Web caching is one of the important techniques utilized for the efficient operation of the World Wide Web. The contents in Web caches are controlled by Web cache replacement algorithms. This paper concerns taking the best attributes from two existing replacement algorithms and combining them into a more effective replacement algorithm. The resulting Web cache replacement algorithm partially combines the Perfect-LFU and Size algorithms. The new algorithm produces better results by increasing the overall hit ratios and byte hit ratios, thus decreasing the network load, and decreasing latency. The replacement algorithm was tested by measuring its hit ratio and memory usage and comparing the results to some existing replacement algorithms. The objective of this paper was to test the new Web cache replacement algorithm and see how well it performs when compared to some existing algorithms. Based on the limited testing and experimentation, it is safe to say that the Perfect-Time-Size Least Frequently Used algorithm appears to be the most effective on the first level of the Web cache hierarchy. To claim that it outperforms the existing algorithms categorically, would require more extensive experimentation and testing.
机译:Web缓存是用于有效运行World Wide Web的重要技术之一。 Web缓存中的内容由Web缓存替换算法控制。本文涉及从两种现有的替换算法中获取最佳属性,并将它们组合成更有效的替换算法。最终的Web缓存替换算法部分结合了Perfect-LFU和Size算法。新算法通过增加总体命中率和字节命中率,从而减少网络负载并减少等待时间,从而产生更好的结果。通过测量替换率和内存使用率并将结果与​​某些现有替换算法进行比较,测试了替换算法。本文的目的是测试新的Web缓存替换算法,并查看与某些现有算法相比其性能如何。基于有限的测试和实验,可以肯定地说,Perfect-Time-Size最少经常使用的算法在Web缓存层次结构的第一层上似乎是最有效的。要断言其性能优于现有算法,将需要进行更广泛的实验和测试。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号