检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:郭春梅 朱保平[1] GUO Chunmei;ZHU Baoping(School of Computer Science and Engineering,Nanjing University of Science and Technology,Nanjing 210094)
机构地区:[1]南京理工大学计算机科学与工程学院,南京210094
出 处:《计算机与数字工程》2020年第6期1290-1293,1349,共5页Computer & Digital Engineering
摘 要:针对现存的POW共识算法算力消耗过大的问题,该文将传统的分布式共识算法(PBFT算法)加以改进构建P-PBFT共识算法。该算法引入了升降级制度,使得节点状态能够动态改变,改进了记账节点一旦选出不能修改的缺点。从而能够减少恶意节点的影响。同时将PBFT算法的三段式过程进行合并并且简化修改为两段式过程,使之更好地适应区块链。并且在此基础上将P-PBFT共识算法和POW共识算法在以太坊联盟链中进行实验分析,实验结果表明该文提出的共识算法具有良好的吞吐量,并且有效地减少了算力开销。To solve the problem of existing POW consensus consuming too much computational cost,this paper improves the traditional distribution consensus algorithm(PBFT consensus algorithm)to build our own P-PBFT consensus algorithm. The algorithm introduces the promot ing-downgrading system to make the state of the nodes dynamic. The shortcomings of nodes are improved that the primary node can not be changed once selected. At the same time,the three-phase process is modified to two-phase process to make it simplifier. On this basis,the P-PBFT consensus algorithm and POW consensus algorithm are experienced and analyzed in Ethereum. The experience result shows that the algorithm proposed in this paper has good throughput and reduces the computational cost effectively.
分 类 号:TP311.13[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.38