WO2018209543A1 - 一种多层级区块链系统之间索引与链拓扑结构的维护方法 - Google Patents

一种多层级区块链系统之间索引与链拓扑结构的维护方法 Download PDF

Info

Publication number
WO2018209543A1
WO2018209543A1 PCT/CN2017/084432 CN2017084432W WO2018209543A1 WO 2018209543 A1 WO2018209543 A1 WO 2018209543A1 CN 2017084432 W CN2017084432 W CN 2017084432W WO 2018209543 A1 WO2018209543 A1 WO 2018209543A1
Authority
WO
WIPO (PCT)
Prior art keywords
blockchain
node
level
seed node
seed
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2017/084432
Other languages
English (en)
French (fr)
Inventor
李挥
李昊鹏
马化军
王菡
李恪聃
杨昕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Saisipeng Science Technology Development Shenzhen Co Ltd
Peking University Shenzhen Graduate School
Original Assignee
Saisipeng Science Technology Development Shenzhen Co Ltd
Peking University Shenzhen Graduate School
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Saisipeng Science Technology Development Shenzhen Co Ltd, Peking University Shenzhen Graduate School filed Critical Saisipeng Science Technology Development Shenzhen Co Ltd
Priority to CN201780003416.0A priority Critical patent/CN108323232B/zh
Priority to PCT/CN2017/084432 priority patent/WO2018209543A1/zh
Priority to US15/997,726 priority patent/US20180337847A1/en
Publication of WO2018209543A1 publication Critical patent/WO2018209543A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/021—Ensuring consistency of routing table updates, e.g. by using epoch numbers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/04—Network management architectures or arrangements
    • H04L41/044—Network management architectures or arrangements comprising hierarchical management structures
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/1805—Append-only file systems, e.g. using logs or journals to store data
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/10—File systems; File servers
    • G06F16/18—File system types
    • G06F16/182—Distributed file systems
    • G06F16/1834—Distributed file systems implemented based on peer-to-peer networks, e.g. gnutella
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/04—Network management architectures or arrangements
    • H04L41/042—Network management architectures or arrangements comprising distributed management centres cooperatively managing the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/0823—Configuration setting characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/02—Topology update or discovery
    • H04L45/025—Updating only a limited number of routers, e.g. fish-eye update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/64—Routing or path finding of packets in data switching networks using an overlay routing layer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/70—Routing based on monitoring results
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/02—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP]
    • H04L67/025—Protocols based on web technology, e.g. hypertext transfer protocol [HTTP] for remote control or remote monitoring of applications
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1004—Server selection for load balancing
    • H04L67/1008—Server selection for load balancing based on parameters of servers, e.g. available memory or workload
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1029—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers using data related to the state of servers by a load balancer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
    • H04L67/1034—Reaction to server failures by a load balancer
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1048—Departure or maintenance mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1059—Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/08—Protocols for interworking; Protocol conversion
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/54—Organization of routing tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
    • H04L67/1065—Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] 

