Characterizing Performance Limits of Cross‐Chain Framework: A Queuing‐Theoretic Perspective
- 18 October 2026
- journal article
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 38 (20)
Abstract
Currently, the cross‐chain field lacks a systematic performance evaluation framework that combines theoretical rigor with engineering scalability. Existing models struggle to accommodate multilevel serial architectures based on relay mechanisms and often overlook various engineering constraints and operational anomalies. This results in significant discrepancies between theoretical findings and actual operational characteristics. To address the aforementioned research gap, this article selects BitXHub, a representative distributed relay‐based cross‐chain framework, as the subject of study and constructs a two‐stage tandem network performance analytical model based on queuing theory. Key innovations include: (1) Incorporating real‐world cross‐chain anomalies, such as consensus failures and transaction retransmissions, to adjust service rates (modeled as exponential distributions) and mitigate errors arising from the idealized assumptions of traditional models. (2) Characterizing the number of transactions per block using a stochastic distribution rather than a fixed block size, thereby aligning the model with the system's mechanism of batch‐producing block at scheduled intervals. (3) Decomposing BitXHub's relay operations into a two‐stage subsystem and deriving key performance metrics, such as transaction latency and throughput—by combining the matrix geometric method with the Laplace–Stieltjes transform. (4) Establishing an experimental testbed based on the open source BitXHub platform and validating the model using actual operational parameters. Experimental results demonstrate that block size, transaction pool limits, and transaction load are the primary factors determining cross‐chain throughput and latency. The system exhibits robustness against service rate fluctuations under light to moderate loads, whereas performance volatility increases significantly as the load approaches the saturation threshold.Keywords
This publication has 31 references indexed in Scilit:
- An Understandable Cross-Chain Authentication Mechanism for JointCloud ComputingJournal of Computer Science and Technology, 2025
- Analysis of blockchain system based on $BMAP/PH^{[b]}/1$ queueing modelThe Journal of Supercomputing, 2024
- A dynamic state sharding blockchain architecture for scalable and secure crowdsourcing systemsJournal of Network and Computer Applications, 2023
- Chainlink2022
- Baguena: A Practical Proof of Stake Protocol with a Robust Delegation MechanismChinese Journal of Electronics, 2020
- Performance modeling and analysis of a Hyperledger-based system using GSPNComputer Communications, 2020
- Performance analysis of Hyperledger Fabric platform: A hierarchical model approachPeer-to-Peer Networking and Applications, 2020
- Transaction-Confirmation Time for Bitcoin: A Queueing Analytical Approach to Blockchain Mechanism2017
- On the Solution to QBD Processes with Finite State SpaceStochastic Analysis and Applications, 2007
- Queueing Theory with Applications to Packet Telecommunication2005