首页 | 本学科首页   官方微博 | 高级检索  
     

协同式WEB树型缓存结构的设计及仿真性能分析
引用本文:贾惠芹,刘君华. 协同式WEB树型缓存结构的设计及仿真性能分析[J]. 系统仿真学报, 2002, 14(11): 1559-1562
作者姓名:贾惠芹  刘君华
作者单位:西安交通大学电气学院,西安,710049
摘    要:给出了一种树型WEB缓存结构,并描述了它的基本设计原理,在本结构中,缓存被当作一系列低通滤波器,微波器的低截止频率等于特征时间的倒数,当文件的访问频率低于该截止频率时,将被替换,相反,将被缓存,仿真研究表明,所提出的结构和传统的非协同式结构相比,节省了缓存资源,降低了缓存的失效比,该结构已被用于作者开发的基于WEB的远程虚拟仪器实验室,明显提高了用户的访问速度。

关 键 词:协同式WEB树型缓存结构 设计 仿真性能分析 缓存失效比 网络带宽 WWW 计算机网络
文章编号:1004-731X(2002)11-1559-04
修稿时间:2002-01-07

Design and Simulation Performance Analysis of Cooperative WEB Tree-Like Cache Architecture
JIA Hui-qin,LIU Jun-hua. Design and Simulation Performance Analysis of Cooperative WEB Tree-Like Cache Architecture[J]. Journal of System Simulation, 2002, 14(11): 1559-1562
Authors:JIA Hui-qin  LIU Jun-hua
Abstract:This paper presents the tree-like WEB cache architecture, and describes its fundamental design principle. In this system, cache can be considered as a series of low pass filters, and cutoff frequency of filters is the reverse of characteristic time. When the access frequency is lower than this cutoff frequency, the document will be replaced by new document, otherwise, will be cached. The simulation results show that the presented architecture compared with the traditional architecture, can save cache resouce, and reduce the cache miss ratio. This architecture is already used in Remote Virtual Laboratory based on WEB, and the user-visiting rate is improved in evidence.
Keywords:WEB tree-like caching  cutoff frequency  cache miss ratio
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号