Workload characterization in Web caching hierarchies

Guangwei Bai, C. Williamson
{"title":"Workload characterization in Web caching hierarchies","authors":"Guangwei Bai, C. Williamson","doi":"10.1109/MASCOT.2002.1167056","DOIUrl":null,"url":null,"abstract":"The paper uses trace-driven simulation and synthetic Web workloads to study the request arrival process at each level of a simple Web proxy caching hierarchy. The simulation results show that a Web cache reduces both the peak and the mean request arrival rate for Web traffic workloads. However, the variability of the request arrival process may either increase, decrease, or remain the same after the cache, depending on the input arrival process and the configuration of the cache. If the input request arrival process is self-similar, then the filtered request arrival process remains self-similar, though with reduced mean. Furthermore, the superposition of Web request streams from multiple child caches results in a bursty aggregate request stream. Finally, we find that a gamma distribution provides a flexible means of modeling the request arrival count distribution in hierarchical Web caching architectures.","PeriodicalId":384900,"journal":{"name":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2002.1167056","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

The paper uses trace-driven simulation and synthetic Web workloads to study the request arrival process at each level of a simple Web proxy caching hierarchy. The simulation results show that a Web cache reduces both the peak and the mean request arrival rate for Web traffic workloads. However, the variability of the request arrival process may either increase, decrease, or remain the same after the cache, depending on the input arrival process and the configuration of the cache. If the input request arrival process is self-similar, then the filtered request arrival process remains self-similar, though with reduced mean. Furthermore, the superposition of Web request streams from multiple child caches results in a bursty aggregate request stream. Finally, we find that a gamma distribution provides a flexible means of modeling the request arrival count distribution in hierarchical Web caching architectures.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Web缓存层次结构中的工作负载表征
本文使用跟踪驱动模拟和合成Web工作负载来研究简单Web代理缓存层次结构的每个级别的请求到达过程。仿真结果表明,Web缓存可以降低Web流量负载的峰值请求到达率和平均请求到达率。但是,请求到达过程的可变性在缓存之后可能增加、减少或保持不变,这取决于输入到达过程和缓存的配置。如果输入请求到达过程是自相似的,那么过滤后的请求到达过程仍然是自相似的,尽管平均值降低了。此外,来自多个子缓存的Web请求流的叠加会导致突发的聚合请求流。最后,我们发现伽马分布提供了一种灵活的方法来对分层Web缓存架构中的请求到达数分布进行建模。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A simulation study of non-cooperative pricing strategies for circuit-switched optical networks A mixed abstraction level simulation model of large-scale Internet worm infestations TCP performance analysis of CDMA systems with RLP and MAC layer retransmissions Playing with time: on the specification and execution of time-enriched LSCs Analyzing the short-term fairness of IEEE 802.11 in wireless multi-hop radio networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1