Definitions

  • the present invention belongs to the field of Internet technology improvement, and in particular, to a method for maintaining an index and a chain topology between multi-level blockchain systems.
  • the economic attribute of stripping bitcoin which relies on the blockchain technology, has a very good application prospect.
  • the blockchain originating from Bitcoin is an intelligent peer-to-peer network that uses distributed databases to identify, propagate, and record information. It is a string of data blocks generated by cryptography, and each block contains several times. Bitcoin network transaction information used to verify the validity of its information (anti-counterfeiting) and generate the next block.
  • a blockchain network there are no core nodes, all nodes have the same function and rights, and all nodes use a consensus algorithm to compete for the next round of billers.
  • Each side chain has different definitions and execution logics for the lower blockchain. There is no standard interface for unified positioning, and there is no unified maintenance mode.
  • the present invention is implemented as a method for maintaining an index and chain topology between multi-level blockchain systems, and the maintenance method includes the following steps:
  • the top-level blockchain records the next lower-level blockchain by recording the next seed node index in the transaction record of the block.
  • the P address and port availability are periodically checked
  • Each node of the lower blockchain needs to maintain a common global routing table structure to store the topology of the entire blockchain cluster, and maintain the final consistency of the global routing table by using the Gossip-based protocol propagation mode.
  • step B further includes the following steps:
  • Bl notify the lower blockchain manager of the failure of the seed node and maintain the seed node Or modify.
  • a further technical solution of the present invention is: any node on the chain in the step C obtains corresponding data and services by acquiring an IP address and a port of any available node.
  • a further technical solution of the present invention is:
  • the top-level blockchain uses the Coinbase field in the transaction to record the corresponding seed node.
  • a further technical solution of the present invention is: the node in the top-level blockchain can obtain the load information of the seed node from the monitoring node by using the cache seed node list.
  • a further technical solution of the present invention is:
  • the server of the lower blockchain ensures the validity of the seed node and updates the list of seed nodes through the accounting process of the blockchain.
  • a further technical solution of the present invention is: the client-index lower-layer blockchain in the top-level blockchain acquires corresponding data and services.
  • a further technical solution of the present invention is: the node connecting the client to any lower blockchain can obtain the service or data that it needs.
  • a further technical solution of the present invention is: the top blockchain obtains the load condition of the seed node by periodically querying the monitoring cluster.
  • multi-level blockchain can quickly pass the record index in the blockchain to the lower-level blockchain; since the top node of the complete blockchain is maintained above the seed node, Therefore, any client can obtain the responding node of the complete blockchain through the seed node; the distributed monitoring cluster can maintain the activity of the seed node, and the seed node can be load balanced by monitoring the cluster; the same uses the distributed ledger
  • the technology avoids system failure caused by a single point of failure. Through the maintenance of the routing table of the node, the maintenance of the global topology of the blockchain and the load balancing of each node can be realized.
  • 1 is a method for maintaining an index and a chain topology between a multi-level blockchain system according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram of an overall system architecture provided by an embodiment of the present invention.
  • FIG. 3 is a data structure of a Coinbase according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of data types of a seed according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of maintenance of a topology structure of a lower layer blockchain according to an embodiment of the present invention.
  • FIG. 6 is a flowchart of a client response request according to an embodiment of the present invention.
  • the present invention proposes a method for maintaining index and chain topology between multi-level blockchain systems, and proposes a method for maintaining cross-chain index and chain topology maintenance between multi-level blockchain systems.
  • the peers greatly improve the efficiency and scalability of the index.
  • a method for maintaining index and chain topology between multi-level blockchain systems satisfies the following three characteristics
  • the entire blockchain system is organized by a hierarchical structure, and the lower blockchain chain is indexed by the top-level blockchain to realize different functional layering and customization.
  • the lower chain can implement different processing implementation logic to achieve different functions, which reduces the coupling degree of the system and achieves more diverse service customization.
  • an indexing mechanism must be designed to ensure that the system is robust enough, and the seed nodes recorded through the top chain can be correctly indexed. Lower chain.
  • the client does not need to know the distribution structure of the chain and the load of the chain nodes. It is necessary to locate the server corresponding to the provided data through the index of the multi-level blockchain, and the entire indexing process is required to be completely transparent to the user.
  • the network is composed of a plurality of blockchains, and the top blockchain links through the information recorded in the blockchain.
  • Lower blockchain
  • the topology of the lower block chain is composed of multiple nodes and is constantly changing. Therefore, it is not preferable for the upper node to store the topology of the lower chain. So we keep the index of the upper blockchain to the lower blockchain by recording a list of seed nodes, ⁇ Use a third-party distributed monitoring cluster to ensure seed node availability and load balancing, while the lower-level blockchain maintains the topology of the blockchain itself through a globally visible routing table, and for customers from the top-level index End service requests implement load balancing.
  • FIG. 1 is a flow chart showing a method for maintaining an index and chain topology between multi-level blockchain systems provided by the present invention, which is described in detail as follows:
  • Step S1 the top blockchain records the next seed node chain in the transaction record of the block; the top block chain records the next seed node list in the transaction record of the block. To index the lower blockchain.
  • the Coinbase field in the transaction in the blockchain is used to record the corresponding seed node, and at least one available seed node exists in the field record, so that the next client can index to
  • the lower blockchain is used to obtain the corresponding data and services.
  • node interruption or failure is a normal event. Therefore, the service provider of the lower blockchain needs to ensure the validity of the seed node, and the list of seed nodes can be updated through the accounting process of the blockchain.
  • the client obtains the Coinbase field through the top-level chain to parse the corresponding data type to obtain the location of the corresponding seed node.
  • the nodes in the top-level chain can cache the seed node list and the peers can obtain the load information of the seed node from the monitoring node, and sort the corresponding seed nodes by the load from small to large, so the client preferentially connects in the lower blockchain.
  • a node with a lower load can cache the seed node list and the peers can obtain the load information of the seed node from the monitoring node, and sort the corresponding seed nodes by the load from small to large, so the client preferentially connects in the lower blockchain.
  • Step S2 maintaining a distributed monitoring cluster periodically periodically periodically checks the availability of the corresponding IP address and port under the seed node list recorded in the top-level blockchain; maintaining a distributed monitoring cluster periodically records the top-level blockchain The availability of the corresponding IP address and port under the seed node list is periodically detected. Once the seed node is found to be invalid, the lower blockchain manager needs to be notified to maintain or modify the seed node (by modifying the record of the top blockchain).
  • the distributed monitoring cluster is built by an odd number of servers, and the activity of the corresponding seed node is monitored in a comprehensive manner by the paxos-like protocol. Since the distributed monitoring cluster uses a paxos-like coherence protocol, if only half or more of the clusters are used In the case of a node failure, the distributed monitoring cluster will fail.
  • the seed node actively initiates a heartbeat detection of health to the monitoring cluster, and periodically reports its running status and the running status of the blockchain.
  • the monitoring cluster also compares the list of seed nodes indexed by the top-level blockchain with the list of seed nodes on the connection. If the seed node fails, the monitoring cluster can notify the lower blockchain. The operation and maintenance personnel perform the repair work of the seed node.
  • the peer monitoring cluster also records the load status of each seed node.
  • the top-level blockchain node can obtain the load status of the seed node by periodically querying the monitoring cluster.
  • Step S3 each node of the lower blockchain needs to maintain a common global routing table structure to store the topology of the entire blockchain cluster, and maintain the final consistency of the global routing table by using a Gossip-based protocol propagation mode. .
  • Each node in the lower blockchain maintains a common global routing table structure to record the topology of the entire blockchain cluster, that is, any node in the lower blockchain can act as mentioned in 2.2.1. Seed node.
  • the routing table needs to record the IP addresses, port numbers, node IDs, and load conditions of the nodes in the lower blockchain chain, through such a global or local nature routing table, from any one of the lower blockchains
  • the node can index the topology of the entire blockchain. Since the blockchain itself is a distributed global ledger, the client can obtain the services or data it needs by connecting any node of the lower blockchain.
  • the peer routing table the unique global blockchain ID of the lower blockchain is identified, the routing table is created, and the routing table is last modified.
  • the nodes of the lower blockchain need to intermittently write the contents of the routing table to the persistent storage local to the node.
  • the node resumes work from the failed state, it will preferentially restore the routing table of the blockchain from the local persistent storage, and compare the last modification between the local time of the node and the routing table, if the table is modified If the local time is similar, the routing table is considered to be legal.
  • the remaining nodes are connected through the records in the routing table, and the latest state of the routing table is restored through the Gossip protocol. If the table expires too long, the node can try to index the seed node of the top blockchain record, and then obtain the routing table on the seed node through the Gossip protocol.
  • Each node needs to maintain the routing table of the node by itself, and the table propagates the change of the node through the Gossip-based protocol.
  • Each node randomly selects a random peer node every second, and the two nodes effectively coordinate their corresponding routes.
  • the table records the node conditions to maintain the final consistency of the routing tables of the various nodes. If the lower blockchain is a private chain, this routing table is required to record the information of the global node. If the number of nodes is too large, you can use the p2p routing protocol Chord. Each node in the Chord protocol maintains an O(logN) routing table. You can jump to the required access within 0 (logN) hop. The node.
  • the client wants to acquire data in the lower blockchain.
  • the client can connect to the nodes in the top blockchain. Get the list of seed nodes in the top-level blockchain that record the lower blockchain. The client will try to access the first available seed node in turn in the order in which the seed node list is returned.
  • the local routing table of the node is queried, and the relationship between the node IP address and the load is returned to the list of blockchain nodes accessible by the client.
  • the client receives the current node return blockchain node list, it will record the current node load overload.
  • Companion Replaces the list of blockchain nodes returned by the current node with the list of blockchain nodes in the local cache, repeats the access action in the order of the node list, and attaches a list to the accessed packets.
  • the list records the failed nodes that were accessed by the client before, and the overloaded nodes and the corresponding access points.
  • the accessed node also dynamically updates the information to its own routing table through the information provided by the client, and spreads the latest routing information to other blockchain nodes in the entire network through the ossip protocol.
  • the main problems of the multi-level blockchain system are solved: (1) The multi-level blockchain can quickly pass through the zone. The records in the blockchain are indexed to the lower level of the blockchain. (2) Since the topology of a complete blockchain is maintained on the seed node, any client can obtain the respondable node of the complete blockchain through the seed node. (3) The distributed monitoring cluster can maintain the activity of the seed node, and the seed node can achieve load balancing by monitoring the cluster. (4) Peer-to-peer uses distributed ledger technology to avoid system failure caused by single point of failure. (5) Through the maintenance of the routing table of the node, the maintenance of the global topology of the blockchain and the load balancing of each node can be realized.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Computing Systems (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

本发明涉及一种多层级区块链系统之间索引与链拓扑结构的维护方法，包括：A、顶层区块链通过在区块的交易记录中记录下一个种子节点索引下层区块链；B、维护一个分布式监控集群定期对顶级区块链中记录的种子节点列表下对应IP地址与端口的可用性进行定期检测；C、下层区块链的每个节点需要维护一个共同的全局路由表结构来存储整个区块链集群的拓扑结构，通过基于Gossip的协议传播方式来维护全局路由表的最终一致性。多层级的区块链可以快速通过区块链中的记录索引到下层级的区块链；由于种子节点之上维护了一个完整区块链的拓扑结构，所以任意客户端可以通过种子节点获取完整区块链的可响应节点。

Description

一种多层级区块链系统之间索引与链拓扑结构的维护方法
技术领域
[0001] 本发明属于互联网技术改进领域， 尤其涉及一种多层级区块链系统之间索引与 链拓扑结构的维护方法。
背景技术
[0002] 2008年 11月 1日， 一个自称中本聪 (Satoshi Nakamoto)的人在一个隐秘的密码学 讨论组上贴出了一篇研究报告， 报告阐述了他对电子货币的新构想一比特币 就此问世。 而剥离比特币的经济属性， 其依托的区块链技术， 具有非常好的应 用前景。 起源自比特币的区块链是用分布式数据库识别、 传播和记载信息的智 能化对等网络， 它是一串使用密码学方法相关联产生的数据块， 每一个数据块 中包含了若干次比特币网络交易的信息， 用于验证其信息的有效性 （防伪） 和 生成下一个区块。 在区块链网络中， 没有核心节点， 所有节点的功能、 权益都 是一样， 所有节点使用一种共识的算法争做下一轮的记账人。
[0003] 在这种网络中， 所有的节点都遵循既定的规则， 所有的结果都要经过多数节点 确认。 通过这样的架构形式， 确保了分布式系统在拜占庭将军问题下依旧能够 达成最终一致性。 基于这种技术思想， 我们希望能够通过多层级的区块链串联 的方式， 实现一个高内聚， 低耦合的服务系统。 而其中核心的问题在与如何将 多条区块链的连接， 同吋怎样去维护区块链的拓扑架构， 让提供的服务具有高 效性， 可用性与健壮性。
[0004] 目前基于比特币延伸出的楔入式侧链技术 （pegged sidechains) ， 就像英镑 挂钩到金条一样。 侧链是以融合的方式实现加密货币金融生态的目标， 而不是 像其它加密货币一样排斥现有的系统。 它将实现比特币和其他数字资产在多个 区块链间的转移， 这就意味着用户们在使用他们已有资产的情况下， 就可以访 问新的加密货币系统。 可以存在多个链接到比特币上的侧链， 特性和目的各不 相同， 所有这些侧链依赖于比特币主区块链保障的弹性和稀缺性。 在这基础上 ， 侧链技术进一步扩展了区块链技术的应用范围和创新空间， 使传统区块链可 以支持多种资产类型， 以及小微支付、 智能合约、 安全处理机制、 真实世界财 产注册等， 并可以增强区块链的隐私保护。
技术问题
[0005] 现有的楔入式侧链技术存在着一些缺陷。
[0006] a. 过度耦合： 过度依赖比特币的主区块链， 将一切安全性与一致性的保障依 托于比特币的主区块链， 但由于比特币设计之初并没有考量楔入式侧链的存在
， 导致跨链的流程复杂且耦合度极高。
[0007] b. 功能局限： 沿用了比特币通过密码货币的设计， 功能点集中于资产运作， 账户管理， 过于局限了区块链本身能够提供的服务。 并没有发挥区块链本身模 块化， 功能可定制化的特性。
[0008] c 管理混乱： 各个侧链对于下层区块链定义与执行逻辑各不相同， 没有统一 定位的标准接口， 并没有统一的维护的方式。
问题的解决方案
技术解决方案
[0009] 本发明的目的在于提供一种多层级区块链系统之间索引与链拓扑结构的维护方 法， 旨在解决的问题。
[0010] 本发明是这样实现的， 一种多层级区块链系统之间索引与链拓扑结构的维护方 法， 所述维护方法包括以下步骤：
[0011] A、 顶层区块链通过在区块的交易记录中记录下一个种子节点索引下层区块链
[0012] B、 维护一个分布式监控集群定期对顶级区块链中记录的种子节点列表下对应 I
P地址与端口的可用性进行定期检测；
[0013] C、 下层区块链的每个节点需要维护一个共同的全局路由表结构来存储整个区 块链集群的拓扑结构， 通过基于 Gossip的协议传播方式来维护全局路由表的最终 一致性。
[0014] 本发明的进一步技术方案是： 所述步骤 B中还包括以下步骤：
[0015] Bl、 在发现种子节点失效对下层区块链管理者进行通知并对种子节点进行维护 或修改。
[0016] 本发明的进一步技术方案是： 所述步骤 C中链上的任意一个节点通过获取任意 一个可用节点的 IP地址与端口获取对应的数据与服务。
[0017] 本发明的进一步技术方案是： 所述顶级区块链使用交易中的 Coinbase字段来记 录对应的种子节点。
[0018] 本发明的进一步技术方案是： 所述顶级区块链中的节点可以通过缓存种子节点 列表从监控节点获取种子节点的负载信息。
[0019] 本发明的进一步技术方案是： 所述下层区块链的服务者确保种子节点有效性并 通过区块链的记账流程更新种子节点的列表。
[0020] 本发明的进一步技术方案是： 所述顶层区块链中客户端索引下层区块链获取对 应的数据与服务。
[0021] 本发明的进一步技术方案是： 所述客户端连接任意下层区块链的节点均可以获 取自己需要的服务或数据。
[0022] 本发明的进一步技术方案是： 所述顶层区块链通过定期査询监控集群获取种子 节点的负载情况。
发明的有益效果
有益效果
[0023] 本发明的有益效果是： 多层级的区块链可以快速通过区块链中的记录索引到下 层级的区块链； 由于种子节点之上维护了一个完整区块链的拓扑结构， 所以任 意客户端可以通过种子节点获取完整区块链的可响应节点； 通过分布式监控集 群可以维系种子节点的活性， 同吋可以通过监控集群让种子节点实现负载均衡 ； 同吋使用了分布式账本技术， 避免了因单点故障导致的系统失效； 通过节点 的路由表维护， 可以实现区块链全局拓扑结构的维护与各个节点的负载均衡。 对附图的简要说明
附图说明
[0024] 图 1是本发明实施例提供的多层级区块链系统之间索引与链拓扑结构的维护方 法；
[0025] 图 2是本发明实施例提供的整体系统架构图。 [0026] 图 3是本发明实施例提供的 Coinbase的数据结构。
[0027] 图 4是本发明实施例提供的 seed的数据类型示意图。
[0028] 图 5是本发明实施例提供的下层区块链的拓扑结构的维护的示意图。
[0029] 图 6是本发明实施例提供的客户端响应请求的流程图。
实施该发明的最佳实施例
本发明的最佳实施方式
[0030] 在此处键入本发明的最佳实施方式描述段落。
本发明的实施方式
[0031] 本发明提出一种多层级区块链系统之间索引与链拓扑结构的维护方法， 提出了 一套基于多层级区块链系统之间的跨链索引与链拓扑结构维护统一的方式， 同 吋很大程度上提高了索引的效率与扩展性， 利用区块链的分布式性质来实现负 载均衡， 可以很容易的组织起一个低耦合的多层级区块链系统， 同吋减少系统 的维护成本。
[0032] 一种多层级区块链系统之间索引与链拓扑结构的维护方法满足下面 3个特点
： ( 1) 通过层级结构来组织整个区块链系统， 由顶层区块链索引下层的区块链 ， 来实现不同功能分层与定制。 下层链可以实现不同的处理实现逻辑， 来实现 不同的功能， 通过这样降低了系统的耦合度， 同吋实现了更加多样性的服务定 制。 （2) 由于上层链索引到下层链的节点并不能保证稳定 （故障或退出） ， 必 须设计一套索引机制来确保系统具有足够的健壮性， 透过顶层链记录的种子节 点可以正确的索引到下层链。 （3) 客户端并不用知道链的分布组织结构以及链 节点的负载情况， 需要通过多层级区块链的索引来定位对应所提供数据的服务 器， 要求整个索引过程对用户完全透明。
[0033] 使用一种基于多层级区块链组建一个的区块链服务网络， 该网络由多条区 块链共同组成维护， 顶层区块链通过区块链中记录的信息来索弓 I到下层区块链
。 但由于下层区块链链节点数目不确定， 所以下层区块链的拓扑结构由多个节 点构成并且不断变化， 所以由上层节点来存储下层链的拓扑结构并不可取。 所 以我们通过记录一个种子节点列表来维系上层区块链到下层区块链的索引， 同 吋使用一个第三方的分布式监控集群来确保种子节点的可用性与负载均衡， 而 下层区块链通过全局可见的路由表来维护区块链本身的拓扑结构， 并且对于由 顶层索引下来的来自客户端服务请求实现负载平衡。
[0034] 图 1示出了本发明提供的多层级区块链系统之间索引与链拓扑结构的维护方法 的流程图， 其详述如下：
[0035] 步骤 S 1， 顶层区块链通过在区块的交易记录中记录下一个种子节点索弓 I下层区 块链； 顶层区块链通过在区块的交易记录中记录下一个种子节点列表来索引下 层区块链。
[0036] 在顶层区块链中， 使用区块链中交易中的 Coinbase字段来记录对应的种子节点 ， 这个字段记录之中至少要存在一个可用的种子节点， 让接下来的客户端可以 索引到下层区块链来获取对应的数据与服务。 在下层的区块链的环境中， 节点 中断或失效是常态性的事件。 所以下层区块链的服务者需要确保种子节点有效 性， 同吋可以通过区块链的记账流程， 来更新种子节点的列表。 客户端通过顶 级链获取 Coinbase字段来解析对应的数据类型来获取对应种子节点的位置。 顶级 链中的节点可以通过缓存种子节点列表并且同吋可以从监控节点获取种子节点 的负载信息， 通过负载由小到大排序对应的种子节点， 所以客户端优先连接的 总是下层区块链中负载较低的节点。
[0037] 步骤 S2， 维护一个分布式监控集群定期对顶级区块链中记录的种子节点列表下 对应 IP地址与端口的可用性进行定期检测； 维护一个分布式监控集群定期对顶级 区块链中记录的种子节点列表下对应 IP地址与端口的可用性进行定期检测。 一旦 发现种子节点失效， 需要对下层区块链管理者进行通知， 要求对种子节点进行 维护或修改 （通过修改顶层区块链的记录） 。
[0038] 分布式监控集群由奇数个服务器搭建而成， 通过类 paxos的协议全盘监控对应 种子节点的活性， 由于分布式监控集群使用了类 paxos的一致性协议， 所以当且 仅当半数以上集群节点失效的情况下， 分布式监控集群才会失效。 种子节点会 主动向监控集群发起健康度的心跳检测， 定期汇报自己的运行状态和区块链的 运行状态。 而监控集群也会通过顶层区块链索引的种子节点的列表与连接上的 种子节点的列表进行比对。 若种子节点失效， 监控集群可以通知下层区块链的 运维人员， 进行种子节点的修复工作。 同吋监控集群也记录下每个种子节点的 负载情况， 顶层的区块链节点可通过定期査询监控集群的方式， 获取种子节点 的负载情况。
[0039] 步骤 S3， 下层区块链的每个节点需要维护一个共同的全局路由表结构来存储整 个区块链集群的拓扑结构， 通过基于 Gossip的协议传播方式来维护全局路由表的 最终一致性。
[0040] 下层区块链中每个节点维护一个共同的全局路由表结构来记录整个区块链集群 的拓扑结构， 也就是说下层区块链中的任意节点都可以充当 2.2.1中提及的种子 节点。
[0041] 路由表格需要记录下层区块链中其余节点的 IP地址， 端口号， 节点的 ID， 节点 对应的负载情况， 通过这样一个全局或局部性质的路由表， 从下层区块链的任 意一个节点可以索引出整个区块链的拓扑结构， 同吋由于区块链本身是一个分 布式的全局账本， 客户端只要连接任意下层区块链的节点， 都可以获取自己所 需的服务或数据。 同吋路由表中需要标识下层区块链的唯一全局区块链 ID， 路 由表的创建吋间， 路由表最后一次的修改吋间。 下层区块链的节点， 需要间隔 性的将路由表的内容写入节点本地的持久性存储。 若节点从失效状态恢复工作 ， 会优先从本地的持久性存储之中还原区块链的路由表， 同吋比对节点本地吋 间与路由表上最后修改的吋间， 若表格修改吋间与本地吋间相近， 则认为该路 由表合法， 通过路由表中的记录连接上其余节点， 通过 Gossip协议恢复到路由表 最新的状态。 若表格过期过久， 节点可尝试索引顶层区块链记录的种子节点， 之后也通过 Gossip协议获取种子节点上的路由表。 每个节点需要自行维护节点的 路由表， 同吋该表格通过基于 Gossip的协议来传播节点的变动， 每个节点每间隔 一秒随机选择随机的对等节点， 两个节点有效地协调他们对应路由表记录的节 点情况， 来维持各个节点路由表的最终一致性。 若下层区块链为私有链， 则要 求这张路由表记录全局节点的信息。 若为公有链， 节点数目过于庞大， 则可利 用 p2p的路由协议 Chord, Chord协议中每个结点维护 O(logN)大小的路由表， 在 0( logN)跳之内可以跳转到需要访问的结点。
[0042] 当客户端要获取下层区块链中数据。 首先客户端可连接顶层区块链中的节点， 获取顶层区块链中记录下层区块链的种子节点列表。 客户端会按照返回种子节 点列表的顺序， 尝试性地依次访问到首个可用的种子节点。 下层区块链中节点 收到客户端的访问请求会有两种处理逻辑： （1) 当前区块链的节点的负载量没 有超出预先设计的阀值， 则査询对应区块链上的数据， 响应客户端的请求。 （2
) 若当前区块链节点负载量超出预先设计的阀值， 则査询节点本地的路由表， 通过节点 IP地址与负载量的关系， 返回给客户端可访问的区块链节点列表。 客户 端收到当前节点返回区块链节点列表， 会先记录下当前节点负载量过载。 同吋 将当前节点返回的区块链节点列表替换本地缓存中的区块链节点列表， 按照节 点列表顺序， 重复访问动作， 同吋在访问的数据包中附带一个列表。 列表中记 录下客户端之前访问的失效节点， 过载节点与对应的访问吋间。 被访问节点也 会通过客户端提供的信息动态的更新这些信息到自己的路由表之中， 并且通过 G ossip协议， 将最新的路由信息扩散到全网中的其他区块链节点。
[0043] 在一种多层级区块链系统之间索引与链拓扑结构的维护方法中， 解决了多 层级区块链系统存在的主要问题： （1) 多层级的区块链可以快速通过区块链中 的记录索引到下层级的区块链。 （2) 由于种子节点之上维护了一个完整区块链 的拓扑结构， 所以任意客户端可以通过种子节点获取完整区块链的可响应节点 。 （3) 通过分布式监控集群可以维系种子节点的活性， 同吋可以通过监控集群 让种子节点实现负载均衡。 （4) 同吋使用了分布式账本技术， 避免了因单点故 障导致的系统失效。 （5) 通过节点的路由表维护， 可以实现区块链全局拓扑结 构的维护与各个节点的负载均衡。
[0044] 以上所述仅为本发明的较佳实施例而已， 并不用以限制本发明， 凡在本发明的 精神和原则之内所作的任何修改、 等同替换和改进等， 均应包含在本发明的保 护范围之内。
工业实用性
[0045] 在此处键入工业实用性描述段落。
序列表自由内容
[0046] 在此处键入序列表自由内容描述段落。

