TY - GEN
T1 - Dynamic Optimization of the Latency Throughput Trade-off in Parallel Chain Distributed Ledgers
AU - Camponês, Pedro
AU - Domingos, Henrique
N1 - Funding Information:
info:eu-repo/grantAgreement/FCT/OE/PRT%2FBD%2F154428%2F2022/PT#
Experiments presented were carried out using the Grid'5000 testbed, supported by a scientific interest group hosted by Inria and including CNRS, RENATER and several Universities as well as other organizations (see https://www.grid5000.fr)
Publisher Copyright:
© 2024 Copyright held by the owner/author(s).
PY - 2024/5/21
Y1 - 2024/5/21
N2 - In the realm of Distributed Ledgers (DLs), a solution to enhancing maximum peak throughput involves establishing multiple independent blockchains that evolve concurrently. However, an excess of parallel chains in comparison to the application's demands can result in increased latency in content delivery, squandered bandwidth, and heightened computational strain on network nodes.Our innovation, Blockmess, introduces a novel parallel chain DL architecture. This solution dynamically adjusts the number of active parallel chains to align with the application's throughput, effectively reducing latency for end-users and seamlessly accommodating shifting application needs.We have implemented Blockmess in a practical cryptocurrency application, validating its efficacy and deploying it in a large scale distributed environment. Notably, Blockmess builds upon and refines existing state-of-the-art scalability solutions, substantially mitigating latency degradation by intelligently adapting the number of active chains in response to the application's load.
AB - In the realm of Distributed Ledgers (DLs), a solution to enhancing maximum peak throughput involves establishing multiple independent blockchains that evolve concurrently. However, an excess of parallel chains in comparison to the application's demands can result in increased latency in content delivery, squandered bandwidth, and heightened computational strain on network nodes.Our innovation, Blockmess, introduces a novel parallel chain DL architecture. This solution dynamically adjusts the number of active parallel chains to align with the application's throughput, effectively reducing latency for end-users and seamlessly accommodating shifting application needs.We have implemented Blockmess in a practical cryptocurrency application, validating its efficacy and deploying it in a large scale distributed environment. Notably, Blockmess builds upon and refines existing state-of-the-art scalability solutions, substantially mitigating latency degradation by intelligently adapting the number of active chains in response to the application's load.
KW - blockchain scalability
KW - elastic consensus
UR - http://www.scopus.com/inward/record.url?scp=85197661878&partnerID=8YFLogxK
U2 - 10.1145/3605098.3635956
DO - 10.1145/3605098.3635956
M3 - Conference contribution
AN - SCOPUS:85197661878
T3 - Proceedings of the ACM Symposium on Applied Computing
SP - 226
EP - 234
BT - SAC '24
PB - ACM - Association for Computing Machinery
CY - New York
T2 - 39th Annual ACM Symposium on Applied Computing, SAC 2024
Y2 - 8 April 2024 through 12 April 2024
ER -