This paper proposes a web cache replacement algorithmthat considers object size and usage in its design. Thealgorithm is characterized by a parameter k, which is usedas a criterion to select objects for replacement. W...
详细信息
This paper proposes a web cache replacement algorithmthat considers object size and usage in its design. Thealgorithm is characterized by a parameter k, which is usedas a criterion to select objects for replacement. Wedescribe the algorithm and use an example to illustratehow it works. The algorithm has been implemented andapplied to a variety of workloads which differ in thedistribution of object size and access *** results are presented and analyzed. It isfound that the method shows good performance comparedto other existing schemes.
暂无评论