最优停止理论在缓存一致性检查中的应用

2012 16th Panhellenic Conference on Informatics Pub Date : 2012-10-05 DOI:10.1109/PCi.2012.71

Manos Spanoudakis, Dimitris Lorentzos, C. Anagnostopoulos, S. Hadjiefthymiades

{"title":"最优停止理论在缓存一致性检查中的应用","authors":"Manos Spanoudakis, Dimitris Lorentzos, C. Anagnostopoulos, S. Hadjiefthymiades","doi":"10.1109/PCi.2012.71","DOIUrl":null,"url":null,"abstract":"Serving the most updated version of a resource with minimal networking overhead is always a challenge for WWW Caching, especially, for weak consistency algorithms such as the widely adopted Adaptive Time-to-Live (ATTL). We adopt the Optimal Stopping Theory (OST) and, specifically, the Odds-algorithm, to enable the caching server to accurately handle the object refreshing and the stale delivery problem. Simulation results show that the proposed OST-based algorithm outperforms the conventional ATTL.","PeriodicalId":131195,"journal":{"name":"2012 16th Panhellenic Conference on Informatics","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On the Use of Optimal Stopping Theory for Cache Consistency Checks\",\"authors\":\"Manos Spanoudakis, Dimitris Lorentzos, C. Anagnostopoulos, S. Hadjiefthymiades\",\"doi\":\"10.1109/PCi.2012.71\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Serving the most updated version of a resource with minimal networking overhead is always a challenge for WWW Caching, especially, for weak consistency algorithms such as the widely adopted Adaptive Time-to-Live (ATTL). We adopt the Optimal Stopping Theory (OST) and, specifically, the Odds-algorithm, to enable the caching server to accurately handle the object refreshing and the stale delivery problem. Simulation results show that the proposed OST-based algorithm outperforms the conventional ATTL.\",\"PeriodicalId\":131195,\"journal\":{\"name\":\"2012 16th Panhellenic Conference on Informatics\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 16th Panhellenic Conference on Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCi.2012.71\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 16th Panhellenic Conference on Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCi.2012.71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

以最小的网络开销服务于资源的最新版本始终是WWW缓存的一个挑战，特别是对于弱一致性算法，如广泛采用的自适应生存时间(ATTL)。我们采用了最优停止理论(OST)，特别是odds算法，使缓存服务器能够准确地处理对象刷新和过期交付问题。仿真结果表明，该算法优于传统的ATTL算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On the Use of Optimal Stopping Theory for Cache Consistency Checks

Serving the most updated version of a resource with minimal networking overhead is always a challenge for WWW Caching, especially, for weak consistency algorithms such as the widely adopted Adaptive Time-to-Live (ATTL). We adopt the Optimal Stopping Theory (OST) and, specifically, the Odds-algorithm, to enable the caching server to accurately handle the object refreshing and the stale delivery problem. Simulation results show that the proposed OST-based algorithm outperforms the conventional ATTL.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2012 16th Panhellenic Conference on Informatics

自引率

0.00%

发文量