TY - GEN
T1 - Delay Analysis of the BFT Blockchain Data Dissemination
T2 - 20th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2024
AU - Hwerbi, Khouloud
AU - Amdouni, Ichrak
AU - Adjih, Cedric
AU - Jacquet, Philippe
AU - Saidane, Leila Azouz
AU - Laouiti, Anis
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024/1/1
Y1 - 2024/1/1
N2 - This article investigates data dissemination delays in a Directed Acyclic Graph (DAG)-based Byzantine Fault Tolerant (BFT) blockchain. We focus particularly on the Narwhal protocol, a mempool-based approach for efficiently disseminating transactions and constructing a DAG. Narwhal is designed to work alongside a BFT consensus protocol like Tusk. Tusk then orders the transaction metadata based on the DAG information. Through an in-depth analysis of the protocol messages, we establish a mathematical model for message propagation delays. We start by considering a specific probability distribution for data network propagation delays: Gaussian Distribution. Then, we consider a general propagation delay distribution. Also, we assume large networks and apply some approximations, i.e., the Central Limit Theorem (CLT). Finally, we develop the Narwhal protocol and demonstrate that the simulated delays are compatible with the theoretical ones.
AB - This article investigates data dissemination delays in a Directed Acyclic Graph (DAG)-based Byzantine Fault Tolerant (BFT) blockchain. We focus particularly on the Narwhal protocol, a mempool-based approach for efficiently disseminating transactions and constructing a DAG. Narwhal is designed to work alongside a BFT consensus protocol like Tusk. Tusk then orders the transaction metadata based on the DAG information. Through an in-depth analysis of the protocol messages, we establish a mathematical model for message propagation delays. We start by considering a specific probability distribution for data network propagation delays: Gaussian Distribution. Then, we consider a general propagation delay distribution. Also, we assume large networks and apply some approximations, i.e., the Central Limit Theorem (CLT). Finally, we develop the Narwhal protocol and demonstrate that the simulated delays are compatible with the theoretical ones.
KW - BFT Blockchain
KW - CLT
KW - Nar-whal
KW - Network Delay Analysis
KW - Order Statistics
KW - large-scale
UR - https://www.scopus.com/pages/publications/85214710542
U2 - 10.1109/WiMob61911.2024.10770300
DO - 10.1109/WiMob61911.2024.10770300
M3 - Conference contribution
AN - SCOPUS:85214710542
T3 - International Conference on Wireless and Mobile Computing, Networking and Communications
SP - 651
EP - 656
BT - 2024 20th International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob 2024
PB - IEEE Computer Society
Y2 - 21 October 2024 through 23 October 2024
ER -