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

二元位运算P2P系统复制技术的研究
引用本文:廖剑伟,蔡洪斌,熊海灵,陈善雄.二元位运算P2P系统复制技术的研究[J].电子科技大学学报(社会科学版),2009(3).
作者姓名:廖剑伟  蔡洪斌  熊海灵  陈善雄
作者单位:西南大学计算机与信息科学学院;电子科技大学计算机科学与工程学院;
基金项目:国家863计划(2006AA01Z335)
摘    要:提出了BitwiseTree,利用二元位运算确定复本放置,而不需要像其他基于日志的复制技术需要考虑客户访问日志;同时BitwiseTree提供的容错机制保证失效节点中的文件可以在其他复制节点中找到。仿真实验表明,BitwiseTree只需要使用较少的复本就能达到有效地缓解节点过载的目的,因此该模型非常适合无法获得客户访问日志的机密P2P系统或者对系统性能要求比较高的P2P系统。

关 键 词:均衡  二元位运算  容错  P2P系统  复制树  

Replication in Peer to Peer System Based on Bitwise Operation
LIAO Jian-wei,CAI Hong-bin,XIONG Hai-ling, CHEN Shan-xiong.Replication in Peer to Peer System Based on Bitwise Operation[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),2009(3).
Authors:LIAO Jian-wei  CAI Hong-bin  XIONG Hai-ling    CHEN Shan-xiong
Institution:LIAO Jian-wei1,CAI Hong-bin2,XIONG Hai-ling1,, CHEN Shan-xiong1 (1.College of Computer , Information Science,Southwest University Beibei Chongqing 400715,2.School of Computer Science , Engineering,University of Electronic Science , Technology of China Chengdu 610054)
Abstract:Replicating techniques are frequently used in a high performance distributed system to reduce the load of the overload nodes.Traditional file replication algorithms rely on the analysis of client-access logs to determine the location of the replicated nodes.This paper presents a fault-tolerant BitwiseTree model for peer to peer system.It constructs a replication tree for each node,and then uses bitwise operations to determine the location of the replicated node without any client-access history.In addition,...
Keywords:balancing  bitwise operations  fault tolerance  peer to peer system  replication tree  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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