首页> 外文会议>2010 2nd International Conference on Future Computer and Communication >Maintain history information in DHT based P2P system under churn
【24h】

Maintain history information in DHT based P2P system under churn

机译:在客户流失下基于DHT的P2P系统中维护历史信息

获取原文

摘要

Peer-to-Peer (P2P) systems receive growing acceptance, and the need of maintain the history information of nodes appears increasingly in a variety of P2P based applications. In this paper, we propose an algorithm to efficiently maintain the history information of all nodes in Chord like network under churn. In spirit to successor duplication, the duplications of load history are placed in its successors, and are updated in time. If there are some nodes depart from the network, the load history can be retrieved from the successors of the departed one. Simulation results show that, if the network has high churn ratio, great duplication number and large stabilization duration will lead to reliable history information maintenance.
机译:对等(P2P)系统越来越受到人们的欢迎,并且在各种基于P2P的应用程序中,维护节点历史信息的需求也越来越明显。在本文中,我们提出了一种算法,可以有效地维护用户流失情况下类似Chord的网络中所有节点的历史信息。本着继任者重复的精神,将加载历史记录的副本放置在其继任者中,并及时进行更新。如果有一些节点离开网络,则可以从已离开的节点的后续节点中检索负载历史记录。仿真结果表明,如果网络的用户流失率较高,则重复次数大,稳定时间长,可以保证可靠的历史信息维护。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号