Claims

权利要求书
一种多层级区块链系统之间索引与链拓扑结构的维护方法， 其特征在 于， 所述维护方法包括以下步骤：
A、 顶层区块链通过在区块的交易记录中记录下一个种子节点索引下 层区块链；
B、 维护一个分布式监控集群定期对顶级区块链中记录的种子节点列 表下对应 IP地址与端口的可用性进行定期检测；
C、 下层区块链的每个节点需要维护一个共同的全局路由表结构来存 储整个区块链集群的拓扑结构， 通过基于 Gossip的协议传播方式来维 护全局路由表的最终一致性。
根据权利要求 1所述的维护方法， 其特征在于， 所述步骤 B中还包括 以下步骤：
Bl、 在发现种子节点失效对下层区块链管理者进行通知并对种子节 点进行维护或修改。
根据权利要求 2所述的维护方法， 其特征在于， 所述步骤 C中链上的 任意一个节点通过获取任意一个可用节点的 IP地址与端口获取对应的 数据与服务。
根据权利要求 3所述的维护方法， 其特征在于， 所述顶级区块链使用 交易中的 Coinbase字段来记录对应的种子节点。
根据权利要求 4所述的维护方法， 其特征在于， 所述顶级区块链中的 节点可以通过缓存种子节点列表从监控节点获取种子节点的负载信息 根据权利要求 5所述的维护方法， 其特征在于， 所述下层区块链的服 务者确保种子节点有效性并通过区块链的记账流程更新种子节点的列
[权利要求 7] 根据权利要求 6所述的维护方法， 其特征在于， 所述顶层区块链中客 户端索弓 I下层区块链获取对应的数据与服务。
[权利要求 8] 根据权利要求 7所述的维护方法， 其特征在于， 所述客户端连接任意 下层区块链的节点均可以获取自己需要的服务或数据。
[权利要求 9] 根据权利要求 8所述的维护方法， 其特征在于， 所述顶层区块链通过 定期査询监控集群获取种子节点的负载情况
PCT/CN2017/084432 2017-05-16 2017-05-16 一种多层级区块链系统之间索引与链拓扑结构的维护方法 Ceased WO2018209543A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CN201780003416.0A CN108323232B (zh) 2017-05-16 2017-05-16 一种多层级区块链系统之间索引与链拓扑结构的维护方法
PCT/CN2017/084432 WO2018209543A1 (zh) 2017-05-16 2017-05-16 一种多层级区块链系统之间索引与链拓扑结构的维护方法
US15/997,726 US20180337847A1 (en) 2017-05-16 2018-06-05 Indexing a multi-layer blockchain system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/084432 WO2018209543A1 (zh) 2017-05-16 2017-05-16 一种多层级区块链系统之间索引与链拓扑结构的维护方法

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/997,726 Continuation US20180337847A1 (en) 2017-05-16 2018-06-05 Indexing a multi-layer blockchain system

