基于G-Chord的Cache共享模型  

A Cache-Shared Model Based on G-Chord

作　　者：宋志刚[1] 

机构地区：[1]福州大学网络与信息中心,福建福州350002

出　　处：《南京师范大学学报（工程技术版）》2009年第4期77-81,共5页Journal of Nanjing Normal University(Engineering and Technology Edition)

摘　　要：提出了一种基于G-Chord算法的节点Cache共享模型,实现对象的搜索、存储和分发,有效地利用了客户节点的缓存内容,提高了客户间的合作,减小了客户的等待时间,降低了服务器的压力.仿真实验证明,采用G-Chord算法处理节点的路由表长度有了显著的缩减,能够保持较好的平均路径长度.此外,对分组数量的不同取值、节点负载的研究也为G-Chord的分组方案提供了一定的参考依据.A node cache sharing model based on the G-Chord algorithm is presented,which implements the search,store and distributiton of the objects by using the content of cache of the client nodes,while raising the cooperation among the clients,decreasing the wait time of clients,and reducing the pressure on the servers.It was proved in the emulational experiment that the length of the route-table was evidently curtailed,while remaining good length of the average path.The research on the difference among the amount of groups and the value of them and the load of the nodes alsoprovided some reference for the G-Chord grouping scheme.

关 键 词：G-Chord Cache共享 性能 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]