Jul 2026· Annual International Computer Software and Applications Conference· pp. 975-980· 0 citations· 18 references
Computer Science
Abstract
The widespread adoption of decentralized identity (DID) is constrained by blockchain scalability issues. Mainstream Layer 1 blockchains are costly, while generic Layer 2 Rollups face the “Noisy Neighbor” problem, where identity operations compete with DeFi traffic, causing unpredictable delays. To address this, we propose EM-DID, an Elastic Multiinstance DID Architecture. Unlike static chains, EM-DID treats Layer 2 execution environments as dynamic resources. The system employs three novel mechanisms: an Auto-Scaling Manager utilizing a Warm Pool strategy for near-zero coldstart latency and Hysteresis to prevent resource oscillation; a QoS-Aware Scheduling Algorithm that routes requests based on cost-latency trade-offs; and a Hierarchical State Aggregation Protocol that compresses proofs from multiple instances into a single Layer 1 transaction. Experiments demonstrate that EM-DID achieves linear scalability. While a single simulation instance sustains 600 TPS constrained by the testbed environment, the architecture supports horizontal scaling to thousands of TPS by adding instances without degradation. The architecture reduces gas costs by 99.76% compared to Layer 1 and minimizes average latency by approximately 94% through intelligent routing. EM-DID provides a viable path for deploying high-frequency, self-sovereign identity services in scenarios such as the Internet of Things (IoT).
Blockchain technology enables decentralized trust, yet traditional blockchain networks face critical scalability limitations under large-scale deployments. Sharding improves throughput through parallel processing, but existing sharded BFT architectures still suffer from severe hierarchical coupling between shards and the verification committee. Moreover, the complex asynchronous competition and backoff/retransmission dynamics in sharded blockchain services remain largely unmodeled, leaving the network-level steady-state behavior of sharded blockchains poorly understood. To address these challenges, we propose D2S-BFT, a novel Decoupled Double-Star Byzantine Fault-Tolerant architecture, which physically decouples local intra-shard consensus from global verification. For rigorous performance evaluation, we establish a randomized-service double-star service system and cast the cross-shard competition mechanism as a finite-source Markov chain. We derive the state transition probability matrix under general load conditions, compute the extended sojourn time, and construct an end-to-end transaction on-chain latency equation that explicitly incorporates encryption overhead, network delay, and queuing delay. The resulting D2S queuing model, expressed in the non-classical Kendall notation L/G/n=2/inf/L-RSS, provides strict theoretical boundary constraints on system performance. It demonstrates that D2S-BFT can effectively alleviate transaction congestion and ensure robust operation, while also laying a rigorous analytical foundation for model-driven configuration optimization in large-scale dynamic blockchain environments.
Ji-Qiang Liu, Lijun Sun, Xiao Chen et al.· 2026 International Conferenc...· 0 citations
Persistent spatial anchors are essential for enabling shared and collaborative mixed reality (MR) experiences, but current anchor management mechanisms are typically centralized and lack transparent governance across multiple stakeholders. To this end, we explore a blockchain-based approach for governing spatial anchors in multi-user MR environments. We design and implement a decentralized anchor registry using a permissioned blockchain architecture that supports auditable anchor lifecycle management and cross-organization validation. A prototype system integrating a blockchain network, gateway services, and an MR client is developed to evaluate feasibility. Experimental results demonstrate that the proposed architecture can govern anchor lifecycle operations without degrading on-device rendering performance, while revealing a substantial gap between server-side and headset-experienced synchronization latency. We further analyze system performance from both server-side and device-side perspectives, highlighting the importance of client-experienced latency in MR deployments. The evaluation also shows that appropriate blockchain configuration can significantly reduce governance latency: tuning BatchTimeout from 2s to 500ms lowers latency by about 70% (from 5449ms to 1635ms) without affecting rendering performance on the MR device.
Jubayer Hossain, M. Mahmud, Hong-Hui Xu et al.· International Conference on...· 0 citations
In blockchain systems, transaction order directly determines financial outcomes: unfair ordering enables front-running and sandwich attacks that have extracted over \$686M from Ethereum users. Current fair-ordering protocols aggregate pairwise receive-order evidence from replicas. Under contention or adversarial manipulation, however, Condorcet cycles force them into global strongly connected component (SCC) condensation, causing delays, coarse batches, and scaling failures. We present FlashOrder, a deterministic fair-ordering engine that localizes cyclic ambiguity before it propagates across the batch. FlashOrder embeds pairwise preferences into one-dimensional canonical positions, clusters nearby transactions with a partition hypergraph, and performs hierarchical inter- and intra-cluster serialization, replacing batch-wide SCC condensation with localized sorting and aggregation. Evaluated against Themis (CCS'23) and Rashnu (VLDB'24) on a libhotstuff-based prototype, FlashOrder achieves up to 10.5$\times$ higher throughput than Themis and 4.8$\times$ higher than Rashnu, with the latency gap widening as network scales. In controlled adversarial simulation, it reduces maximum rank displacement by 88.7\%, and under Condorcet attacks it sustains 12.0$\times$ and 9.7$\times$ higher throughput than Themis and Rashnu on average. These results show that localizing cyclic ambiguity yields stronger fairness at substantially higher throughput.
Jinchun He, Wangjie Qiu, Yi-Zhong Liu et al.· 0 citations
In blockchain systems, peer-to-peer (P2P) overlay networks play a crucial role in providing reliable, scalable and efficient message-delivery services to upper layers. However, the consensus layer and the underlying P2P network remain mutually opaque in existing blockchains, waiving the opportunity for further improvement. In contrast to other P2P applications, blockchain can naturally be abstracted as a state machine. We therefore leverage this abstraction to record network topologies and latencies in a trusted and coordinated manner. With this support, we propose three improvements to rotating-leader consensus protocols and their underlying P2P networks: (1) accelerating leader rotation; (2) introducing a reliable-broadcast paradigm that employs tree-based dissemination in the normal case and falls back to gossip only when necessary; and (3) constructing latency-aware dissemination trees. We integrate the above ideas into Tendermint and libp2p, and conduct empirical evaluation on Amazon EC2 platform using up to 300 nodes distributed across 10 regions. The results demonstrate that, compared with gossip-based dissemination over the same topology, our prototype improves peak throughput by up to $7.26\times$.
Yifeng Ye, Rongji Huang, Gerui Wang et al.· arXiv.org· 0 citations
The Domain Name System (DNS) has long served as the predominant solution for domain name resolution. However, the existing DNS under a unilateralist framework presents vulnerabilities in security management, which can adversely impact thequality of domain resolution services. Consequently, the development of a highly secure DNS is of paramount importance. To address this issue, we propose a blockchain-based domain name system architecture named RNS, which resolves the unilateralism inherent in traditional DNS through decentralized domain resolution services. We enhance the system's scalabilityby incorporating relay chains.Furthermore, to ensure the security and decentralized characteristics of RNS, we employ Decentralized Identifiers (DID) as the domain identity authentication framework. Experimental results demonstrate that, compared to existing solutions, RNS achieves improved throughputand reduced transaction communication latency, thereby offering an innovative approach that integrates security, high performance, and scalability for applications involving domain resolution in complex network architectures.
A blockchain-enabled trusted routing scheme for SDN inter-domain communication, denoted as BTR-SDN, which achieves a 20.5% higher malicious node detection rate and improves bandwidth utilization by 10.7% compared to benchmark schemes, maintaining high throughput even under dynamic adversarial conditions.
Shuang Yang, Zhongsheng Jiang, Wansu Pan et al.· Journal of Network and Syste...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
