2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS) 2020
DOI: 10.1109/icdcs47774.2020.00027
|View full text |Cite
|
Sign up to set email alerts
|

Fair and Efficient Gossip in Hyperledger Fabric

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
3
3

Relationship

0
9

Authors

Journals

citations
Cited by 33 publications
(16 citation statements)
references
References 33 publications
0
14
0
Order By: Relevance
“…We evaluate the proposed improvements to the NeoGo gossip module and compare the results with the original version of the module implementation. Inspired by [1], we mainly focus our assessment on the three key metrics described above: block non-delivery probability, block propagation latency, and traffic load (also called bandwidth utilization), and how these metrics correlate with each other.…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…We evaluate the proposed improvements to the NeoGo gossip module and compare the results with the original version of the module implementation. Inspired by [1], we mainly focus our assessment on the three key metrics described above: block non-delivery probability, block propagation latency, and traffic load (also called bandwidth utilization), and how these metrics correlate with each other.…”
Section: Methodsmentioning
confidence: 99%
“…Most gossip optimization algorithms (such as those presented in [1] and [2]) require local peer-to-peer access to global network information. This is a separate issue known as the aggregation problem [7] and refers to a set of functions that provide access to such distributed system components as network size, load average and uptime, network map, and so on.…”
Section: Aggregation Problemmentioning
confidence: 99%
“…To address the heterogeneity in workload/bandwidth, one popular approach is gossip [55], [56], [15]: the broadcaster randomly picks some of its peers and sends them the message, and the receivers repeat this process until all the nodes receive the message with high probability. Despite their scalability, gossip protocols have a long tail-latency (the time required for the last node to receive the message) and high redundancy.…”
Section: R2 R1mentioning
confidence: 99%
“…P2P protocols support technical decentralization, and use communication patterns which do not require Quality-of-Service (QoS) contracts or Service Level Agreements between blockchain network participants. Even permissioned DLT implementations use prob-abilistic protocols: for example, Hyperledger Fabric uses the so-called gossip protocol [20].…”
Section: Decentralization and Peer-to-peer Aspects Of The Architecturementioning
confidence: 99%