{"id":"https://openalex.org/W4385757648","doi":"https://doi.org/10.1109/tc.2023.3296916","title":"ParBFT: An Optimized Byzantine Consensus Parallelism Scheme","display_name":"ParBFT: An Optimized Byzantine Consensus Parallelism Scheme","publication_year":2023,"publication_date":"2023-08-11","ids":{"openalex":"https://openalex.org/W4385757648","doi":"https://doi.org/10.1109/tc.2023.3296916"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2023.3296916","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2023.3296916","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/journal_contribution/ParBFT_An_Optimized_Byzantine_Consensus_Parallelism_Scheme/25204715","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100373718","display_name":"Xiao Chen","orcid":"https://orcid.org/0000-0002-3290-507X"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Xiao Chen","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Edinburgh, U.K"],"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Edinburgh, U.K","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063675425","display_name":"Btissam Er-Rahmadi","orcid":"https://orcid.org/0000-0003-0526-661X"},"institutions":[{"id":"https://openalex.org/I4210160618","display_name":"Huawei Technologies (United Kingdom)","ror":"https://ror.org/056gzgs71","country_code":"GB","type":"company","lineage":["https://openalex.org/I2250955327","https://openalex.org/I4210160618"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Btissam Er-Rahmadi","raw_affiliation_strings":["Edinburgh Research Centre, Huawei Technologies, Edinburgh, U.K"],"affiliations":[{"raw_affiliation_string":"Edinburgh Research Centre, Huawei Technologies, Edinburgh, U.K","institution_ids":["https://openalex.org/I4210160618"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069370346","display_name":"Tiejun Ma","orcid":"https://orcid.org/0000-0001-5545-6978"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tiejun Ma","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Edinburgh, U.K"],"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Edinburgh, U.K","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035860397","display_name":"Jane Hillston","orcid":"https://orcid.org/0000-0003-4914-9255"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jane Hillston","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Edinburgh, U.K"],"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Edinburgh, U.K","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100373718"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":2.1862,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88385687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"72","issue":"12","first_page":"3354","last_page":"3369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10270","display_name":"Blockchain Technology Applications and Security","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.8443965911865234},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.822172999382019},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.6757209300994873},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5430930852890015},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5344008803367615},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.5275418758392334},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.49117228388786316},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4644031524658203},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.4561038613319397},{"id":"https://openalex.org/keywords/novelty","display_name":"Novelty","score":0.4429214596748352},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.43299102783203125},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.429691344499588},{"id":"https://openalex.org/keywords/consensus","display_name":"Consensus","score":0.4271644949913025},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4029754400253296},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.3419502377510071},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2351667284965515},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12880662083625793},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09451141953468323},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.07503166794776917}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8443965911865234},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.822172999382019},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.6757209300994873},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5430930852890015},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5344008803367615},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5275418758392334},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.49117228388786316},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4644031524658203},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.4561038613319397},{"id":"https://openalex.org/C2778738651","wikidata":"https://www.wikidata.org/wiki/Q16546687","display_name":"Novelty","level":2,"score":0.4429214596748352},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.43299102783203125},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.429691344499588},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.4271644949913025},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4029754400253296},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.3419502377510071},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2351667284965515},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12880662083625793},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09451141953468323},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.07503166794776917},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1109/tc.2023.3296916","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2023.3296916","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},{"id":"pmh:oai:figshare.com:article/25204715","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/ParBFT_An_Optimized_Byzantine_Consensus_Parallelism_Scheme/25204715","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/84bfbc12-ea53-4b88-a679-61159c2237ce","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/84bfbc12-ea53-4b88-a679-61159c2237ce","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chen, X, Er-Rahmadi, B, Ma, T & Hillston, J 2023, 'ParBFT: An Optimised Byzantine Consensus Parallelism Scheme', IEEE Transactions on Computers, vol. 72, no. 12, pp. 3354-3369. https://doi.org/10.1109/TC.2023.3296916","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/84bfbc12-ea53-4b88-a679-61159c2237ce","is_oa":false,"landing_page_url":"https://ieeexplore.ieee.org/document/10214975","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:publications/84bfbc12-ea53-4b88-a679-61159c2237ce","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/files/364776301/TC_2022_03_0291_main.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chen, X, Er-Rahmadi, B, Ma, T & Hillston, J 2023, 'ParBFT: An Optimised Byzantine Consensus Parallelism Scheme', IEEE Transactions on Computers, vol. 72, no. 12, pp. 3354-3369. https://doi.org/10.1109/TC.2023.3296916","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/25204715","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/ParBFT_An_Optimized_Byzantine_Consensus_Parallelism_Scheme/25204715","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.4300000071525574,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320335041","display_name":"School of Informatics, University of Edinburgh","ror":"https://ror.org/01nrxwf90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1989850654","https://openalex.org/W2003214215","https://openalex.org/W2010608066","https://openalex.org/W2013034217","https://openalex.org/W2061527589","https://openalex.org/W2095708839","https://openalex.org/W2098104887","https://openalex.org/W2110880385","https://openalex.org/W2115270475","https://openalex.org/W2126087831","https://openalex.org/W2126377116","https://openalex.org/W2133943294","https://openalex.org/W2139359217","https://openalex.org/W2151426692","https://openalex.org/W2163500640","https://openalex.org/W2294352052","https://openalex.org/W2535104337","https://openalex.org/W2567129513","https://openalex.org/W2584120063","https://openalex.org/W2597694153","https://openalex.org/W2717184009","https://openalex.org/W2763398287","https://openalex.org/W2765308299","https://openalex.org/W2794533297","https://openalex.org/W2794784663","https://openalex.org/W2897676665","https://openalex.org/W2954959112","https://openalex.org/W2962836134","https://openalex.org/W2964159515","https://openalex.org/W2964303100","https://openalex.org/W2969395421","https://openalex.org/W2982468232","https://openalex.org/W3091665258","https://openalex.org/W3095507148","https://openalex.org/W3099773961","https://openalex.org/W3102600874","https://openalex.org/W3108722340","https://openalex.org/W4210826988","https://openalex.org/W4221007779","https://openalex.org/W4288083744","https://openalex.org/W6678700732","https://openalex.org/W6678832241","https://openalex.org/W6745553878","https://openalex.org/W6758951352"],"related_works":["https://openalex.org/W2045183646","https://openalex.org/W2162409446","https://openalex.org/W2886165711","https://openalex.org/W2109463584","https://openalex.org/W2145120192","https://openalex.org/W4319072583","https://openalex.org/W4214672453","https://openalex.org/W2012215169","https://openalex.org/W4319875884","https://openalex.org/W3006496270"],"abstract_inverted_index":{"Byzantine":[0,63],"fault-tolerance":[1],"(BFT)":[2],"consensus":[3,64,92,144],"is":[4,86,109],"a":[5,61,72],"fundamental":[6],"building":[7],"block":[8],"of":[9,36,46,84,112,134,154],"distributed":[10],"systems":[11,42,162],"such":[12],"as":[13],"blockchains.":[14],"However,":[15],"implementations":[16],"based":[17],"on":[18,158],"classic":[19,68],"PBFT":[20],"and":[21,34,52,71,136,142,168],"most":[22],"linear":[23],"PBFT-variants":[24],"still":[25],"suffer":[26],"from":[27],"message":[28],"communication":[29],"complexity,":[30],"restricting":[31],"the":[32,50,110,113,131,152,155,178],"scalability":[33,51,89],"performance":[35,53,145,153],"BFT":[37,69],"algorithms":[38],"when":[39],"serving":[40],"large-scale":[41],"with":[43,163],"growing":[44],"numbers":[45],"peers.":[47],"To":[48],"tackle":[49],"challenges,":[54],"we":[55,150],"propose":[56],"<italic":[57],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[58],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">ParBFT</i>":[59],",":[60],"new":[62],"parallelism":[65],"scheme":[66],"combining":[67],"protocols":[70],"novel":[73],"Bilevel":[74],"Mixed-Integer":[75],"Linear":[76],"Programming":[77],"(BL-MILP)-based":[78],"optimisation":[79],"model.":[80],"The":[81,118],"core":[82,107],"aim":[83],"ParBFT":[85,157,171],"to":[87,122,165,177],"improve":[88,143],"via":[90],"parallel":[91,128],"while":[93,146],"providing":[94],"enhanced":[95],"safety":[96],"(i.e.":[97,130],"ensuring":[98,147],"consistent":[99],"total":[100],"order":[101],"across":[102],"all":[103],"correct":[104],"replicas).":[105],"Another":[106],"novelty":[108],"integration":[111],"BL-MILP":[114,119],"model":[115],"into":[116],"ParBFT.":[117],"allows":[120],"us":[121],"compute":[123],"optimal":[124,132],"numerical":[125],"decisions":[126],"for":[127,139],"committees":[129,135],"number":[133],"peer":[137],"allocation":[138],"each":[140],"committee)":[141],"security.":[148],"Finally,":[149],"test":[151],"proposed":[156],"Microsoft":[159],"Azure":[160],"Cloud":[161],"20":[164],"300":[166],"peers":[167],"find":[169],"that":[170],"can":[172],"achieve":[173],"significant":[174],"improvement":[175],"compared":[176],"state-of-the-art":[179],"protocols.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}