Publications (1)

Publication Number Publication Date
WO2018209543A1 true WO2018209543A1 (zh) 2018-11-22

Family

ID=62894136

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/084432 Ceased WO2018209543A1 (zh) 2017-05-16 2017-05-16 一种多层级区块链系统之间索引与链拓扑结构的维护方法

Country Status (3)

Country Link
US (1) US20180337847A1 (zh)
CN (1) CN108323232B (zh)
WO (1) WO2018209543A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112104517A (zh) * 2020-11-23 2020-12-18 腾讯科技（深圳）有限公司 一种基于区块链网络的数据处理方法及相关装置
CN113132139A (zh) * 2019-12-31 2021-07-16 国民技术股份有限公司 区块链成员管理方法及装置、电子设备及计算机可读介质

Families Citing this family (52)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20190005471A1 (en) * 2017-06-28 2019-01-03 Kitaru Innovations Inc. Method of operating and using a cryptocurrency
US11475420B2 (en) 2017-08-03 2022-10-18 Liquineq AG System and method for true peer-to-peer automatic teller machine transactions using mobile device payment systems
US10250708B1 (en) * 2017-12-26 2019-04-02 Akamai Technologies, Inc. High performance distributed system of record
US11551212B2 (en) * 2018-01-10 2023-01-10 Rajeev Malhotra Methods and systems for management of a blockchain-based computer-enabled networked ecosystem
US10924489B2 (en) * 2018-01-19 2021-02-16 International Business Machines Corporation Building trusted public blockchain networks based on participants' digital social behavior
US11030217B2 (en) * 2018-05-01 2021-06-08 International Business Machines Corporation Blockchain implementing cross-chain transactions
US11194837B2 (en) * 2018-05-01 2021-12-07 International Business Machines Corporation Blockchain implementing cross-chain transactions
EP3777111B1 (en) * 2018-05-07 2025-01-22 Convida Wireless, Llc Interworking between iot service layer systems and distributed ledger systems
US11159376B2 (en) * 2018-05-24 2021-10-26 International Business Machines Corporation System and method for network infrastructure analysis and convergence
JP6614280B1 (ja) * 2018-06-05 2019-12-04 富士通株式会社 通信装置および通信方法
US20210233068A1 (en) * 2018-06-06 2021-07-29 Nippon Telegraph And Telephone Corporation Settlement system, settlement method, user device, and settlement program
US11323530B2 (en) * 2018-06-06 2022-05-03 International Business Machines Corporation Proxy agents and proxy ledgers on a blockchain
US11410174B2 (en) * 2018-08-07 2022-08-09 International Business Machines Corporation Custom blockchain for IoT devices
US11314699B1 (en) 2018-09-06 2022-04-26 Side, Inc. Single-tier blockchain-based system and method for document transformation and accountability
US11263059B2 (en) * 2018-09-07 2022-03-01 International Business Machines Corporation Load leveler
CN109040305B (zh) * 2018-09-10 2021-06-04 浙江天脉领域科技有限公司 基于分层异构动态拓扑分片的区块链记录方法
CN109361588B (zh) * 2018-09-29 2021-04-30 湖南智慧政务区块链科技有限公司 一种基于星型网络的区块链网络构建方法及其系统
CN109525633B (zh) * 2018-10-08 2021-08-27 上海点融信息科技有限责任公司 区块链网络、基于区块链网络的消息发送、消息接收方法
CN109522739B (zh) * 2018-10-09 2020-11-20 北京医拍智能科技有限公司 一种基于区块链哈希算法的抗攻击处理方法及装置
WO2020081738A1 (en) * 2018-10-16 2020-04-23 Dan Kikinis System and method for multi-tiered distributed network transactional database
CN109413175B (zh) * 2018-10-19 2021-07-20 北京奇艺世纪科技有限公司 一种信息处理方法、装置及电子设备
US20220027903A1 (en) 2018-11-27 2022-01-27 nChain Holdings Limited Systems and methods for efficient and secure processing, accessing and transmission of data via a blockchain network
CN110046036A (zh) * 2018-12-25 2019-07-23 阿里巴巴集团控股有限公司 一种操作请求分配方法、装置及设备
CN109698792B (zh) * 2018-12-27 2021-05-18 四川灵通电讯有限公司 路由器节点之间的通信方法及其切换方法
CN111598564B (zh) * 2019-02-20 2023-11-21 华为技术有限公司 区块链节点连接建立方法、装置及设备
CN110011930B (zh) * 2019-03-12 2022-06-24 深圳前海微众银行股份有限公司 一种区块链中多联盟链的负载均衡方法及装置
CN110138596A (zh) * 2019-04-13 2019-08-16 山东公链信息科技有限公司 一种基于切换网络拓扑方式的区块链共识方法
US11416548B2 (en) 2019-05-02 2022-08-16 International Business Machines Corporation Index management for a database
US11201726B2 (en) 2019-05-02 2021-12-14 International Business Machines Corporation Multi-layered image encoding for data block
CN112039930B (zh) * 2019-06-03 2023-04-07 本无链科技(深圳)有限公司 一种基于大节点构建移动区块链的方法及系统
CN112241888B (zh) * 2019-07-19 2024-03-26 傲为有限公司 基于公链的地址管理系统
CN110365493B (zh) * 2019-08-22 2020-09-11 电子科技大学 多形态可派生的环状区块链构建方法
CN111295649B (zh) * 2019-09-12 2024-04-19 创新先进技术有限公司 日志结构存储系统
WO2019228569A2 (en) * 2019-09-12 2019-12-05 Alibaba Group Holding Limited Log-structured storage systems
US11431473B2 (en) 2019-09-20 2022-08-30 Mastercard International Incorporated Method and system for distribution of a consistent ledger across multiple blockchains
US11336455B2 (en) 2019-09-25 2022-05-17 International Business Machines Corporation Consensus protocol for blockchain DAG structure
CN111242620A (zh) * 2020-01-15 2020-06-05 阳光易购(湖南)科技有限公司 区块链交易系统的数据缓存及查询方法、终端及存储介质
CN111245861B (zh) * 2020-02-07 2022-01-25 上海应用技术大学 电力数据存储和共享方法
CN111783133B (zh) * 2020-06-02 2023-06-30 广东科学技术职业学院 一种基于区块链技术的网络资源管理方法
CN111798249A (zh) * 2020-06-11 2020-10-20 斗云科技(北京)有限公司 一种基于区块链的农产品快速追溯及认证检测的方法
CN112100171B (zh) * 2020-08-12 2021-06-25 北京大学 一种对随机共识的图式账本建立内容索引的方法和装置
CN112055077B (zh) * 2020-09-02 2023-04-18 杭州复杂美科技有限公司 区块链接入方法、设备和存储介质
CN112968969B (zh) * 2020-09-25 2023-05-12 支付宝(杭州)信息技术有限公司 区块链系统、消息传输方法及装置
CN113114670A (zh) * 2021-04-09 2021-07-13 杭州复杂美科技有限公司 一种区块链网络的多协议连接方法、设备及储存介质
CN113114761B (zh) * 2021-04-12 2022-09-20 中共陕西省委党校 基于分布式服务的数据共享交换激励系统及方法
CN113364693B (zh) * 2021-08-11 2021-10-29 国网电子商务有限公司 一种基于类型属性信息的区块链数据分发方法及系统
CN114244744B (zh) * 2021-12-22 2024-04-05 上海摩联信息技术有限公司 基于物联网设备的节点发现方法和装置
CN114285745B (zh) * 2021-12-22 2025-01-21 上海摩联信息技术有限公司 一种节点更新方法和装置
CN115499362B (zh) * 2022-08-23 2024-10-08 中国电信股份有限公司 Ip配置信息管理方法、装置，以及，电子设备
US11757985B1 (en) * 2022-11-16 2023-09-12 Coinbase, Inc. Systems and methods for a blockchain interoperability platform
CN116737743B (zh) * 2023-08-14 2023-11-24 中煤科工集团信息技术有限公司 煤炭热量检测系统
CN119449823A (zh) * 2024-11-04 2025-02-14 浙江大学 一种采用多层区块链的数据要素标识系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105740440A (zh) * 2016-02-01 2016-07-06 上海凭安网络科技有限公司 一种加快区块链查询的索引方法
US20160299918A1 (en) * 2015-04-07 2016-10-13 Dell Software, Inc. Device Control Using a Secure Decentralized Transactional Ledger
CN106357405A (zh) * 2016-09-19 2017-01-25 弗洛格（武汉）信息科技有限公司 一种基于区块链技术一致性算法的数据管理方法及系统
CN106534317A (zh) * 2016-11-17 2017-03-22 杭州云象网络技术有限公司 一种基于区块链技术的灾备云存储系统构建方法

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6279081B1 (en) * 1998-12-22 2001-08-21 Hewlett-Packard Company System and method for performing memory fetches for an ATM card
US7809854B2 (en) * 2002-02-12 2010-10-05 Open Design, Inc. Logical routing system
US8199636B1 (en) * 2002-10-18 2012-06-12 Alcatel Lucent Bridged network system with traffic resiliency upon link failure
US20100290340A1 (en) * 2009-05-15 2010-11-18 Electronics And Telecommunications Research Institute Method for protection switching
JP5692553B2 (ja) * 2011-10-28 2015-04-01 日本電気株式会社 リング型ネットワークにおけるノード装置およびその経路切替制御方法
JP6095583B2 (ja) * 2014-01-09 2017-03-15 アラクサラネットワークス株式会社 データ転送装置システム及びネットワークシステム
US9948473B2 (en) * 2015-02-04 2018-04-17 Lenovo Enterprise Solutions (Singapore) Pte. Ltd. Seamless connection handshake for a reliable multicast session
US9792163B1 (en) * 2016-06-28 2017-10-17 Vmware, Inc. Decentralized control plane for a computing system
US10187203B2 (en) * 2016-08-30 2019-01-22 Workday, Inc. Secure storage encryption system
CN106530088B (zh) * 2016-12-19 2023-11-17 杜伯仁 基于区块链安全节点对证券产品进行交易的方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160299918A1 (en) * 2015-04-07 2016-10-13 Dell Software, Inc. Device Control Using a Secure Decentralized Transactional Ledger
CN105740440A (zh) * 2016-02-01 2016-07-06 上海凭安网络科技有限公司 一种加快区块链查询的索引方法
CN106357405A (zh) * 2016-09-19 2017-01-25 弗洛格（武汉）信息科技有限公司 一种基于区块链技术一致性算法的数据管理方法及系统
CN106534317A (zh) * 2016-11-17 2017-03-22 杭州云象网络技术有限公司 一种基于区块链技术的灾备云存储系统构建方法

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
LAKSSHMI ET AL.: "Survey of Consensus Protocols on Blockchain Applications", 2017 4TH INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING AND COMMUNICATION SYSTEMS (ICACCS, 31 January 2017 (2017-01-31), pages 1 - 5, XP033144744 *
ZHU, YAN ET AL.: "Security Architecture and Key Technologies of Blockchain", SECURITY ARCHITECTURE AND KEY TECHNOLOGIES OF BLOCKCHAIN, vol. 2, no. 12, 31 December 2016 (2016-12-31), pages 1090 - 1097 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113132139A (zh) * 2019-12-31 2021-07-16 国民技术股份有限公司 区块链成员管理方法及装置、电子设备及计算机可读介质
CN112104517A (zh) * 2020-11-23 2020-12-18 腾讯科技（深圳）有限公司 一种基于区块链网络的数据处理方法及相关装置

Also Published As

Publication number Publication date
CN108323232A (zh) 2018-07-24
CN108323232B (zh) 2020-01-24
US20180337847A1 (en) 2018-11-22

Similar Documents

Publication Publication Date Title
WO2018209543A1 (zh) 一种多层级区块链系统之间索引与链拓扑结构的维护方法
US9442671B1 (en) Distributed consumer cloud storage system
Androutsellis-Theotokis et al. A survey of peer-to-peer content distribution technologies
CN101719842B (zh) 一种基于云计算环境的分布式网络安全预警方法
JP2008533564A (ja) データ管理のための方法および装置
Jia et al. SE-chain: a scalable storage and efficient retrieval model for blockchain
Cooper et al. Ad hoc, self-supervising peer-to-peer search networks
CN100588203C (zh) 数据存储方法和系统
US20100268808A1 (en) Distributed aggregation on an overlay network
CN113505002B (zh) 计算集群中的分布式组件
Xue et al. DHTrust: A robust and distributed reputation system for trusted peer‐to‐peer networks
Ward et al. Self managing monitoring for highly elastic large scale cloud deployments
Abe Blockchain storage load balancing among dht clustered nodes
Qi et al. An exchanged folded hypercube‐based topology structure for interconnection networks
Lai et al. A scalable multi-attribute hybrid overlay for range queries on the cloud
March et al. Multi-attribute range queries on read-only DHT
CN107734008A (zh) 一种数据存储系统中的故障处理的方法、装置、节点设备以及存储介质
CN103118113A (zh) 一种对等网络及其网络资源定位方法
Al-Lahham et al. Scalable self-organizing structured P2P information retrieval model based on equivalence classes.
JP5711772B2 (ja) クラスタシステム
Guru OPTIMIZING CLOUD-BASED PAYMENT SYSTEMS FOR SCALABILITY: CHALLENGES AND BEST PRACTICES
Bonnaire et al. WTR: a reputation metric for distributed hash tables based on a risk and credibility factor
Zhang et al. Towards a cluster based incentive mechanism for p2p networks
Wang et al. Towards a resilient message oriented middleware for mission critical applications
Sun et al. Erasure Code-Enabled Off-Chain Distributed Storage for Blockchain

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17909855

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 17909855

Country of ref document: EP

Kind code of ref document: A1