一种基于协同信任的普适网络节点缓存替换策略研究  

Design of a Caching Replacement Policy Based on Cooperative Trust for Ubiquitous Computing Networks

作　　者：叶晖[1] 刘华富[1] 王江涛[1,2] 

机构地区：[1]长沙大学计算机科学与技术系,湖南长沙410022 [2]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《长沙大学学报》2013年第5期51-54,共4页Journal of Changsha University

基　　金：湖南省自然科学基金(批准号:11jj6059)资助项目;长沙市科技计划项目(批准号:K110717-11)

摘　　要：在以人为载体的普适网络中,大量各种不同类型数据随着节点移动而传播.节点实体面临如何缓存最新或最有价值的数据问题,设计相应的缓存数据替换算法是一个重要的研究领域.提出了一种利用协同信任关系来设计的缓存替换策略:CTRP.该策略基于特定数据项与特定节点的相关联系紧密度来判别确定缓存区内要替换的缓存数据,并通过节点信任度与目标地址匹配概率来对相关度进行判定;在此基础上结合数据项的有效性指标来设计缓存数据替换标准.仿真实验结果表明CTRP能够有效提高数据的缓存命中率,降低数据的远程访问延迟.A great amount of data flow with nodes movement in ubiquitous computing network when wireless devices are carried by hu- mans. The nodes have the problem of how to choose the latest or the most valuable data to cache. Therefore, the design of correspond- ing cache data replacement policy is an important issue. In this paper, a cache data replacement policy that uses cooperative trust rela- tionship of node is proposed referred as CTRP. CTRP chooses the data item to replace based on the correlation between the nodes and the data item. It utilizes the trust degree and the probability of destination - matching to judge the correlation. Moreover, the visit and update frequency ratio is used to design the standard of cache data replacement. The simulation results show that our policy can improve the cache hit ratio of data and reduce the data latency of remote data access effectively.

关 键 词：普适网络 缓存替换策略 数据访问延迟 缓存命中率 

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