CN110290168B - Data transmission method, device, server and storage medium - Google Patents
Data transmission method, device, server and storage medium Download PDFInfo
- Publication number
- CN110290168B CN110290168B CN201910381100.6A CN201910381100A CN110290168B CN 110290168 B CN110290168 B CN 110290168B CN 201910381100 A CN201910381100 A CN 201910381100A CN 110290168 B CN110290168 B CN 110290168B
- Authority
- CN
- China
- Prior art keywords
- node
- channel
- list
- determining
- available
- 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.)
- Active
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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/29—Flow control; Congestion control using a combination of thresholds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/10—Network architectures or network communication protocols for network security for controlling access to devices or network resources
- H04L63/101—Access control lists [ACL]
-
- 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/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
-
- 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)
- Business, Economics & Management (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Computing Systems (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Economics (AREA)
- Marketing (AREA)
- General Engineering & Computer Science (AREA)
- Technology Law (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Information Transfer Between Computers (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
A method of data transmission, the method comprising: receiving a data acquisition request of a user; acquiring a channel list added by each node in a node list according to the node list configured in advance; determining a plurality of nodes included in each channel according to the channel list added by all the nodes; for each of the channels, determining a target node from a plurality of nodes included in the channel; acquiring original data on the channel through the target node, and calculating statistical data of the channel according to the original data; and sending the statistical data of all the channels to the user. The invention also provides a data transmission device, a server and a storage medium. The invention can discover new channels and ensure that the statistical data obtained by the user is always up-to-date.
Description
Technical Field
The present invention relates to the field of block chain technologies, and in particular, to a data transmission method, an apparatus, a server, and a storage medium.
Background
The blockchain is essentially searched as a large public database, and the interface supporting this search function is called a blockchain browser. The blockchain browser can display and inquire the blockchain information and the transaction information in a visual mode, and can summarize and count data on the blockchain. To improve the throughput of transactions over blockchains, some federations divide blockchain networks into multiple physically and logically isolated channels, each of which includes an independent blockchain, through a chaining technique. Currently, blockchain browsers are capable of supporting multiple channels, traditionally by pre-configuring the list of available channels and the policy for access by each channel. In fact, if the channel is added, the traditional pre-configuration mode cannot find a new channel in time, the flexibility is poor, and in addition, if the new channel is not found in time, the statistical data fed back to the user is not up-to-date.
Disclosure of Invention
In view of the above, it is desirable to provide a data transmission method, apparatus, server and storage medium, which can discover new channels and ensure that the statistical data obtained by the user is always up-to-date.
A first aspect of the present invention provides a data transmission method, including:
receiving a data acquisition request of a user;
acquiring a channel list added by each node in a node list according to the node list configured in advance;
determining a plurality of nodes included in each channel according to the channel list added by all the nodes;
for each of the channels, determining a target node from a plurality of nodes included in the channel;
acquiring original data on the channel through the target node, and calculating statistical data of the channel according to the original data;
and sending the statistical data of all the channels to the user.
In one possible implementation, the method further includes:
establishing a corresponding relation between the channels and the nodes;
determining a new channel from the corresponding relation;
and sending a notification message to the user, wherein the notification message is used for notifying the user that the new channel is found.
In a possible implementation manner, the obtaining, according to a preconfigured node list, a channel list added to each node in the node list includes:
judging whether the communication of the nodes is normal or not aiming at each node in a pre-configured node list;
if the communication of the node is normal, determining the node as an available node;
forming an available node list by all the available nodes;
and acquiring a channel list added by each node in the available node list.
In a possible implementation manner, the determining whether the communication of the node is normal includes:
acquiring the network connection state of the node; if the network connection state indicates that the network connection is normal, determining that the communication of the node is normal; or
Sending first information to the node; and if feedback information sent by the node aiming at the first information is received, determining that the communication of the node is normal.
In a possible implementation manner, the obtaining, according to a preconfigured node list, a channel list added to each node in the node list includes:
aiming at each node in a pre-configured node list, acquiring an identifier of the node;
if the identifier of the node is a first identifier for indicating that the node is in an available state, determining that the node is an available node;
if the identifier of the node is a second identifier for indicating that the node is in an unavailable state, judging whether the marking time length of the second identifier is greater than a preset time length;
if the marking time length of the second identifier is longer than the preset time length, changing the second identifier into the first identifier, and determining the node as an available node;
forming an available node list by all the available nodes;
and acquiring a channel list added by each node in the available node list.
In a possible implementation manner, the determining a target node from a plurality of nodes included in the channel includes:
determining a currently available node from a plurality of nodes included in the channel; determining a node in an idle state as a target node from the currently available nodes; or
Acquiring the service pressure of each node in each node included in the channel; and if the service pressure of the node is smaller than a preset pressure threshold value, determining that the node is a target node.
In a possible implementation manner, after receiving the data acquisition request of the user, the method further includes:
determining the receiving time of the data acquisition request;
judging whether the time interval between two adjacent received data acquisition requests is greater than a preset time threshold or not according to the receiving time;
if the time interval between two adjacent received data acquisition requests is greater than a preset time threshold, acquiring a channel list added by each node in the node list according to a pre-configured node list.
A second aspect of the present invention provides a data transmission apparatus, comprising:
the receiving module is used for receiving a data acquisition request of a user;
the first acquisition module is used for acquiring a channel list added by each node in the node list according to a preconfigured node list;
a first determining module, configured to determine, according to a channel list added by all the nodes, a plurality of nodes included in each channel;
a second determining module, configured to determine, for each of the channels, a target node from a plurality of nodes included in the channel;
a second obtaining module, configured to obtain, through the target node, original data on the channel;
the calculation module is used for calculating the statistical data of the channel according to the original data;
and the sending module is used for sending the statistical data of all the channels to the user.
A third aspect of the invention provides a server comprising a processor and a memory, the processor being configured to implement the data transmission method when executing a computer program stored in the memory.
A fourth aspect of the present invention provides a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the data transmission method.
By the above technical solution, in the present invention, after receiving a data acquisition request of a user, a channel list added by each node in the node list may be acquired according to a preconfigured node list, and then a plurality of nodes included in each channel may be determined according to the channel lists added by all the nodes, further, for each channel, a target node may be determined from the plurality of nodes included in the channel, original data on the channel may be acquired through the target node, statistical data of the channel may be calculated according to the original data, and finally, the statistical data of all the channels may be sent to the user. Therefore, in the invention, after receiving a data acquisition request of a user, the server can be triggered to acquire the channel list according to the node list, and a plurality of nodes included in each channel are determined, so that the current number of channels is determined, if an additional channel is added currently, a new channel can be found without being limited to a pre-configured channel list, the flexibility is higher, in addition, statistical data on all channels (including the new channel) can be fed back to the user, and therefore, the statistical data acquired by the user can be ensured to be always latest.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a preferred embodiment of a data transmission method disclosed in the present invention.
Fig. 2 is a functional block diagram of a preferred embodiment of a data transmission apparatus according to the present disclosure.
Fig. 3 is a schematic structural diagram of a server according to a preferred embodiment of the present invention for implementing a data transmission method.
Detailed Description
In order that the above objects, features and advantages of the present invention can be more clearly understood, a detailed description of the present invention will be given below with reference to the accompanying drawings and specific embodiments. It should be noted that the embodiments of the present invention and features of the embodiments may be combined with each other without conflict.
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs. The terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in further detail below.
The data transmission method of the embodiment of the invention is applied to a server, and can also be applied to a hardware environment formed by the server and electronic equipment connected with the server through a network, and the server and the electronic equipment execute together. Networks include, but are not limited to: a wide area network, a metropolitan area network, or a local area network.
A server may refer to a computer system that provides services to other devices (e.g., electronic devices) in a network. A personal computer may also be called a server if it can provide File Transfer Protocol (FTP) service to the outside. In a narrow sense, a server refers to a high-performance computer, which can provide services to the outside through a network, and compared with a common personal computer, the server has higher requirements on stability, security, performance and the like, and therefore, hardware such as a CPU, a chipset, a memory, a disk system, a network and the like is different from that of the common personal computer.
Referring to fig. 1, fig. 1 is a flowchart illustrating a data transmission method according to a preferred embodiment of the present invention. The order of the steps in the flowchart may be changed, and some steps may be omitted.
And S11, the server receives the data acquisition request of the user.
The block chain is essentially a de-mediated database, and is a series of data blocks which are generated by using a cryptographic method to be associated as an underlying technology of the bitcoin, wherein each data block contains information of one bitcoin network transaction, and the information is used for verifying the validity (anti-counterfeiting) of the information and generating a next block. Wherein the transactions are stored on disk in blocks. The blocks are connected by a HASH algorithm to form a block chain. The content recorded by each block can be consulted from a blockchain browser, each blockchain has a browser, and a user cannot perform cross-chain query through the blockchain browser. For example, bitcoin can only be queried by a bitcoin browser, but cannot be queried by an EtherFang browser.
To improve the throughput of transactions over blockchains, some federations divide blockchain networks into multiple physically and logically isolated channels, each of which includes an independent blockchain, through a chaining technique. Currently, blockchain browsers are capable of supporting multiple channels, traditionally by pre-configuring the list of available channels and the policy for access by each channel. In the invention, the channel change can be timely found by adopting a channel automatic finding mode.
In the embodiment of the invention, when a user needs to acquire data on the channel, the user can send a data acquisition request to the server through the tile browser. The blockchain browser can display and inquire the blockchain information and the transaction information in a visual mode, and can summarize and count data on the blockchain. When the server receives a data acquisition request of a user, the server can be triggered to perform channel discovery.
As an optional implementation manner, after step S11, the method further includes:
determining the receiving time of the data acquisition request;
judging whether the time interval between two adjacent received data acquisition requests is greater than a preset time threshold or not according to the receiving time;
if the time interval between two adjacent received data acquisition requests is greater than the preset time threshold, step S12 is executed.
In this alternative embodiment, the channel change at the bottom of the blockchain is not a process that occurs frequently, and is simply triggered by the access of the user, and if the access of the user is too frequent, a certain pressure is brought to the bottom of the blockchain, but the channel change condition is not obtained at the same time. Therefore, the time of two adjacent accesses needs to be limited, and a preset time threshold, such as 30S, can be preset.
When a data acquisition request of a user is received, the receiving time of the data acquisition request can be determined firstly; further, the time of receiving the data acquisition request last time (i.e. the time closest to this time) may be obtained, and it is determined whether the time interval between two adjacent times of receiving the data acquisition requests is greater than a preset time threshold; if the time interval between two adjacent times of receiving the data acquisition requests is greater than the preset time threshold, the access of the user is not frequent, and the server can be triggered to perform channel discovery. On the contrary, if the time interval between two adjacent times of receiving the data acquisition requests is less than or equal to the preset time threshold, the access frequency of the user is indicated, and in order to reduce the access pressure on the bottom layer of the block chain, the server does not perform channel discovery.
S12, the server obtains the channel list added by each node in the node list according to the pre-configured node list.
In an embodiment of the present invention, a node list may be preconfigured, where the node list includes a plurality of nodes, such as a plurality of computers deployed on a blockchain network. Each node can join a channel, and the nodes can acquire block and data information on the channel.
Specifically, the obtaining, according to a preconfigured node list, a channel list added to each node in the node list includes:
judging whether the communication of the nodes is normal or not aiming at each node in a pre-configured node list;
if the communication of the node is normal, determining the node as an available node;
forming an available node list by all the available nodes;
and acquiring a channel list added by each node in the available node list.
In this alternative embodiment, some nodes may communicate normally and some nodes may not communicate normally, for example, when a network failure occurs, the nodes may not communicate normally, and for example, when the service pressure of the nodes has exceeded the maximum service pressure threshold, the nodes may not communicate normally. If the node cannot normally communicate, the node cannot acquire the block and data information on the channel. Therefore, when channel discovery is performed, it is necessary to determine whether communication of each node in a preconfigured node list is normal; if the communication of the node is normal, the node may be determined to be an available node, and further, all the available nodes may be grouped into an available node list, and then a channel list added by the node is obtained for each node in the available node list.
Wherein the judging whether the communication of the node is normal comprises:
acquiring the network connection state of the node; if the network connection state indicates that the network connection is normal, determining that the communication of the node is normal; or
Sending first information to the node; and if feedback information sent by the node aiming at the first information is received, determining that the communication of the node is normal.
Whether the communication of the node is normal may be determined in various ways, for example, the network connection state of the node may be obtained first, and if the network connection state indicates that the network connection is normal, it may be determined that the communication of the node is normal, whereas if the network connection state indicates that the network connection is disconnected, it may be determined that the communication of the node is abnormal; for another example, the first information may be sent to the node, where the first information may be any information that needs to be fed back by the node. If the feedback information sent by the node for the first information is received, it may be determined that the communication of the node is normal, otherwise, if the feedback information sent by the node for the first information is not received, it may be determined that the communication of the node is abnormal.
Specifically, the obtaining, according to a preconfigured node list, a channel list added to each node in the node list includes:
aiming at each node in a pre-configured node list, acquiring an identifier of the node;
if the identifier of the node is a first identifier for indicating that the node is in an available state, determining that the node is an available node;
if the identifier of the node is a second identifier for indicating that the node is in an unavailable state, judging whether the marking time length of the second identifier is greater than a preset time length; if the marking time length of the second identifier is greater than the preset time length, changing the second identifier into the first identifier, and determining the node as an available node;
forming an available node list by all the available nodes;
and acquiring a channel list added by each node in the available node list.
In this alternative embodiment, each node may be marked with an identifier indicating whether the node is available, for example, identifier 1 indicates that the node is available, and identifier 0 indicates that the node is not available.
After the identifier of the node is obtained, if the identifier of the node is a first identifier used for indicating that the node is in an available state, the node can be determined to be an available node; when the identifier of the node is the second identifier indicating that the node is in the unavailable state, since the state of the node is in real-time change, the node is in the unavailable state when being marked, and a period of time may elapse, the node becomes the available state, but the second identifier of the node is not changed in time, it may be determined first whether the marking time duration of the second identifier of the node is greater than a preset time duration (for example, 10S), and if the marking time duration of the second identifier is greater than the preset time duration, it may be assumed that the node is an available node first, and the node is added to the available node list. Subsequently, when communicating with the node, if the node is found to be unable to normally communicate, the node may be determined to be an unavailable node, and the first identity of the node is changed to a second identity.
In this optional embodiment, whether the node is an available node may be determined according to the identifier on the node, and then the available node may be grouped into an available node list, so as to obtain a channel list added by each node in the available node list.
S13, the server determines a plurality of nodes included in each channel according to the channel list added by all the nodes.
In the embodiment of the present invention, after the list of channels added by each node is obtained, the channels added by all the nodes may be merged to obtain each channel and a plurality of nodes corresponding to each channel, that is, the corresponding relationship between the channels and the nodes is obtained. Optionally, the corresponding relationship between the channels and the nodes may be stored in a database, where the database is deployed independently from the disks of the underlying block chain.
To this end, the number of current channels may be determined, and the number of current channels may be compared with the number of channels in the history, and if the number of channels is found to increase, it is indicated that a new channel is currently found.
S14, the server determines a target node from a plurality of nodes included in the path for each of the paths.
Specifically, the determining a target node from a plurality of nodes included in the channel includes:
determining a currently available node from a plurality of nodes included in the channel; determining a node in an idle state as a target node from the currently available nodes; or
Acquiring the service pressure of each node in each node included in the channel; and if the service pressure of the node is smaller than a preset pressure threshold value, determining that the node is a target node.
In this alternative embodiment, whether the node is an available node may be determined according to whether the communication of the node is normal, and the specific manner may refer to the above description. The state of the node can be divided into an idle state and a busy state, and if the node is in the idle state, the node can execute tasks at any time.
A preset pressure threshold may also be preset, where the preset pressure threshold is the maximum service pressure that the node can bear. If the service pressure of the node is smaller than the preset pressure threshold value, the node can provide other services.
In the embodiment of the invention, each channel comprises a plurality of nodes, block and data information on the channel can be acquired through the nodes, the timeliness of the tasks which can be executed by the nodes in different states at present is different, and the nodes with different service pressures do not have to be capable of executing new tasks. It is therefore necessary to determine a target node that can execute a task in a timely manner or that has the ability to execute a task from among a plurality of nodes included in the path.
S15, the server obtains the original data on the channel through the target node, and calculates the statistical data of the channel according to the original data.
In the embodiment of the present invention, after the target node is determined, the original data on the channel, that is, the original data stored on the disk of the bottom layer block chain node, may be obtained by the target node, where the original data on the disk is accurate, and the original data stored on the disk needs to be relied on when performing data analysis statistics.
In the embodiment of the present invention, when determining a plurality of nodes included in each channel, that is, when determining that there are a plurality of channels currently, if a new channel is found, the original data on the new channel also needs to be acquired, and further, the statistical data on the new channel also needs to be calculated.
And S16, the server sends the statistics data of all the channels to the user.
In the embodiment of the present invention, if a new channel is found, the statistical data of all the channels also includes the statistical data of the new channel, and the server may send the current statistical data of all the channels to the user.
Optionally, the server may further store the statistical data of all the channels in a database. It should be noted that, if the data acquisition request of the user triggers the server to perform channel discovery, the server will re-acquire the original data on all channels, and re-calculate the statistical data to feed back to the user. If the data acquisition request of the user does not trigger the server to perform channel discovery, the server can directly acquire the pre-stored statistical data from the database and feed the statistical data back to the user.
As an optional implementation, the method further comprises:
establishing a corresponding relation between the channels and the nodes;
determining a new channel from the corresponding relation;
and sending a notification message to the user, wherein the notification message is used for notifying the user that the new channel is found.
In this optional embodiment, after determining a plurality of nodes included in each channel, a correspondence between the channels and the nodes may be established; from the correspondence, a new channel may be determined, and a notification message may be sent to the user in order to let the user know that a new channel is found. The sending time of the notification message and the sending time of the statistical data of all the channels may be the same or different, and the embodiment of the present invention is not limited.
In the method flow described in fig. 1, after receiving a data acquisition request of a user, a channel list added to each node in the node list may be acquired according to a preconfigured node list, and then a plurality of nodes included in each channel may be determined according to the channel lists added to all the nodes, further, for each channel, a target node may be determined from the plurality of nodes included in the channel, original data on the channel is acquired through the target node, statistical data of the channel is calculated according to the original data, and finally, the statistical data of all the channels may be sent to the user. Therefore, in the invention, after receiving a data acquisition request of a user, the server can be triggered to acquire the channel list according to the node list, and a plurality of nodes included in each channel are determined, so that the current number of channels is determined, if an additional channel is added currently, a new channel can be found without being limited to a pre-configured channel list, the flexibility is higher, in addition, statistical data on all channels (including the new channel) can be fed back to the user, and therefore, the statistical data acquired by the user can be ensured to be always latest.
The above description is only a specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and it will be apparent to those skilled in the art that modifications may be made without departing from the inventive concept of the present invention, and these modifications are within the scope of the present invention.
Referring to fig. 2, fig. 2 is a functional block diagram of a preferred embodiment of a data transmission device according to the present invention.
In some embodiments, the data transmission device runs in a server. The data transmission means may comprise a plurality of functional modules consisting of program code segments. Program code of various program segments in the data transmission apparatus may be stored in the memory and executed by the at least one processor to perform some or all of the steps of the data transmission method described in fig. 1.
In this embodiment, the data transmission device may be divided into a plurality of functional modules according to the functions performed by the data transmission device. The functional module may include: the device comprises a receiving module 201, a first obtaining module 202, a first determining module 203, a second determining module 204, a second obtaining module 205, a calculating module 206 and a sending module 207. The module referred to herein is a series of computer program segments capable of being executed by at least one processor and capable of performing a fixed function and is stored in memory. In some embodiments, the functionality of the modules will be described in greater detail in subsequent embodiments.
A receiving module 201, configured to receive a data acquisition request of a user;
the block chain is essentially a de-mediated database, and is a series of data blocks which are generated by using a cryptographic method to be associated as an underlying technology of the bitcoin, wherein each data block contains information of one bitcoin network transaction, and the information is used for verifying the validity (anti-counterfeiting) of the information and generating a next block. Wherein the transactions are stored on disk in blocks. The blocks are connected by a HASH algorithm to form a block chain. The content recorded by each block can be consulted from a blockchain browser, each blockchain has a browser, and a user cannot perform cross-chain query through the blockchain browser. For example, bitcoin can only be queried by a bitcoin browser, but cannot be queried by an EtherFang browser.
To improve the throughput of transactions over blockchains, some federations divide blockchain networks into multiple physically and logically isolated channels, each of which includes an independent blockchain, through a chaining technique. Currently, blockchain browsers are capable of supporting multiple channels, traditionally by pre-configuring the list of available channels and the policy for access by each channel. In the invention, the channel change can be timely found by adopting a channel automatic finding mode.
In the embodiment of the invention, when a user needs to acquire data on the channel, the user can send a data acquisition request to the server through the tile browser. The blockchain browser can display and inquire the blockchain information and the transaction information in a visual mode, and can summarize and count data on the blockchain. When the server receives a data acquisition request of a user, the server can be triggered to perform channel discovery.
A first obtaining module 202, configured to obtain, according to a preconfigured node list, a channel list added to each node in the node list;
in an embodiment of the present invention, a node list may be preconfigured, where the node list includes a plurality of nodes, such as a plurality of computers deployed on a blockchain network. Each node can join a channel, and the nodes can acquire block and data information on the channel.
A first determining module 203, configured to determine, according to a channel list added by all the nodes, a plurality of nodes included in each channel;
in the embodiment of the present invention, after the list of channels added by each node is obtained, the channels added by all the nodes may be merged to obtain each channel and a plurality of nodes corresponding to each channel, that is, the corresponding relationship between the channels and the nodes is obtained. Optionally, the corresponding relationship between the channels and the nodes may be stored in a database, where the database is deployed independently from the disks of the underlying block chain.
To this end, the number of current channels may be determined, and the number of current channels may be compared with the number of channels in the history, and if the number of channels is found to increase, it is indicated that a new channel is currently found.
A second determining module 204, configured to determine, for each of the channels, a target node from a plurality of nodes included in the channel;
a second obtaining module 205, configured to obtain, through the target node, original data on the channel;
in the embodiment of the present invention, after the target node is determined, the original data on the channel, that is, the original data stored on the disk of the bottom layer block chain node, may be obtained by the target node, where the original data on the disk is accurate, and the original data stored on the disk needs to be relied on when performing data analysis statistics.
A calculating module 206, configured to calculate statistical data of the channel according to the original data;
in the embodiment of the present invention, when determining a plurality of nodes included in each channel, that is, when determining that there are a plurality of channels currently, if a new channel is found, the original data on the new channel also needs to be acquired, and further, the statistical data on the new channel also needs to be calculated.
A sending module 207, configured to send the statistics of all the channels to the user.
In the embodiment of the present invention, if a new channel is found, the statistical data of all the channels also includes the statistical data of the new channel, and the server may send the current statistical data of all the channels to the user.
Optionally, the server may further store the statistical data of all the channels in a database. It should be noted that, if the data acquisition request of the user triggers the server to perform channel discovery, the server will re-acquire the original data on all channels, and re-calculate the statistical data to feed back to the user. If the data acquisition request of the user does not trigger the server to perform channel discovery, the server can directly acquire the pre-stored statistical data from the database and feed the statistical data back to the user.
As an optional implementation manner, the data sending apparatus may further include:
the establishing module is used for establishing a corresponding relation between the channel and the node;
the first determining module 203 is further configured to determine a new channel from the corresponding relationship;
the sending module 207 is further configured to send a notification message to the user, where the notification message is used to notify the user that the new channel is found.
In this optional embodiment, after determining a plurality of nodes included in each channel, a correspondence between the channels and the nodes may be established; from the correspondence, a new channel may be determined, and a notification message may be sent to the user in order to let the user know that a new channel is found. The sending time of the notification message and the sending time of the statistical data of all the channels may be the same or different, and the embodiment of the present invention is not limited.
As an optional implementation manner, the first obtaining module 202 includes:
the first judgment submodule is used for judging whether the communication of the nodes is normal or not aiming at each node in a preconfigured node list;
the first determining submodule is used for determining the node as an available node if the communication of the node is normal;
a first composition submodule, configured to compose all the available nodes into an available node list;
and the first acquisition submodule is used for acquiring a channel list added by each node in the available node list.
In this alternative embodiment, some nodes may communicate normally and some nodes may not communicate normally, for example, when a network failure occurs, the nodes may not communicate normally, and for example, when the service pressure of the nodes has exceeded the maximum service pressure threshold, the nodes may not communicate normally. If the node cannot normally communicate, the node cannot acquire the block and data information on the channel. Therefore, when channel discovery is performed, it is necessary to determine whether communication of each node in a preconfigured node list is normal; if the communication of the node is normal, the node may be determined to be an available node, and further, all the available nodes may be grouped into an available node list, and then a channel list added by the node is obtained for each node in the available node list.
As an optional implementation manner, the manner of determining, by the first determining sub-module, whether the communication of the node is normal specifically is:
acquiring the network connection state of the node; if the network connection state indicates that the network connection is normal, determining that the communication of the node is normal; or
Sending first information to the node; and if feedback information sent by the node aiming at the first information is received, determining that the communication of the node is normal.
Whether the communication of the node is normal may be determined in various ways, for example, the network connection state of the node may be obtained first, and if the network connection state indicates that the network connection is normal, it may be determined that the communication of the node is normal, whereas if the network connection state indicates that the network connection is disconnected, it may be determined that the communication of the node is abnormal; for another example, the first information may be sent to the node, where the first information may be any information that needs to be fed back by the node. If the feedback information sent by the node for the first information is received, it may be determined that the communication of the node is normal, otherwise, if the feedback information sent by the node for the first information is not received, it may be determined that the communication of the node is abnormal.
As an optional implementation manner, the first obtaining module 202 includes:
the second obtaining submodule is used for obtaining the identifier of each node in a preconfigured node list;
the second determining submodule is used for determining the node as an available node if the identifier of the node is the first identifier for indicating that the node is in an available state;
the second judgment submodule is used for judging whether the marking time length of the second identification is greater than the preset time length or not if the identification of the node is the second identification used for indicating that the node is in the unavailable state;
the change determining submodule is used for changing the second identifier into the first identifier and determining the node as an available node if the marking time length of the second identifier is greater than the preset time length;
a second composition submodule, configured to compose all the available nodes into an available node list;
the second obtaining submodule is further configured to obtain a channel list added to each node in the available node list.
In this alternative embodiment, each node may be marked with an identifier indicating whether the node is available, for example, identifier 1 indicates that the node is available, and identifier 0 indicates that the node is not available.
After the identifier of the node is obtained, if the identifier of the node is a first identifier used for indicating that the node is in an available state, the node can be determined to be an available node; when the identifier of the node is the second identifier indicating that the node is in the unavailable state, since the state of the node is in real-time change, the node is in the unavailable state when being marked, and a period of time may elapse, the node becomes the available state, but the second identifier of the node is not changed in time, it may be determined first whether the marking time duration of the second identifier of the node is greater than a preset time duration (for example, 10S), and if the marking time duration of the second identifier is greater than the preset time duration, it may be assumed that the node is an available node first, and the node is added to the available node list. Subsequently, when communicating with the node, if the node is found to be unable to normally communicate, the node may be determined to be an unavailable node, and the first identity of the node is changed to a second identity.
In this optional embodiment, whether the node is an available node may be determined according to the identifier on the node, and then the available node may be grouped into an available node list, so as to obtain a channel list added by each node in the available node list.
As an optional implementation manner, the second determining module 204 determines the target node from a plurality of nodes included in the channel in a specific manner:
determining a currently available node from a plurality of nodes included in the channel; determining a node in an idle state as a target node from the currently available nodes; or
Acquiring the service pressure of each node in each node included in the channel; and if the service pressure of the node is smaller than a preset pressure threshold value, determining that the node is a target node.
In this alternative embodiment, whether the node is an available node may be determined according to whether the communication of the node is normal, and the specific manner may refer to the above description. The state of the node can be divided into an idle state and a busy state, and if the node is in the idle state, the node can execute tasks at any time.
A preset pressure threshold may also be preset, where the preset pressure threshold is the maximum service pressure that the node can bear. If the service pressure of the node is smaller than the preset pressure threshold value, the node can provide other services.
In the embodiment of the invention, each channel comprises a plurality of nodes, block and data information on the channel can be acquired through the nodes, the timeliness of the tasks which can be executed by the nodes in different states at present is different, and the nodes with different service pressures do not have to be capable of executing new tasks. It is therefore necessary to determine a target node capable of performing a task in a timely manner or capable of performing a task from among a plurality of nodes included in the path.
As an optional implementation manner, the first determining module 203 is further configured to determine a receiving time of the data obtaining request after the receiving module 201 receives the data obtaining request of the user;
the data transmission apparatus further includes:
the judging module is used for judging whether the time interval between two adjacent times of receiving the data acquisition requests is greater than a preset time threshold value or not according to the receiving time;
the first obtaining module 202 is specifically configured to, if a time interval between two adjacent received data obtaining requests is greater than a preset time threshold, obtain, according to a preconfigured node list, a channel list added to each node in the node list.
In this alternative embodiment, the channel change at the bottom of the blockchain is not a process that occurs frequently, and is simply triggered by the access of the user, and if the access of the user is too frequent, a certain pressure is brought to the bottom of the blockchain, but the channel change condition is not obtained at the same time. Therefore, the time of two adjacent accesses needs to be limited, and a preset time threshold, such as 30S, can be preset.
When a data acquisition request of a user is received, the receiving time of the data acquisition request can be determined firstly; further, the time of receiving the data acquisition request last time (i.e. the time closest to this time) may be obtained, and it is determined whether the time interval between two adjacent times of receiving the data acquisition requests is greater than a preset time threshold; if the time interval between two adjacent times of receiving the data acquisition requests is greater than the preset time threshold, the access of the user is not frequent, and the server can be triggered to perform channel discovery. On the contrary, if the time interval between two adjacent times of receiving the data acquisition requests is less than or equal to the preset time threshold, the access frequency of the user is indicated, and in order to reduce the access pressure on the bottom layer of the block chain, the server does not perform channel discovery.
In the data sending apparatus described in fig. 2, after receiving a data obtaining request of a user, a channel list added by each node in the node list may be obtained according to a preconfigured node list, and then a plurality of nodes included in each channel may be determined according to the channel lists added by all the nodes, further, for each channel, a target node may be determined from the plurality of nodes included in the channel, and original data on the channel is obtained through the target node, and statistical data of the channel is calculated according to the original data, and finally, the statistical data of all the channels may be sent to the user. Therefore, in the invention, after receiving a data acquisition request of a user, the server can be triggered to acquire the channel list according to the node list, and a plurality of nodes included in each channel are determined, so that the current number of channels is determined, if an additional channel is added currently, a new channel can be found without being limited to a pre-configured channel list, the flexibility is higher, in addition, statistical data on all channels (including the new channel) can be fed back to the user, and therefore, the statistical data acquired by the user can be ensured to be always latest.
As shown in fig. 3, fig. 3 is a schematic structural diagram of a server according to a preferred embodiment of the present invention for implementing a data transmission method. The server 3 comprises a memory 31, at least one processor 32, a computer program 33 stored in the memory 31 and executable on the at least one processor 32, and at least one communication bus 34.
It will be appreciated by those skilled in the art that the schematic diagram shown in fig. 3 is merely an example of the server 3, and does not constitute a limitation of the server 3, and may include more or less components than those shown, or combine some components, or different components, for example, the server 3 may further include input and output devices, network access devices, etc.
The at least one Processor 32 may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. The processor 32 may be a microprocessor or the processor 32 may be any conventional processor or the like, and the processor 32 is a control center of the server 3 and connects the various parts of the entire server 3 by various interfaces and lines.
The memory 31 may be used to store the computer program 33 and/or the module/unit, and the processor 32 implements various functions of the server 3 by running or executing the computer program and/or the module/unit stored in the memory 31 and calling data stored in the memory 31. The memory 31 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required by at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, a phonebook, etc.) created according to the use of the server 3, and the like. In addition, the memory 31 may include a high speed random access memory, and may also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.
In conjunction with fig. 1, the memory 31 in the server 3 stores a plurality of instructions to implement a data transmission method, and the processor 32 can execute the plurality of instructions to implement:
receiving a data acquisition request of a user;
acquiring a channel list added by each node in a node list according to the node list configured in advance;
determining a plurality of nodes included in each channel according to the channel list added by all the nodes;
for each of the channels, determining a target node from a plurality of nodes included in the channel;
acquiring original data on the channel through the target node, and calculating statistical data of the channel according to the original data;
and sending the statistical data of all the channels to the user.
In an alternative embodiment, the processor 32 may execute the plurality of instructions to implement:
establishing a corresponding relation between the channels and the nodes;
determining a new channel from the corresponding relation;
and sending a notification message to the user, wherein the notification message is used for notifying the user that the new channel is found.
In an optional implementation manner, the obtaining, according to a preconfigured node list, a channel list added to each node in the node list includes:
judging whether the communication of the nodes is normal or not aiming at each node in a pre-configured node list;
if the communication of the node is normal, determining the node as an available node;
forming an available node list by all the available nodes;
and acquiring a channel list added by each node in the available node list.
In an optional implementation manner, the determining whether the communication of the node is normal includes:
acquiring the network connection state of the node; if the network connection state indicates that the network connection is normal, determining that the communication of the node is normal; or
Sending first information to the node; and if feedback information sent by the node aiming at the first information is received, determining that the communication of the node is normal.
In an optional implementation manner, the obtaining, according to a preconfigured node list, a channel list added to each node in the node list includes:
aiming at each node in a pre-configured node list, acquiring an identifier of the node;
if the identifier of the node is a first identifier for indicating that the node is in an available state, determining that the node is an available node;
if the identifier of the node is a second identifier for indicating that the node is in an unavailable state, judging whether the marking time length of the second identifier is greater than a preset time length;
if the marking time length of the second identifier is longer than the preset time length, changing the second identifier into the first identifier, and determining the node as an available node;
forming an available node list by all the available nodes;
and acquiring a channel list added by each node in the available node list.
In an optional embodiment, the determining a target node from a plurality of nodes included in the channel includes:
determining a currently available node from a plurality of nodes included in the channel; determining a node in an idle state as a target node from the currently available nodes; or
Acquiring the service pressure of each node in each node included in the channel; and if the service pressure of the node is smaller than a preset pressure threshold value, determining that the node is a target node.
In an alternative embodiment, after receiving the data acquisition request from the user, the processor 32 may execute the plurality of instructions to implement:
determining the receiving time of the data acquisition request;
judging whether the time interval between two adjacent received data acquisition requests is greater than a preset time threshold or not according to the receiving time;
if the time interval between two adjacent received data acquisition requests is greater than a preset time threshold, acquiring a channel list added by each node in the node list according to a pre-configured node list.
Specifically, the processor 32 may refer to the description of the relevant steps in the embodiment corresponding to fig. 1 for a specific implementation method of the instruction, which is not described herein again.
In the server 3 described in fig. 3, after receiving a data acquisition request of a user, a channel list added to each node in the node list may be acquired according to a preconfigured node list, and then a plurality of nodes included in each channel may be determined according to the channel lists added to all the nodes, further, for each channel, a target node may be determined from the plurality of nodes included in the channel, and original data on the channel is acquired through the target node, and statistical data of the channel is calculated according to the original data, and finally, the statistical data of all the channels may be sent to the user. Therefore, in the invention, after receiving a data acquisition request of a user, the server can be triggered to acquire the channel list according to the node list, and a plurality of nodes included in each channel are determined, so that the current number of channels is determined, if an additional channel is added currently, a new channel can be found without being limited to a pre-configured channel list, the flexibility is higher, in addition, statistical data on all channels (including the new channel) can be fed back to the user, and therefore, the statistical data acquired by the user can be ensured to be always latest.
The modules/units integrated with the server 3 may be stored in a computer-readable storage medium if they are implemented in the form of software functional units and sold or used as separate products. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium includes content that can be appropriately increased or decreased according to the requirements of legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunication signals according to legislation and patent practice.
In the embodiments provided in the present invention, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical functional division, and other divisions may be realized in practice.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional module.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned. Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the system claims may also be implemented by one unit or means in software or hardware. The terms second, etc. are used to denote names, but not any particular order.
Finally, it should be noted that the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.
Claims (8)
1. A method for transmitting data, the method comprising:
receiving a data acquisition request of a user;
acquiring a channel list added by each node in a node list according to the node list configured in advance;
determining a plurality of nodes included in each channel according to the channel list added by all the nodes, wherein the method comprises the following steps: merging the channels added by all the nodes, determining the number of the current channels, comparing the number of the current channels with the number of the channels in the history record, and determining that a new channel is added if the number of the channels is increased;
for each of the channels, determining a target node from a plurality of nodes included in the channel;
acquiring original data on the channel through the target node, and calculating statistical data of the channel according to the original data;
sending the statistical data of all the channels to the user;
the obtaining a channel list added by each node in the node list according to a preconfigured node list comprises: judging whether the communication of the nodes is normal or not aiming at each node in a pre-configured node list; if the communication of the node is normal, determining the node as an available node; forming an available node list by all the available nodes; acquiring a channel list added by each node in the available node list; or
The obtaining a channel list added by each node in the node list according to a preconfigured node list comprises: aiming at each node in a pre-configured node list, acquiring an identifier of the node; if the identifier of the node is a first identifier for indicating that the node is in an available state, determining that the node is an available node; if the identifier of the node is a second identifier for indicating that the node is in an unavailable state, judging whether the marking time length of the second identifier is greater than a preset time length; if the marking time length of the second identifier is greater than the preset time length, changing the second identifier into the first identifier, and determining the node as an available node; forming an available node list by all the available nodes; and acquiring a channel list added by each node in the available node list.
2. The method of claim 1, further comprising:
establishing a corresponding relation between the channels and the nodes;
determining a new channel from the corresponding relation;
and sending a notification message to the user, wherein the notification message is used for notifying the user that the new channel is found.
3. The method of claim 1, wherein the determining whether the communication of the node is normal comprises:
acquiring the network connection state of the node; if the network connection state indicates that the network connection is normal, determining that the communication of the node is normal; or
Sending first information to the node; and if feedback information sent by the node aiming at the first information is received, determining that the communication of the node is normal.
4. The method according to any one of claims 1 to 3, wherein the determining a target node from a plurality of nodes comprised by the channel comprises:
determining a currently available node from a plurality of nodes included in the channel; determining a node in an idle state as a target node from the currently available nodes; or
Acquiring the service pressure of each node in each node included in the channel; and if the service pressure of the node is smaller than a preset pressure threshold value, determining that the node is a target node.
5. The method according to any one of claims 1 to 3, wherein after receiving the data acquisition request of the user, the method further comprises:
determining the receiving time of the data acquisition request;
judging whether the time interval between two adjacent received data acquisition requests is greater than a preset time threshold or not according to the receiving time;
if the time interval between two adjacent received data acquisition requests is greater than a preset time threshold, acquiring a channel list added by each node in the node list according to a pre-configured node list.
6. A data transmission apparatus, characterized in that the data transmission apparatus comprises:
the receiving module is used for receiving a data acquisition request of a user;
the first acquisition module is used for acquiring a channel list added by each node in the node list according to a preconfigured node list;
a first determining module, configured to determine, according to a channel list added by all the nodes, a plurality of nodes included in each channel, where the determining module includes: merging the channels added by all the nodes, determining the number of the current channels, comparing the number of the current channels with the number of the channels in the history record, and determining that a new channel is added if the number of the channels is increased;
a second determining module, configured to determine, for each of the channels, a target node from a plurality of nodes included in the channel;
a second obtaining module, configured to obtain, through the target node, original data on the channel;
the calculation module is used for calculating the statistical data of the channel according to the original data;
a sending module, configured to send the statistics of all the channels to the user;
the first obtaining module is further configured to obtain, according to a preconfigured node list, a channel list added to each node in the node list, where the obtaining includes: judging whether the communication of the nodes is normal or not aiming at each node in a pre-configured node list; if the communication of the node is normal, determining the node as an available node; forming an available node list by all the available nodes; acquiring a channel list added by each node in the available node list; or
The first obtaining module is further configured to obtain, according to a preconfigured node list, a channel list added to each node in the node list, where the obtaining includes: aiming at each node in a pre-configured node list, acquiring an identifier of the node; if the identifier of the node is a first identifier for indicating that the node is in an available state, determining that the node is an available node; if the identifier of the node is a second identifier for indicating that the node is in an unavailable state, judging whether the marking time length of the second identifier is greater than a preset time length; if the marking time length of the second identifier is greater than the preset time length, changing the second identifier into the first identifier, and determining the node as an available node; forming an available node list by all the available nodes; and acquiring a channel list added by each node in the available node list.
7. A server, characterized in that the server comprises a processor and a memory, the processor being configured to execute a computer program stored in the memory to implement the data transmission method according to any one of claims 1 to 5.
8. A computer-readable storage medium storing at least one instruction which, when executed by a processor, implements a data transmission method according to any one of claims 1 to 5.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910381100.6A CN110290168B (en) | 2019-05-08 | 2019-05-08 | Data transmission method, device, server and storage medium |
| PCT/CN2019/121378 WO2020224243A1 (en) | 2019-05-08 | 2019-11-27 | Data sending method and device, server and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910381100.6A CN110290168B (en) | 2019-05-08 | 2019-05-08 | Data transmission method, device, server and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110290168A CN110290168A (en) | 2019-09-27 |
| CN110290168B true CN110290168B (en) | 2022-04-12 |
Family
ID=68002149
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910381100.6A Active CN110290168B (en) | 2019-05-08 | 2019-05-08 | Data transmission method, device, server and storage medium |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110290168B (en) |
| WO (1) | WO2020224243A1 (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110290168B (en) * | 2019-05-08 | 2022-04-12 | 深圳壹账通智能科技有限公司 | Data transmission method, device, server and storage medium |
| CN112507028B (en) * | 2020-12-18 | 2023-02-21 | 杭州趣链科技有限公司 | Data storage method, device, equipment and storage medium |
| CN113395675B (en) * | 2021-06-02 | 2023-07-04 | 联合汽车电子有限公司 | Data processing method, vehicle control system and readable storage medium |
| CN113572824B (en) * | 2021-07-07 | 2023-01-10 | 北京奇艺世纪科技有限公司 | Dynamic updating method and device for timeout duration, electronic equipment and storage medium |
| CN116866450A (en) * | 2023-06-08 | 2023-10-10 | 兴华永恒（北京）科技有限责任公司 | Data transmission method, device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107833139A (en) * | 2017-11-23 | 2018-03-23 | 上海壹账通金融科技有限公司 | Transaction data processing method, device, computer equipment and storage medium |
| CN108537666A (en) * | 2018-04-09 | 2018-09-14 | 深圳市云蚂蚁科技有限责任公司 | A kind of block catenary system and block chain network method of commerce |
| CN109242681A (en) * | 2018-08-21 | 2019-01-18 | 北京京东金融科技控股有限公司 | Storage method, device, equipment and the system of asset data |
| CN109634810A (en) * | 2018-12-10 | 2019-04-16 | 广东亿迅科技有限公司 | Block chain business platform and operation method based on Fabric |
| CN109670951A (en) * | 2018-11-19 | 2019-04-23 | 苏宁易购集团股份有限公司 | A kind of block chain intelligence contract debugging dissemination method and system |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105635331B (en) * | 2014-11-18 | 2019-10-18 | 阿里巴巴集团控股有限公司 | Service addressing method and device under a kind of distributed environment |
| US10116667B2 (en) * | 2016-01-26 | 2018-10-30 | Bank Of America Corporation | System for conversion of an instrument from a non-secured instrument to a secured instrument in a process data network |
| CN106452785B (en) * | 2016-09-29 | 2019-05-17 | 财付通支付科技有限公司 | Block chain network, branch node and block chain network application method |
| CN108696589B (en) * | 2018-05-14 | 2022-04-08 | 百度在线网络技术（北京）有限公司 | Block chain data transmission method, device, equipment and storage medium |
| CN108777712B (en) * | 2018-05-31 | 2020-04-07 | 中国联合网络通信集团有限公司 | Block chain node communication method and device and block chain node |
| CN109246179B (en) * | 2018-06-30 | 2021-06-01 | 华为技术有限公司 | Method and apparatus for maintaining blockchain, server, and computer-readable storage medium |
| CN109040227B (en) * | 2018-07-27 | 2021-08-03 | 江西贪玩信息技术有限公司 | Service request response method and device based on block chain and computer equipment |
| CN109087104A (en) * | 2018-08-29 | 2018-12-25 | 北京京东尚科信息技术有限公司 | Block chain intelligence contract administration method and system, computer readable storage medium |
| CN110290168B (en) * | 2019-05-08 | 2022-04-12 | 深圳壹账通智能科技有限公司 | Data transmission method, device, server and storage medium |
-
2019
- 2019-05-08 CN CN201910381100.6A patent/CN110290168B/en active Active
- 2019-11-27 WO PCT/CN2019/121378 patent/WO2020224243A1/en active Application Filing
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107833139A (en) * | 2017-11-23 | 2018-03-23 | 上海壹账通金融科技有限公司 | Transaction data processing method, device, computer equipment and storage medium |
| CN108537666A (en) * | 2018-04-09 | 2018-09-14 | 深圳市云蚂蚁科技有限责任公司 | A kind of block catenary system and block chain network method of commerce |
| CN109242681A (en) * | 2018-08-21 | 2019-01-18 | 北京京东金融科技控股有限公司 | Storage method, device, equipment and the system of asset data |
| CN109670951A (en) * | 2018-11-19 | 2019-04-23 | 苏宁易购集团股份有限公司 | A kind of block chain intelligence contract debugging dissemination method and system |
| CN109634810A (en) * | 2018-12-10 | 2019-04-16 | 广东亿迅科技有限公司 | Block chain business platform and operation method based on Fabric |
Non-Patent Citations (3)
| Title |
|---|
| Hyperledger fabric: a distributed operating system for permissioned blockchains;E. Androulaki, A. Barger, V. Bortnikov, et al;《the Thirteenth EuroSys Comference》;20180423;1-15页 * |
| On blockchain-based anonymized dataset distribution platform;S. Kiyomoto, M. S. Rahman, A. Basu;《2017 IEEE 15th International Conference on Software Engineering Research, Management and Applications》;20170703;85-92页 * |
| 区块链技术的安全问题研究综述;顾欣，徐淑珍;《信息安全研究》;20181130(第11期);998-999页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020224243A1 (en) | 2020-11-12 |
| CN110290168A (en) | 2019-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110290168B (en) | Data transmission method, device, server and storage medium | |
| CN107819829B (en) | Method and system for accessing block chain, block chain node point equipment and user terminal | |
| CN109165136B (en) | Terminal operation data monitoring method, terminal device and medium | |
| CN111556120B (en) | Data processing method and device based on block chain, storage medium and equipment | |
| CN111163130B (en) | Network service system and data transmission method thereof | |
| CN107819615B (en) | Equipment self-adaptive access method and device and master control equipment | |
| CN111460458B (en) | Data processing method, related device and computer storage medium | |
| CN109151025B (en) | Load balancing method and device based on URL, computer storage medium and equipment | |
| CN110597918A (en) | Account management method and device and computer readable storage medium | |
| EP3598333B1 (en) | Electronic device update management | |
| CN109885786A (en) | Data buffer storage processing method, device, electronic equipment and readable storage medium storing program for executing | |
| CN111447069B (en) | Low-frequency access data processing method based on block chain | |
| CN110049031B (en) | Interface security authentication method, server and authentication center server | |
| CN114268957B (en) | Abnormal business data processing method, device, server and storage medium | |
| CN111490890A (en) | Hierarchical registration method, device, storage medium and equipment based on micro-service architecture | |
| CN110688523A (en) | Video service providing method, device, electronic equipment and storage medium | |
| TW202112113A (en) | Resource sharing method, device, computer device and storage media | |
| CN111193677B (en) | Method, device and medium for attributing FC (fiber channel) port of host to corresponding host | |
| CN113966602B (en) | Distributed storage of blocks in a blockchain | |
| CN110784510A (en) | Method for accessing target service node to bus and information interaction method of service node | |
| CN111045989A (en) | Method, device and medium for querying CPLD version information | |
| CN115328509A (en) | Algorithm changing method, device, computer equipment and storage medium | |
| CN112788551B (en) | Message processing method and device, terminal equipment and storage medium | |
| CN114745809A (en) | Network connection method, device, terminal equipment and storage medium | |
| CN110704198A (en) | Data operation method, device, storage medium and processor |
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 |