Reputation-based Q-Routing for Robust Inter-committee Routing in the Sharding-based Blockchain

摘要

The fault-tolerant consensus problem has been extensively studied in the distributed systems era since the late 1970s. It has regained popularity with the rise of blockchain. However, the scalability and efficiency issues remain to be the challenges in the consensus. One of the solutions is using sharding algorithms to partition networks into several committees. However, previous work does not consider Byzantine problem during the inter-committee routing. In this paper, we propose a Reputation-based Q-routing algorithm using reinforcement learning to assist the communication procedure between different shards. Through the modification of Q-routing protocol, our algorithm can efficiently withstand some of the Byzantine failures. Moreover, to resist routing information tampering, we design a hierarchical structure that uses BFT to validate the routing tables. The experiments show the robustness of routing algorithm brought by reinforcement learning in the verification procedure of sharding-based consensus.