首页> 外文期刊>Oriental journal of computer science and technology >Trust and Caching Technique for Intelligent Semantic Query Routing in P2P Networks
【24h】

Trust and Caching Technique for Intelligent Semantic Query Routing in P2P Networks

机译:P2P网络中智能语义查询路由的信任和缓存技术

获取原文
       

摘要

The P2P routing protocol is affected from the fact that queries need to reach the largest number of peers to enhance the chances to locate the target file and messages should be low as possible We propose trust based query routing technique for P2P Networks. Initially the node with maximum trust value is chosen as cluster head. These cluster heads are designated as trust managers. Each peer maintains a trust table which gets updated once it gets feedback from the trust manager about the resource requested peer. If the update denotes that the node is reachable and trusted, the routing is performed. Otherwise its echo time is verified again to decide the re-routing process. By simulation results, we show that the proposed work offers secured and reliable routing. This peer to peer network is carried out without using a caching mechanism to store the data packets while routing. To achieve this caching mechanism we have proposed methods for caching the data packets in the peers and also to replace these data packets with the new data packets in the next routing process.
机译:P2P路由协议受以下事实的影响:查询需要到达最大数量的对等点,以增加找到目标文件的机会,并且消息应尽可能的少。我们为P2P网络提出了基于信任的查询路由技术。最初,选择具有最大信任值的节点作为群集头。这些群集头被指定为信任管理器。每个对等方维护一个信任表,一旦它从信任管理器收到有关所请求资源的资源的反馈,该表就会更新。如果更新指示该节点可访问且受信任,则执行路由。否则,将再次验证其回声时间以决定重新路由过程。通过仿真结果,我们表明所提出的工作提供了安全可靠的路由。在不使用缓存机制在路由时存储数据包的情况下执行此对等网络。为了实现这种缓存机制,我们提出了在对等体中缓存数据包并在下一个路由过程中用新数据包替换这些数据包的方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号