.png){kind=icon}
.png){kind=icon}
Return
Scalable Multidomain Service Transactions via Hierarchical Conflict-Aware Scheduling and Digest-Based Batch Commit
.png){kind=icon}
PRE
AI
K
J
Z
王
DOI：10.1109/jiot.2026.3704443.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multidomain service platforms increasingly require atomic workflows that span multiple autonomous domains with shared mutable states (e.g., blockchains, databases, and stateful microservices). Such settings face three practical challenges: delayed state visibility across domains, black box internal scheduling inside each domain, and complex dependency cycles that span domains. To address these challenges, we propose a practical framework for multidomain service transactions in deployments, where participating domains accept ordered batches endorsed by a Byzantine fault-tolerant validator set (e.g., permissioned domains governed by a shared BFT group). First, we formalize the optimal cross-domain serializable schedule (<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$OCS^{2}$ </tex-math></inline-formula>) problem and prove its NP-hardness. Second, we introduce a unified transaction footprint model that integrates account-based and UTXO-based semantics for universal conflict detection across heterogeneous domains. Third, we propose the hierarchical conflict-aware scheduling (HCS) algorithm that transforms the NP-hard <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$OCS^{2}$ </tex-math></inline-formula> problem into parallelizable subproblems through hierarchical decomposition. Finally, we design a hierarchical optimistic batch commit (HOBC) that shifts agreement from individual transactions to batch-level result digests. To handle delayed visibility and state drift between analysis and execution, the protocol validates execution-time preconditions and safely aborts transactions whose prerequisites are no longer satisfied, without compromising correctness. Our prototype evaluation shows improved concurrence efficiency under contention while preserving end-to-end correctness for cross-domain service transactions.
Keywords:
Concurrence control
conflict-aware scheduling
digest-based commit
multidomain service transactions
workflow orchestration
Journal
IF:
8.9
Papers:
1.4W
Citations:
7.8W
Organization
Cited Papers