CN111404701A - Information broadcasting method, equipment and storage medium - Google Patents
Information broadcasting method, equipment and storage medium Download PDFInfo
- Publication number
- CN111404701A CN111404701A CN201911291119.8A CN201911291119A CN111404701A CN 111404701 A CN111404701 A CN 111404701A CN 201911291119 A CN201911291119 A CN 201911291119A CN 111404701 A CN111404701 A CN 111404701A
- Authority
- CN
- China
- Prior art keywords
- information
- node
- nodes
- sending
- block
- 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
-
- 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/1863—Arrangements for providing special services to substations for broadcast or conference, e.g. multicast comprising mechanisms for improved reliability, e.g. status reports
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an information broadcasting method, equipment and a storage medium, and relates to the technical field of block chains and the like. Receiving first information and second information sent by at least one sending node within set time, combining the second information sent by all the sending nodes within the set time, adding the node information as the second information of the node, and sending the second information and the first information to other nodes except the nodes recorded in the second information; wherein, the first information is block information or transaction information; the second information includes path information through which the first information is forwarded. The redundant propagation of the block information can be reduced by recording and transmitting the propagation path of the information, combining the propagation path and reducing the invalid propagation step by step through the path information; further, the convergence speed to the final consistency can be increased.
Description
Technical Field
The present invention relates to the field of block chaining and other technologies, and in particular, to an information broadcasting method, device, and storage medium.
Background
In the blockchain network, when a new block is successfully generated, the block needs to be broadcasted to the whole network, and the blockchain network such as chain33 and bitcoin adopts a virus type blockchain information transmission Protocol similar to the common Gossip, and quickly transmits information to the whole network by simulating rumors or virus transmission in social behaviors, so that the method is also called Epidemic Protocol (Epidemic Protocol).
The existing Gossip or Gossip-like is simple to implement and fast to propagate, but the problem of flooding caused by too much block redundancy and the problem of too heavy load exist, a large amount of network bandwidth is occupied, and the transaction speed of the whole block chain is finally slowed down. One of the main reasons for the excessive propagation of the block information redundancy is that when a block is broadcasted, the block is broadcasted in parallel, and due to heterogeneous problems such as network delay, bandwidth and the like, whether the block is received or not cannot be confirmed between adjacent nodes of a receiving node, and only the broadcast can be initiated again, so that the same node receives repeated information for many times, which causes redundancy.
Disclosure of Invention
1. Technical problem to be solved by the invention
In order to overcome the technical problems, the invention provides an information broadcasting method, equipment and a storage medium. The redundant propagation of the block information can be reduced by recording and transmitting the propagation path of the information, combining the propagation path and reducing the invalid propagation step by step through the path information; further, the convergence speed to the final consistency can be increased.
2. Technical scheme
In order to solve the problems, the technical scheme provided by the invention is as follows:
an information broadcasting method comprising: receiving first information and second information sent by at least one sending node within set time, combining the second information sent by all the sending nodes within the set time, adding the node information as the second information of the node, and sending the second information and the first information to other nodes except the nodes recorded in the second information; wherein, the first information is block information or transaction information; the second information includes path information through which the first information is forwarded.
Optionally, the merging the second information of all the sending nodes, adding the information of the node as the second information of the node, and sending the second information and the first information to other nodes, further includes: and merging the second information of all the sending nodes, adding the information of the node as the second information of the node, and sending the second information and the first information to the nodes except for the path information recorded by the second information.
Optionally, after receiving the first information and the second information sent by the at least one sending node within the set time, the method further includes caching the first information.
Optionally, the path information includes node information capable of uniquely identifying the first information propagating through.
Optionally, after the first message and the second message sent by any node are not received within the set time, the set time is further waited to receive the first message and the second message.
An apparatus, the apparatus comprising: one or more processors; memory for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to perform a method as described above.
A storage medium storing a computer program which, when executed by a processor, implements a method as claimed in any one of the preceding claims.
3. Advantageous effects
Compared with the prior art, the technical scheme provided by the invention has the following beneficial effects:
the redundant propagation of the block information can be reduced by recording and transmitting the propagation path of the information, combining the propagation path and reducing the invalid propagation step by step through the path information; further, the convergence speed to the final consistency can be increased.
Drawings
Fig. 1 is a flowchart of an information broadcasting method according to the present invention.
Fig. 2 is a broadcast schematic diagram of an information broadcasting method according to embodiment 2 of the present invention.
FIG. 3 is a schematic diagram of an apparatus of the present invention.
Detailed Description
For a further understanding of the present invention, reference will now be made in detail to the embodiments illustrated in the drawings.
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.
The terms first, second, and the like in the present invention are provided for convenience of describing the technical solution of the present invention, and have no specific limiting effect, but are all generic terms, and do not limit the technical solution of the present invention.
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.
Example 1
An information broadcasting method comprising:
s101, receiving first information and second information sent by at least one sending node within set time;
s102, merging second information sent by all sending nodes within a set time, adding the information of the node as the second information of the node, and sending the second information and the first information to other nodes except the nodes recorded in the second information;
wherein, the first information is block information or transaction information; the second information includes path node information through which the first information is forwarded. The path information includes node information capable of uniquely identifying the node through which the first information propagates, and refers to an identifier of the node to which the first information is broadcast, where the identifier is sufficient to uniquely identify the node, and may be a name of the node, a number of the node, and the like, or in short, an identifier of different nodes from the node.
The setting time may be set as needed, for example, a value of 100ms, 200ms, 300ms, or other values may be set, and the setting time may be set according to network bandwidth resources, broadcast speed, and other aspects.
When the block information or the transaction information is broadcasted, the path node information which the corresponding block information or the transaction information passes through is carried at the same time, and the block information or the transaction information is not forwarded to the passing path node during forwarding, so that on one hand, the bandwidth resources are saved, and on the other hand, the information broadcasting speed is further accelerated due to the enrichment of the bandwidth resources.
The merging of the second information of all the sending nodes, adding the information of the node as the second information of the node, and sending the second information and the first information to other nodes, further comprises: and merging the second information of all the sending nodes, adding the node information as the second information of the node, and sending the second information and the first information to the nodes except the path node information recorded by the second information.
If the set time is T, block information or transaction information sent by a plurality of nodes is received in T, second information of the nodes is merged, and then the node information is added to serve as second information to be forwarded by the node and sent to nodes other than path node information recorded by the second information together with the first information.
After receiving the first information and the second information sent by at least one sending node within the set time, the method further includes caching the first information, that is, storing the block information or the transaction information locally at the node for verification, or for block packaging, block consensus, and the like.
And after the first information and the second information sent by any node are not received within the set time, further waiting for the set time to receive the first information and the second information. If the time is set to T and block information or transaction information sent from any node is not received in T, another T is continuously waited, if first information and second information sent from a plurality of nodes are received in (T, 2T), the content of step S102 is performed, and if another T is continuously waited until the first information and the second information sent from the nodes are received in (xT, yT) (where y is x +1, and x is an integer greater than or equal to 1).
Example 2
In the existing broadcasting method, the transaction or the block is repeatedly broadcasted for many times, redundancy exists, bandwidth resources are occupied, and the speed of broadcasting the transaction or the block to the whole network is seriously influenced. In a block chain application scenario of parallel chain and main chain, a transaction is broadcast between nodes of the main chain, if the transaction TxA is broadcast between nodes of the main chain, for convenience of description, a simplified process is performed here, if the main chain nodes include N00, N01, N02, N03, N04, N05, N06, and N07, all nodes are interconnected and intercommunicated (in practical cases, a part of nodes are interconnected), as shown in fig. 2, an ellipse represents a node, an arrow line represents a propagation path and a direction, an on-line label represents information arrival sequence and merging path information, for example, a label T2_ NO1_ N03 on an N03- > N04 line represents that the node N04 receives the same block or transaction broadcast information at a time T2, and the information is transmitted through N01 and N03; since different receiving nodes receive the first information at different times, the time values of T1, T2, and T3 before the path information on the arrow line are different for different receiving nodes.
1) The starting node N01 initiates a block or transaction information propagation request, attaches node N01 propagation path information, is marked as N01 as second information, and broadcasts the second information together with the first information (block or transaction information);
2) the node N01 randomly selects the connecting nodes N03, N00 of the node N01, broadcasts the first information and the second information to the nodes;
3) the node N00 only receives the first information and the second information sent by the node N01 within a set time of 100ms, the node N02 adds the self node information to the propagation path (the second information) and marks the self node information as (N01, N00), the propagation nodes N01 and N00 are excluded, and the first information and the second information are continuously propagated to the nodes N03, N06 and N02;
4) the node N03 receives the block broadcast information sent by the nodes N01, N00, N02 in sequence, and within a set time period (e.g., 100 milliseconds), the node N03 receives the first information and the second information sent by the node N01, and the first information and the second information sent by the nodes N00, NO2 are outside the time period, so that the node N03 only merges one path information and adds its own node to the propagation path (second information), which is marked as (N01, N03), excludes the propagation nodes (N01, N03), and continues to propagate the first information and the second information to the nodes N04, N05, N06;
5) the node N05 receives the block or transaction broadcast information and the corresponding path information sent by the nodes N03, N02, and N06, and in a set time period (e.g., 100 ms), the node N05 receives the block broadcast information and the corresponding path information of the nodes N02 and N03, so that the propagation paths (N01 and N03) and (N01 and N02) carried by the nodes N02 and N03 are merged and the self node is added to the propagation path, which is denoted as (N01, N02, N03 and N05), and the propagation nodes (N01, N02, N03 and N05) are excluded and are continuously propagated to the nodes N04 and N00.
6) The node N04 receives the block or transaction broadcast information and the corresponding path information sent by the nodes N02, NO3, N05, and N06 in sequence, and within a set time period (e.g., 100 milliseconds), the node N04 receives the block broadcast information of the nodes N05 and N06, so that the propagation paths (N01, N02, N03, N05), (N01, N00, N03, and N06) carried by the nodes N05 and N06 are combined to be (N00, N01, N02, N03, N05, and N06), and after the propagation nodes (N00, N01, N02, N03, N05, and N06) are excluded, the node has NO longer to continue broadcasting, and the broadcasting is terminated.
Node N04 and node N00 do not propagate the interactivity event directly, but due to the existence of the propagation path, node N04 indirectly obtains that node N00 has received the tile or transaction broadcast message and therefore does not broadcast the information to node N00, although there may be a connection between node N04 and node N00.
In the above broadcasting process, assuming that the node N04 does not receive the first information and the corresponding second information sent by any node within the first set time period (0, 100), the node N04 will wait for 100ms again, i.e. continue to wait for receiving the first information and the corresponding second information sent by other nodes within (100, 200), and if it is not received within (100, 200), continue to wait for 100ms, i.e. continue to wait for receiving within (200, 300), until the first information and the corresponding second information sent by any one or more nodes are received within a certain time period.
Example 3
An apparatus, the apparatus comprising: one or more processors; memory for storing one or more programs that, when executed by the one or more processors, cause the one or more processors to perform a method as described above.
A storage medium storing a computer program which, when executed by a processor, implements the method as described in embodiment 1 above.
Fig. 3 is a schematic structural diagram of an apparatus according to an embodiment of the present invention.
As shown in fig. 3, 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.
To the I/O interface 505, AN input section 506 including a keyboard, a mouse, and the like, AN output section 507 including a keyboard such as a Cathode Ray Tube (CRT), a liquid crystal display (L CD), and the like, a speaker, and the like, a storage section 508 including a hard disk and the like, and a communication section 509 including a network interface card such as a L AN card, a modem, and the like, the communication section 509 performs communication processing via a network such as the internet, a drive 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, and 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 embodiments disclosed herein, the method described in any of the above embodiments may be implemented as a computer software program. For example, embodiments disclosed herein include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the method described in any of the embodiments 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 herein.
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 (7)
1. An information broadcasting method, comprising:
receiving first information and second information sent by at least one sending node within set time, combining the second information sent by all the sending nodes within the set time, adding the node information as the second information of the node, and sending the second information and the first information to other nodes except the nodes recorded in the second information;
wherein, the first information is block information or transaction information; the second information includes path information through which the first information is forwarded.
2. The method according to claim 1, wherein said merging the second information of all the sending nodes, adding the information of the node as the second information of the node, and sending the second information and the first information to other nodes, further comprises: and merging the second information of all the sending nodes, adding the information of the node as the second information of the node, and sending the second information and the first information to the nodes except for the path information recorded by the second information.
3. The method of claim 1, wherein after receiving the first message and the second message from the at least one sending node within the set time, further comprising caching the first message.
4. The method of claim 2, wherein the path information includes node information that uniquely identifies the first information propagating therethrough.
5. The method of claim 3, wherein the first message and the second message are received after a predetermined time period without receiving the first message and the second message from any node.
6. 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 in any of claims 1-5.
7. 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-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911291119.8A CN111404701B (en) | 2019-12-16 | 2019-12-16 | Information broadcasting method, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911291119.8A CN111404701B (en) | 2019-12-16 | 2019-12-16 | Information broadcasting method, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111404701A true CN111404701A (en) | 2020-07-10 |
| CN111404701B CN111404701B (en) | 2022-04-05 |
Family
ID=71430238
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911291119.8A Active CN111404701B (en) | 2019-12-16 | 2019-12-16 | Information broadcasting method, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111404701B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113127894A (en) * | 2021-03-03 | 2021-07-16 | 合肥工业大学 | Public opinion propagation model-based cryptocurrency network data propagation method and system |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1421075A (en) * | 1999-12-22 | 2003-05-28 | 艾利森电话股份有限公司 | Telecommunication network synchronisation |
| US20080279198A1 (en) * | 2003-10-31 | 2008-11-13 | Ingo Gruber | Method for the Transmission of Information in a Communication System Using a Path |
| CN101355490A (en) * | 2007-07-25 | 2009-01-28 | 华为技术有限公司 | Method, system and node equipment for routing information |
| CN101371534A (en) * | 2006-02-17 | 2009-02-18 | 松下电器产业株式会社 | Packet transmitting method, relay node and receiving node |
| WO2019128384A1 (en) * | 2017-12-29 | 2019-07-04 | 安凯(广州)微电子技术有限公司 | Data forwarding path selection method and device, storage medium and server |
| CN110430067A (en) * | 2019-07-15 | 2019-11-08 | 杭州复杂美科技有限公司 | For reducing method and system, equipment and the storage medium of block repeated broadcast |
| CN110493020A (en) * | 2019-07-05 | 2019-11-22 | 深圳壹账通智能科技有限公司 | Broadcast message transmission method, device and system based on block chain technology |
-
2019
- 2019-12-16 CN CN201911291119.8A patent/CN111404701B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1421075A (en) * | 1999-12-22 | 2003-05-28 | 艾利森电话股份有限公司 | Telecommunication network synchronisation |
| US20080279198A1 (en) * | 2003-10-31 | 2008-11-13 | Ingo Gruber | Method for the Transmission of Information in a Communication System Using a Path |
| CN101371534A (en) * | 2006-02-17 | 2009-02-18 | 松下电器产业株式会社 | Packet transmitting method, relay node and receiving node |
| CN101355490A (en) * | 2007-07-25 | 2009-01-28 | 华为技术有限公司 | Method, system and node equipment for routing information |
| WO2019128384A1 (en) * | 2017-12-29 | 2019-07-04 | 安凯(广州)微电子技术有限公司 | Data forwarding path selection method and device, storage medium and server |
| CN110493020A (en) * | 2019-07-05 | 2019-11-22 | 深圳壹账通智能科技有限公司 | Broadcast message transmission method, device and system based on block chain technology |
| CN110430067A (en) * | 2019-07-15 | 2019-11-08 | 杭州复杂美科技有限公司 | For reducing method and system, equipment and the storage medium of block repeated broadcast |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113127894A (en) * | 2021-03-03 | 2021-07-16 | 合肥工业大学 | Public opinion propagation model-based cryptocurrency network data propagation method and system |
| CN113127894B (en) * | 2021-03-03 | 2022-09-30 | 合肥工业大学 | Public opinion propagation model-based cryptocurrency network data propagation method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111404701B (en) | 2022-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110855792B (en) | Message pushing method, device, equipment and medium | |
| CN111464630B (en) | Transaction broadcasting method, apparatus and storage medium | |
| CN108833950B (en) | Barrage message issuing method, server, system and storage medium | |
| US20180067893A1 (en) | Multicast apparatuses and methods for distributing data to multiple receivers in high-performance computing and cloud-based networks | |
| CN115004673B (en) | Message pushing method, device, electronic equipment and computer readable medium | |
| CN112416632B (en) | Event communication method and device, electronic equipment and computer readable medium | |
| CN111404701B (en) | Information broadcasting method, equipment and storage medium | |
| CN108390919B (en) | Message synchronization system and method for high-reliability dual-computer hot standby | |
| US10425778B2 (en) | Distributed transactions on mobile devices via a messaging service provided by a mobile network operator | |
| CN111245939B (en) | Data synchronization method, device and system | |
| CN112825525B (en) | Method and apparatus for processing transactions | |
| CN111405037A (en) | Block synchronization method, device and storage medium | |
| US12026068B2 (en) | Method for data reading and writing processing, data center, disaster recovery system and storage medium | |
| JP2001045020A (en) | Reply distribution type communication method and communication system | |
| CN112053154B (en) | Transaction broadcasting method, apparatus and storage medium | |
| CN110990490B (en) | Method, device, equipment and medium for checking in blockchain network | |
| CN111813795A (en) | Method and apparatus for confirming transactions in a blockchain network | |
| CN112714181A (en) | Data transmission method and device | |
| CN112579274A (en) | Multi-channel access message forwarding method and device | |
| CN112866133A (en) | Method and device for acquiring MSS (maximum segment size) in common | |
| CN111611068A (en) | Data writing method in distributed system, server and client | |
| CN115002020B (en) | OSPF-based data processing method and device | |
| JPH0830523A (en) | Method for communicating on-line message | |
| CN113746724B (en) | Message transmission method, device, electronic equipment and medium | |
| WO2022227568A1 (en) | Data transmission method, network node, optical system, 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 |