2020
DOI: 10.1109/tnet.2020.3017500
|View full text |Cite
|
Sign up to set email alerts
|

AWG-Based Nonblocking Shuffle-Exchange Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 32 publications
0
1
0
Order By: Relevance
“…The PBFT algorithm uses a three-segment protocol to ensure that each replica node has the same execution order. The three-segment protocol includes one single-node broadcast and two all-node network broadcasts [21]. The number of consensus messages transmitted is Z 1 = 2n 2 − n, and n is the total number of nodes in the entire network.…”
Section: Improvement Of Consistency Protocolmentioning
confidence: 99%
“…The PBFT algorithm uses a three-segment protocol to ensure that each replica node has the same execution order. The three-segment protocol includes one single-node broadcast and two all-node network broadcasts [21]. The number of consensus messages transmitted is Z 1 = 2n 2 − n, and n is the total number of nodes in the entire network.…”
Section: Improvement Of Consistency Protocolmentioning
confidence: 99%