不同网络拓扑下的快速概率共识协议(FPC

F. Chen, Huizhu Li, Zhiyuan Sui, Kun Liu, Wenying Tang
{"title":"不同网络拓扑下的快速概率共识协议(FPC","authors":"F. Chen, Huizhu Li, Zhiyuan Sui, Kun Liu, Wenying Tang","doi":"10.1109/ICSS55994.2022.00018","DOIUrl":null,"url":null,"abstract":"Fast Probabilistic Consensus Protocol (FPC) is a novel Consensus Protocol in IOTA Tangle. Focusing on FPC and IOTA Tangle, this paper applies FPC to all-pass topology and triangle Tangle topology for comparison. Under the same network model and attack model, we analyze the two network topologies on FPC, and figure out which one has better performance on reaching a consensus. The experimental results show that all-pass topologies overperformance triangle Tangle structures due to the randomness of the model, when the number of nodes is small; however, triangle Tangle topologies overperformance all-pass topologies when the number of nodes is larger and the model tends to stabilize.","PeriodicalId":327964,"journal":{"name":"2022 International Conference on Service Science (ICSS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Fast Probabilistic Consensus Protocol (FPC) under Different Network Topologies\",\"authors\":\"F. Chen, Huizhu Li, Zhiyuan Sui, Kun Liu, Wenying Tang\",\"doi\":\"10.1109/ICSS55994.2022.00018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fast Probabilistic Consensus Protocol (FPC) is a novel Consensus Protocol in IOTA Tangle. Focusing on FPC and IOTA Tangle, this paper applies FPC to all-pass topology and triangle Tangle topology for comparison. Under the same network model and attack model, we analyze the two network topologies on FPC, and figure out which one has better performance on reaching a consensus. The experimental results show that all-pass topologies overperformance triangle Tangle structures due to the randomness of the model, when the number of nodes is small; however, triangle Tangle topologies overperformance all-pass topologies when the number of nodes is larger and the model tends to stabilize.\",\"PeriodicalId\":327964,\"journal\":{\"name\":\"2022 International Conference on Service Science (ICSS)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Service Science (ICSS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSS55994.2022.00018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Service Science (ICSS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSS55994.2022.00018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

快速概率共识协议(Fast Probabilistic Consensus Protocol, FPC)是IOTA Tangle中一种新型的共识协议。本文以FPC和IOTA缠结为重点,将FPC应用于全通拓扑和三角缠结拓扑进行比较。在相同的网络模型和攻击模型下,我们在FPC上分析了两种网络拓扑,并找出了哪种网络拓扑在达成共识时性能更好。实验结果表明,当节点数较少时,由于模型的随机性,全通拓扑优于三角缠结结构;然而,当节点数量较大且模型趋于稳定时,三角缠结拓扑的性能优于全通拓扑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Fast Probabilistic Consensus Protocol (FPC) under Different Network Topologies
Fast Probabilistic Consensus Protocol (FPC) is a novel Consensus Protocol in IOTA Tangle. Focusing on FPC and IOTA Tangle, this paper applies FPC to all-pass topology and triangle Tangle topology for comparison. Under the same network model and attack model, we analyze the two network topologies on FPC, and figure out which one has better performance on reaching a consensus. The experimental results show that all-pass topologies overperformance triangle Tangle structures due to the randomness of the model, when the number of nodes is small; however, triangle Tangle topologies overperformance all-pass topologies when the number of nodes is larger and the model tends to stabilize.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信