基于概率的WWW服务器阵列替换算法

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250) Pub Date : 1998-12-14 DOI:10.1109/ICPADS.1998.741154

A. Yeung, K. Suen

{"title":"基于概率的WWW服务器阵列替换算法","authors":"A. Yeung, K. Suen","doi":"10.1109/ICPADS.1998.741154","DOIUrl":null,"url":null,"abstract":"This paper describes a scalable Web server array architecture which uses a caching policy called the probability based replacement (PBR) algorithm. The server array consists of a central server and several Web servers. The central server stores the whole document set, and sends the user requested documents to the Web servers by a technique called the selective broadcast technique. Web documents are cached in the Web servers and are replaced based on the PBR algorithm. Performance comparison using NASA and ClarkNet access logs between PBR server arrays and purely mirrored Web servers is performed. The results show that with 10% document caching, the maximum throughput of the former one is nearly the same as that of mirrored Web servers. The PBR server arrays, however, require much smaller disk storage in the Web servers than the mirrored Web servers. The PBR server arrays are also much more scalable than the mirrored ones.","PeriodicalId":226947,"journal":{"name":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Probability based replacement algorithm for WWW server arrays\",\"authors\":\"A. Yeung, K. Suen\",\"doi\":\"10.1109/ICPADS.1998.741154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper describes a scalable Web server array architecture which uses a caching policy called the probability based replacement (PBR) algorithm. The server array consists of a central server and several Web servers. The central server stores the whole document set, and sends the user requested documents to the Web servers by a technique called the selective broadcast technique. Web documents are cached in the Web servers and are replaced based on the PBR algorithm. Performance comparison using NASA and ClarkNet access logs between PBR server arrays and purely mirrored Web servers is performed. The results show that with 10% document caching, the maximum throughput of the former one is nearly the same as that of mirrored Web servers. The PBR server arrays, however, require much smaller disk storage in the Web servers than the mirrored Web servers. The PBR server arrays are also much more scalable than the mirrored ones.\",\"PeriodicalId\":226947,\"journal\":{\"name\":\"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPADS.1998.741154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS.1998.741154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文描述了一种可扩展的Web服务器阵列架构，该架构使用一种称为基于概率替换(PBR)算法的缓存策略。服务器阵列由一个中心服务器和几个Web服务器组成。中央服务器存储整个文档集，并通过一种称为选择性广播技术的技术将用户请求的文档发送到Web服务器。Web文档缓存在Web服务器中，并根据PBR算法进行替换。使用NASA和ClarkNet访问日志在PBR服务器阵列和纯镜像Web服务器之间进行性能比较。结果表明，当文档缓存率为10%时，前者的最大吞吐量与镜像Web服务器的最大吞吐量几乎相同。但是，与镜像Web服务器相比，PBR服务器阵列在Web服务器中需要更小的磁盘存储空间。PBR服务器阵列也比镜像服务器阵列具有更高的可扩展性。

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

查看原文本刊更多论文

Probability based replacement algorithm for WWW server arrays

This paper describes a scalable Web server array architecture which uses a caching policy called the probability based replacement (PBR) algorithm. The server array consists of a central server and several Web servers. The central server stores the whole document set, and sends the user requested documents to the Web servers by a technique called the selective broadcast technique. Web documents are cached in the Web servers and are replaced based on the PBR algorithm. Performance comparison using NASA and ClarkNet access logs between PBR server arrays and purely mirrored Web servers is performed. The results show that with 10% document caching, the maximum throughput of the former one is nearly the same as that of mirrored Web servers. The PBR server arrays, however, require much smaller disk storage in the Web servers than the mirrored Web servers. The PBR server arrays are also much more scalable than the mirrored ones.

求助全文

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

来源期刊

Proceedings 1998 International Conference on Parallel and Distributed Systems (Cat. No.98TB100250)

自引率

0.00%

发文量