Memento TimeMaps缓存策略的评价
An Evaluation of Caching Policies for Memento TimeMaps
摘要:
正如Memento框架所定义的,时间地图是一个存档的原始资源的特定于时间的副本的机器可读列表-称为“纪念品”。从理论上讲,随着存档随着时间的推移获得更多的纪念品,TimeMap应该单调增加。然而,时间地图中的纪念物数量会减少是有原因的,例如:部分或全部纪念物的档案编辑,档案重组,以及一个或多个档案中的短暂错误。我们在三个月内研究了4,000个原始资源的TimeMaps,注意它们的变化模式,并开发了一种适用于Memento聚合器前的反向代理的TimeMaps缓存算法。我们发现,TimeMap的基数是恒定的或单调增加的80.2%的所有TimeMap的下载观察期内观察到的。缓存算法的目标是利用TimeMap的理想单调递增性质,而不是用比已经缓存的TimeMap更少的纪念物来缓存响应。这个新的缓存算法使用条件缓存替换和生存时间(TTL)值来确保用户可以访问最完整的TimeMap。根据我们的经验数据,15天的TTL将最大限度地减少用户错过的纪念品数量,并最大限度地减少对TimeMaps贡献的存档的负载。
英文摘要:
As defined by the Memento Framework, TimeMaps are ma-chine-readable lists of time-specific copies -- called "mementos" -- of an archived original resource. In theory, as an archive acquires additional mementos over time, a TimeMap should be monotonically increasing. However, there are reasons why the number of mementos in a TimeMap would decrease, for example: archival redaction of some or all of the mementos, archival restructuring, and transient errors on the part of one or more archives. We study TimeMaps for 4,000 original resources over a three month period, note their change patterns, and develop a caching algorithm for TimeMaps suitable for a reverse proxy in front of a Memento aggregator. We show that TimeMap cardinality is constant or monotonically increasing for 80.2% of all TimeMap downloads observed in the observation period. The goal of the caching algorithm is to exploit the ideally monotonically increasing nature of TimeMaps and not cache responses with fewer mementos than the already cached TimeMap. This new caching algorithm uses conditional cache replacement and a Time To Live (TTL) value to ensure the user has access to the most complete TimeMap available. Based on our empirical data, a TTL of 15 days will minimize the number of mementos missed by users, and minimize the load on archives contributing to TimeMaps.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。