CN111639944A - Transaction broadcasting method, apparatus and storage medium - Google Patents
Transaction broadcasting method, apparatus and storage medium Download PDFInfo
- Publication number
- CN111639944A CN111639944A CN202010511261.5A CN202010511261A CN111639944A CN 111639944 A CN111639944 A CN 111639944A CN 202010511261 A CN202010511261 A CN 202010511261A CN 111639944 A CN111639944 A CN 111639944A
- Authority
- CN
- China
- Prior art keywords
- transaction
- node
- broadcasting
- data packet
- list
- 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.)
- Granted
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/40—Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
- G06Q20/401—Transaction verification
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/24—Querying
- G06F16/245—Query processing
- G06F16/2455—Query execution
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1804—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast for stock exchange and similar applications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/02—Details
- H04L12/16—Arrangements for providing special services to substations
- H04L12/18—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast
- H04L12/1881—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast with schedule organisation, e.g. priority, sequence management
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Computer Security & Cryptography (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a transaction broadcasting method, equipment and a storage medium, wherein the method comprises the following steps: receiving a first data packet broadcast by a first node and comprising a first transaction, verifying whether the ttl reaches a first threshold: if not, modifying the ttl and broadcasting the first data packet to other connected nodes; if yes, broadcasting a first data packet to each second node belonging to the first list in other connected nodes, and broadcasting a first transaction hash of the first transaction to each third node not belonging to the first list in other connected nodes, so as to query whether the first transaction exists locally: if not, generating transaction request information and returning; in response to receiving the transaction request information, sending a first transaction to a corresponding third node; and recording the transaction requests of the corresponding third node, and verifying whether the number of the transaction requests is not less than a second threshold value: if so, the corresponding third node is added to the first list. The invention optimizes the real-time performance of the transaction broadcast in the local network with non-ideal network topology.
Description
Technical Field
The present application relates to the field of internet technologies, and in particular, to a transaction broadcasting method, device, and storage medium.
Background
In a p2p transaction broadcast protocol of a current blockchain, a p2p module of a blockchain node is configured with a TTL threshold, when the number of propagation nodes of a transaction reaches the threshold, the blockchain link point receiving the transaction does not directly broadcast the transaction any more, but only broadcasts the transaction hash of the transaction to a downstream node;
the downstream node receiving the transaction hash can inquire whether the transaction exists locally: if not, requesting the transaction from an upstream node of the broadcast transaction hash;
the upstream node receives the request and then sends the requested transaction to the downstream node requesting the transaction.
Fig. 1 is a schematic diagram of a transaction broadcast scenario of a local blockchain network. As shown in fig. 1, when the above transaction broadcasting mechanism is adopted in the blockchain network, each transaction is broadcasted to the blockchain Node4, which triggers the TTL threshold, so that the Node4 only sends the transaction hash of each transaction to the Node5, and the Node5 needs to request each transaction from the Node4, so that the Node4 broadcasts the transaction to the Node5 in a very low real-time manner before the network topology related to the Node5 changes.
Disclosure of Invention
In view of the above-mentioned deficiencies or inadequacies in the prior art, it would be desirable to provide a transaction broadcast method, apparatus, and storage medium that optimizes the real-time performance of transaction broadcasts in local networks having an undesirable network topology.
In a first aspect, the present invention provides a transaction broadcasting method, including:
receiving a first data packet broadcast by a first node and comprising a first transaction, and verifying whether the time-to-live value of the first data packet reaches a first threshold value:
if not, modifying the survival time value and broadcasting a first data packet to other nodes connected with the current node;
if yes, broadcasting the first data packet to each second node belonging to the first list in other connected nodes; and the number of the first and second groups,
broadcasting the first transaction hash of the first transaction to each third node which does not belong to the first list in other connected nodes, so that each third node can inquire whether the first transaction exists locally according to the first transaction hash:
if not, generating transaction request information for requesting the first transaction and returning;
in response to receiving the transaction request information, sending a first transaction to a corresponding third node; and the number of the first and second groups,
recording the transaction requests of the corresponding third nodes, and verifying whether the number of the transaction requests of the corresponding third nodes is not less than a second threshold value:
if so, the corresponding third node is added to the first list.
In a second aspect, the present invention also provides an apparatus comprising one or more processors and a memory, wherein the memory contains instructions executable by the one or more processors to cause the one or more processors to perform a transaction broadcast method provided according to embodiments of the present invention.
In a third aspect, the present invention also provides a storage medium storing a computer program that causes a computer to execute a transaction broadcasting method provided according to embodiments of the present invention.
The transaction broadcasting method, the transaction broadcasting device and the transaction broadcasting storage medium provided by the embodiments of the invention record the transaction request of the downstream node when receiving the transaction request of the downstream node, add the downstream node into the list to identify and record the node with the unsatisfactory network topology when judging that the total times of the transaction requests reach the preset threshold value, and directly broadcast the transaction to the nodes in the list when the ttl of the received transaction triggers the threshold value, thereby realizing the optimization of the real-time performance of the transaction broadcasting in the local network with the unsatisfactory network topology.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
fig. 1 is a schematic diagram of a transaction broadcast scenario of a local blockchain network.
Fig. 2 is a flowchart of a transaction broadcasting method according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of another transaction broadcast scenario of a local blockchain network.
Fig. 4 is a flowchart of step S16 in a preferred embodiment of the method shown in fig. 2.
Fig. 5 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 2 is a flowchart of a transaction broadcasting method according to an embodiment of the present invention.
As shown in fig. 2, in this embodiment, the present invention provides a transaction broadcasting method, including:
s11: receiving a first data packet broadcast by a first node and comprising a first transaction, and verifying whether the time-to-live value of the first data packet reaches a first threshold value:
otherwise, step S12 is executed: modifying the survival time value and broadcasting a first data packet to other nodes connected with the current node;
if yes, go to step S13: broadcasting the first data packet to each second node belonging to the first list among the other connected nodes; and the number of the first and second groups,
s14: broadcasting the first transaction hash of the first transaction to each third node which does not belong to the first list in other connected nodes, so that each third node can inquire whether the first transaction exists locally according to the first transaction hash:
if not, generating transaction request information for requesting the first transaction and returning;
s15: in response to receiving the transaction request information, sending a first transaction to a corresponding third node; and the number of the first and second groups,
s16: recording the transaction requests of the corresponding third nodes, and verifying whether the number of the transaction requests of the corresponding third nodes is not less than a second threshold value:
if yes, go to step S17: the corresponding third node is added to the first list.
Fig. 3 is a schematic diagram of another transaction broadcast scenario of a local blockchain network. In the following, in the scenario shown in fig. 3, after receiving the transaction broadcast by the Node3, the tile Node4 broadcasts to the Node5-Node8, and the first threshold configuration is 4 and the second threshold configuration is 3, which are taken as examples, the method shown in fig. 2 is exemplarily described.
In step S11, the Node4 receives the packet 1 including the transaction tx1 and the packet 2 including the transaction tx2 broadcast by the Node3, and verifies whether the ttl of the packet 1 and the packet 2 is not less than 4:
if the ttl of the package1 is less than 4, the Node4 executes step S12, adds 1 to ttl of the package1, and broadcasts the package1 to the nodes 5-8;
if ttl of the package2 is equal to 4, then the Node4 executes step S13 to broadcast a package2 to the nodes Node5 belonging to the first list in the Node5-Node 8; and the number of the first and second groups,
step S14, the Node 35 6-Node8 which does not belong to the first list of Node5-Node8 broadcasts the transaction hash of tx2 (tx 2).
Taking Node6 as an example, after receiving the hash (tx2) broadcast by Node4, Node6 locally queries whether tx2 exists according to the hash (tx 1):
otherwise, the transaction request information of the request tx2 is generated and returned to the Node 4.
In step S15, when the Node4 receives the transaction request message sent by Node6 (and does not receive the transaction request message sent by Node7-Node 8), Node4 sends tx2 to Node6 (tx2 is no longer sent to Node7-Node 8);
in step S16, the Node4 records the current transaction request of Node6, and verifies whether the number of the locally recorded transaction requests of Node6 is not less than 3:
if yes, Node6 is added to the local first list.
The above embodiment exemplarily illustrates the method shown in fig. 2 by taking the local network topology shown in fig. 3, the first threshold configuration 4, and the second threshold configuration 3 as examples, in further embodiments, the method shown in fig. 2 may also be applied to any network topology, and the blockchain system may configure the first threshold and the second threshold as numbers of different sizes according to actual requirements, so that the same technical effect may be achieved.
Fig. 4 is a flowchart of step S16 in a preferred embodiment of the method shown in fig. 2.
As shown in fig. 4, in a preferred embodiment, step S16 includes:
recording a transaction request and request time of a corresponding third node;
verifying whether the number of recent transaction requests of the corresponding third node is not less than a second threshold.
Specifically, in the scenario shown in fig. 2, when Node6 requests transactions from Node4 due to the special network topology, but the frequency of transactions requested from Node4 is very low, Node4 will add Node6 to the first list due to the accumulation of transaction requests. For the problem, in this embodiment, by recording the request time (or block height) of the transaction request, the criterion for determining whether to add the first list can be changed from the total number of transaction requests to the recent number of transaction requests, so as to more accurately screen out the downstream node that needs the current node to directly send the transaction.
Fig. 5 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 5, as another aspect, the present application also provides an apparatus 500 including one or more Central Processing Units (CPUs) 501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the apparatus 500 are also stored. The CPU501, ROM502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to an embodiment of the present disclosure, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments of the present disclosure include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing any of the methods described above. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511.
As yet another aspect, the present application also provides a computer-readable storage medium, which may be the computer-readable storage medium included in the apparatus of the above-described embodiment; or it may be a separate computer readable storage medium not incorporated into the device. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods described in the present application.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units or modules described in the embodiments of the present application may be implemented by software or hardware. The described units or modules may also be provided in a processor, for example, each of the described units may be a software program provided in a computer or a mobile intelligent device, or may be a separately configured hardware device. Wherein the designation of a unit or module does not in some way constitute a limitation of the unit or module itself.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the present application. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (4)
1. A transaction broadcasting method, comprising:
receiving a first data packet broadcast by a first node and comprising a first transaction, verifying whether the time-to-live value of the first data packet reaches a first threshold value:
if not, modifying the survival time value and broadcasting the first data packet to other nodes connected with the current node;
if yes, broadcasting the first data packet to each second node belonging to the first list in other connected nodes; and the number of the first and second groups,
broadcasting a first transaction hash of the first transaction to each third node which is not in the first list in other connected nodes, so that each third node can inquire whether the first transaction exists locally according to the first transaction hash:
if not, generating transaction request information for requesting the first transaction and returning;
in response to receiving the transaction request information, sending the first transaction to a corresponding third node; and the number of the first and second groups,
recording the transaction requests of the corresponding third node, and verifying whether the number of the transaction requests of the corresponding third node is not less than a second threshold value:
and if so, adding the corresponding third node into the first list.
2. The method of claim 1, wherein the logging the transaction requests of the respective third node and verifying whether the number of transaction requests of the respective third node is not less than a second threshold comprises:
recording the transaction request and the request time of the corresponding third node;
verifying whether the number of recent transaction requests by the respective third node is not less than a second threshold.
3. An apparatus, characterized in that the apparatus comprises:
one or more processors;
a memory for storing one or more programs,
the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method recited by any of claims 1-2.
4. A storage medium storing a computer program, characterized in that the program, when executed by a processor, implements the method according to any one of claims 1-2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010511261.5A CN111639944B (en) | 2020-06-08 | 2020-06-08 | Transaction broadcasting method, apparatus and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010511261.5A CN111639944B (en) | 2020-06-08 | 2020-06-08 | Transaction broadcasting method, apparatus and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111639944A true CN111639944A (en) | 2020-09-08 |
| CN111639944B CN111639944B (en) | 2023-06-02 |
Family
ID=72331750
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010511261.5A Active CN111639944B (en) | 2020-06-08 | 2020-06-08 | Transaction broadcasting method, apparatus and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111639944B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113507524A (en) * | 2021-07-09 | 2021-10-15 | 杭州复杂美科技有限公司 | Transaction broadcasting method, computer device and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107231299A (en) * | 2017-06-07 | 2017-10-03 | 众安信息技术服务有限公司 | A kind of chain route and realized the system that block chain communicates across chain |
| US9996600B1 (en) * | 2015-06-25 | 2018-06-12 | Amazon Technologies, Inc. | Asynchronous communication of transaction data to clients |
| CN108683539A (en) * | 2018-05-21 | 2018-10-19 | 腾讯科技（深圳）有限公司 | Management method, device, medium and the electronic equipment of block chain network |
| CN109102287A (en) * | 2018-08-13 | 2018-12-28 | 中国联合网络通信集团有限公司 | Block chain bookkeeping methods, device, equipment and storage medium |
| CN109687953A (en) * | 2018-12-24 | 2019-04-26 | 杭州复杂美科技有限公司 | Classification of business transaction method, equipment and storage medium |
| CN110610365A (en) * | 2019-09-17 | 2019-12-24 | 中国建设银行股份有限公司 | Method and device for identifying transaction request |
| CN110784501A (en) * | 2019-07-15 | 2020-02-11 | 杭州复杂美科技有限公司 | Method, system, device and storage medium for packaging and broadcasting transaction group containing block |
| CN110892661A (en) * | 2017-07-11 | 2020-03-17 | 区块链控股有限公司 | Optimizing network parameters to achieve network coding |
-
2020
- 2020-06-08 CN CN202010511261.5A patent/CN111639944B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9996600B1 (en) * | 2015-06-25 | 2018-06-12 | Amazon Technologies, Inc. | Asynchronous communication of transaction data to clients |
| CN107231299A (en) * | 2017-06-07 | 2017-10-03 | 众安信息技术服务有限公司 | A kind of chain route and realized the system that block chain communicates across chain |
| CN110892661A (en) * | 2017-07-11 | 2020-03-17 | 区块链控股有限公司 | Optimizing network parameters to achieve network coding |
| CN108683539A (en) * | 2018-05-21 | 2018-10-19 | 腾讯科技（深圳）有限公司 | Management method, device, medium and the electronic equipment of block chain network |
| CN109102287A (en) * | 2018-08-13 | 2018-12-28 | 中国联合网络通信集团有限公司 | Block chain bookkeeping methods, device, equipment and storage medium |
| CN109687953A (en) * | 2018-12-24 | 2019-04-26 | 杭州复杂美科技有限公司 | Classification of business transaction method, equipment and storage medium |
| CN110784501A (en) * | 2019-07-15 | 2020-02-11 | 杭州复杂美科技有限公司 | Method, system, device and storage medium for packaging and broadcasting transaction group containing block |
| CN110610365A (en) * | 2019-09-17 | 2019-12-24 | 中国建设银行股份有限公司 | Method and device for identifying transaction request |
Non-Patent Citations (2)
| Title |
|---|
| 张晓宇等: "基于探测-支付机制的网络编码自私节点激励方案" * |
| 李明澔: "加密链路机中密钥交换的设计与实现" * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113507524A (en) * | 2021-07-09 | 2021-10-15 | 杭州复杂美科技有限公司 | Transaction broadcasting method, computer device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111639944B (en) | 2023-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111464630B (en) | Transaction broadcasting method, apparatus and storage medium | |
| US9465819B2 (en) | Distributed database | |
| US20130346504A1 (en) | Group communication method and apparatus for group communication | |
| JP7521005B2 (en) | Method for determining user plane function, method for providing information, device, and medium | |
| US9071512B2 (en) | Methods, systems, and computer readable media for distributing diameter network management information | |
| EP1867137A1 (en) | Method and apparatus for efficiently expanding a p2p network | |
| CN113542058B (en) | Data source returning method, server and storage medium | |
| CN109873855A (en) | A kind of resource acquiring method and system based on block chain network | |
| CN113301079B (en) | Data acquisition method, system, computing device and storage medium | |
| CN114364031A (en) | Service providing method, device and storage medium | |
| CN114268631B (en) | Low-delay network system, communication connection method thereof and readable storage medium | |
| WO2012041404A1 (en) | Distributed database | |
| CN111639944A (en) | Transaction broadcasting method, apparatus and storage medium | |
| CN112055077B (en) | Block link access method, device and storage medium | |
| CN109788075B (en) | Private network system, data acquisition method and edge server | |
| US20090083379A1 (en) | Enabling connections for use with a network | |
| CN112202833A (en) | CDN system, request processing method and scheduling server | |
| US11212220B2 (en) | Optimized reconciliation in a controller-switch network | |
| CN113645287B (en) | Automobile message storage method and device and automobile message storage system | |
| CN111371675B (en) | Intelligent addressing method, device, equipment and storage medium thereof | |
| KR102205678B1 (en) | Vehicular ad hoc networks (VANETs) System having sleeping mode | |
| CN114650295A (en) | Quality scheduling method, quality scheduling device, quality scheduling medium and electronic equipment | |
| US20190293433A1 (en) | System and method for indoor position determination | |
| CN116996481B (en) | Live broadcast data acquisition method and device, electronic equipment and storage medium | |
| CN111641698B (en) | Data statistical method, system, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |