CN111431997A - Cross-department data transmission method - Google Patents
Cross-department data transmission method Download PDFInfo
- Publication number
- CN111431997A CN111431997A CN202010206095.8A CN202010206095A CN111431997A CN 111431997 A CN111431997 A CN 111431997A CN 202010206095 A CN202010206095 A CN 202010206095A CN 111431997 A CN111431997 A CN 111431997A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- target
- department
- nodes
- 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
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/14—Session management
- H04L67/141—Setup of application sessions
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
-
- 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/24—Traffic characterised by specific attributes, e.g. priority or QoS
- H04L47/2416—Real-time traffic
-
- 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/12—Applying verification of the received information
- H04L63/123—Applying verification of the received information received data contents, e.g. message integrity
-
- 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
-
- 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/14—Session management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators
- H04L9/0643—Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Power Engineering (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Information Transfer Between Computers (AREA)
Abstract
The invention provides a cross-department data transmission method. The method comprises the following steps: establishing a special network for connecting a source node and a target node; establishing a peer-to-peer network in which a source node is connected with a target node and the target nodes are mutually connected; judging the type of data to be transmitted by a source node; if the data is common data, transmitting the data to a target node through a special network; and if the data is real-time data, switching the private network into a peer-to-peer network and transmitting the data to the target node through the peer-to-peer network. The embodiment of the invention provides a method for transmitting cross-department data, which adopts different sending modes for transmitting real-time data and common data, and adopts a special network for transmitting the common data, thereby ensuring the transmission reliability and safety; and the transmission of real-time data through the peer-to-peer network effectively improves the transmission rate of the real-time data and meets the requirement of transmitting the real-time data to a plurality of target nodes at the same time.
Description
[ technical field ] A method for producing a semiconductor device
The invention relates to the technical field of communication, in particular to a cross-department data transmission method.
[ background of the invention ]
With the rapid development of scientific technology, more and more emergencies need to be dealt with every day, the complexity and difficulty level of the emergencies are continuously increased, and the emergency command center needs to transmit instructions and policies to each department in time. However, a large amount of data information is directly transmitted through the internet, the transmission process is slow, the timeliness and the spectrum dependence of data transmission cannot be guaranteed, and the method is not beneficial to timely saving lives and properties of the country and people.
[ summary of the invention ]
In view of this, an embodiment of the present invention provides a cross-department data transmission method.
In one aspect, an embodiment of the present invention provides a cross-department data transmission method, where the method includes:
s1, establishing a special network for connecting the source node and the target node;
s2, establishing a peer-to-peer network which is connected between the source node and the target node and is connected between the target nodes;
s3, judging the type of the data to be transmitted by the source node;
s4, if the data is common data, transmitting the data to the target node through the private network;
and S5, if the data is real-time data, switching the private network into a peer-to-peer network and transmitting the data to the target node through the peer-to-peer network.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
s6, dividing the target nodes by taking departments as units to establish a plurality of first department node groups;
s7, adding the source nodes into each first department node group to generate a plurality of second department node groups;
s8, adding each target node into at least one other second department node group to generate a plurality of third department node groups;
s9, establishing uploading connection between the source node and a plurality of target nodes in each third department node group;
s10, establishing at least two uploading connections and two downloading connections between the target node in each third department node group and other target nodes in the same group, wherein the uploading connections and the downloading connections are unidirectional UDP connections;
and S11, establishing at least one downloading connection and uploading connection between the target node in each third department node group and the target nodes in other third department node groups.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
s12, when a rotation period is reached and the connectivity of a third department node group is smaller than a connection threshold, generating a rotation list according to the sharing degree of a target node in the peer-to-peer network and the priority, wherein the connectivity L of the third department node group is calculated according to a formula (I):
wherein α is the total number of the target nodes in all the groups of the designated third department node group, β is the number of the target nodes in the designated third department node group, χ is the total number of the target nodes in the designated third department node group, the number of the connections established in the target node group of the designated third department node group, r is the number of the connections established between the target nodes and the source nodes in the third department node group,
the average value of the performance values of the target nodes in the rotation period of the appointed third department node group is obtained, wherein X is a first correction constant, Z is a second correction constant, and Y is a third correction constant;
s13, judging whether the target node of the rotation list is connected with the source node, if not, executing the step S14,
and S14, replacing two target nodes with the lowest sharing degree in a third department node group with the connection degree smaller than the connection threshold value with target nodes without the alternation record in the alternation list according to the priority sequence, and keeping the downloading connection and the uploading connection of the third department node group unchanged.
The above-described aspect and any possible implementation manner further provide an implementation manner, where the sharing degree F of the target node is calculated according to formula (two):
wherein m is the number of the data blocks uploaded by the target node in the rotation period, Q is the performance value of the target node in the rotation period, and μ is the total number of all the third department node groups of the target node.
The above-described aspect and any possible implementation manner further provide an implementation manner, further including, after step S14:
s15, counting the performance values of the target nodes in each third department node group, sequencing the performance values from high to low, disconnecting the target nodes connected with the source nodes from the source nodes, reestablishing the same number of connections between the target nodes in each third department node group and the source nodes according to the priority sequence of the performance values, and calculating the performance values according to a formula (III):
wherein the content of the first and second substances,
representing normalization operation, a and b are adjustment coefficients satisfying a, b ∈ [0, 1%]And a + b is 1; v. ofiThe ratio of the size of the transmission data to the downloading time; w1The average value of the data transmission speed of n times in the target node rotation period is obtained; w2And the standard deviation of the data transmission speed for m times in the rotation period of the target node is obtained.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
s16, counting target nodes connected with the source node in each third department node group, and generating a receiving list according to the performance value priority;
s17, dividing the data to be transmitted into M data blocks with the same size, and numbering the data blocks from small to large according to the sequence;
and S18, sequentially sending a data block to each target node recorded on the receiving list and performing cycle traversal until the data block is completely sent.
The above-described aspects and any possible implementations further provide an implementation, and the method further includes:
s19, dividing each data block into N data sub-blocks with the same size, wherein N is the same as the number of target nodes on the receiving list;
s20, establishing a dynamic Mercker hash tree according to a plurality of data blocks, calculating a root node signature of the dynamic Mercker hash tree, calculating a signature of each data block, and sending the root node signature and the signature of each data block to a target node;
s21, the target node verifies each data block using the signature attached to the data block;
s22, if the verification cannot be carried out, discarding the data block; otherwise, executing step S23;
s23, the target node informs other target nodes with download connection to stop sending the data block to the target node;
and S24, the target node verifies the integrity of the transmission data by using the signature attached to the data block and the signature of the root node, and if the transmission data is not complete, the source node is informed to resend the data.
One of the above technical solutions has the following beneficial effects:
the embodiment of the invention provides a method for transmitting cross-department data, which adopts different sending modes for transmitting real-time data and common data, and adopts a special network for transmitting the common data, thereby ensuring the transmission reliability and safety; and the transmission of real-time data through the peer-to-peer network effectively improves the transmission rate of the real-time data and meets the requirement of transmitting the real-time data to a plurality of target nodes at the same time.
[ description of the drawings ]
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive labor.
Fig. 1 is a schematic flowchart of a cross-department data transmission method according to embodiment 1 of the present invention;
fig. 2 is a schematic flowchart of a cross-department data transmission method according to embodiment 2 of the present invention;
fig. 3 is a schematic flowchart of a cross-department data transmission method according to embodiment 3 of the present invention;
fig. 4 is a schematic flowchart of a cross-department data transmission method according to embodiment 4 of the present invention;
fig. 5 is a flowchart illustrating a cross-department data transmission method according to embodiment 5 of the present invention.
[ detailed description ] embodiments
For better understanding of the technical solutions of the present invention, the following detailed descriptions of the embodiments of the present invention are provided with reference to the accompanying drawings.
It should be understood that the described embodiments are only some embodiments of the invention, and not all 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.
The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
It should be understood that although the terms first and second may be used to describe the point sets in the embodiments of the present invention, these point sets should not be limited to these terms. These terms are only used to distinguish sets of points from each other. For example, a first set of points may also be referred to as a second set of points, and similarly, a second set of points may also be referred to as a first set of points, without departing from the scope of embodiments of the present invention.
The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context. Similarly, the phrases "if determined" or "if detected (a stated condition or event)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.
Example 1
An embodiment of the present invention provides a method for a cross-department data transmission method, please refer to fig. 1, where the method includes the following steps:
s1, establishing a special network for connecting the source node and the target node, wherein the establishment of the special network adopts the existing conventional technology;
s2, establishing a peer-to-peer network which is connected between the source node and the target node and is connected between the target nodes;
s3, judging the type of the data to be transmitted by the source node;
s4, if the data is common data, transmitting the data to the target node through the private network;
and S5, if the data is real-time data, switching the private network into a peer-to-peer network and transmitting the data to the target node through the peer-to-peer network.
According to the method for transmitting the cross-department data, different sending modes are adopted for transmitting the real-time data and the common data, and the common data are transmitted by adopting a special network, so that the transmission reliability and safety are ensured; and the transmission of real-time data through the peer-to-peer network effectively improves the transmission rate of the real-time data and meets the requirement of transmitting the real-time data to a plurality of target nodes at the same time. The source node and the target node are both a client and a server, the source node may include a network switching module, when switching to the peer-to-peer network, the source node sends real-time data to the target node in the peer-to-peer network based on the peer-to-peer protocol, and when switching to the private network, the source node sends general data to a corresponding department server to which the target node belongs, and the general data is forwarded to the target node by the department server.
Example 2
An embodiment of the present invention provides a cross-department data transmission method, which is different from embodiment 1 in that, as shown in fig. 2, the method further includes the following steps:
s6, dividing the target nodes by taking departments as units to establish a plurality of first department node groups;
the verification division can be performed by the special network request department server through the node, and the direct verification division can be performed on the IP address and the port number of the receiving node through the peer-to-peer protocol by the source node;
s7, adding the source nodes into each first department node group to generate a plurality of second department node groups;
s8, adding each target node into at least one other second department node group to generate a plurality of third department node groups;
the target node is added into at least one other second department node group, so that each third department node group is identical or close to identical in number. Other load balancing algorithms may also be used to recommend target node joining.
S9, establishing uploading connection between the source node and a plurality of target nodes in each third department node group, wherein the uploading connection is one-way UDP connection;
s10, establishing at least two uploading connections and two downloading connections between the target node in each third department node group and other target nodes in the same group, wherein the uploading connections and the downloading connections are one-way UDP connections;
and S11, establishing at least two downloading connections and two uploading connections between the target node in each third-department node group and other target nodes in other third-department node groups added by the target node, wherein the uploading connections and the downloading connections are unidirectional UDP connections.
According to the method, a plurality of first department node groups are established, a source node is added into each first department node group to generate a plurality of second department node groups, each target node is added into at least one other second department node group to generate a plurality of third department node groups, a new peer-to-peer network transmission framework is established, the functions of idle departments or nodes are fully exerted aiming at the large differences of broadband and node performance among departments, UDP transmission is applied to the peer-to-peer network, real-time data transmission is supported, and the timeliness of transmission is guaranteed; in addition, the performance of different groups is shared, the balance of the overall performance of the peer-to-peer network is facilitated, and transmission obstruction caused by insufficient uploading capacity and downloading capacity of individual nodes is avoided; in addition, the target node establishes at least two upload connections and two download connections, so that data is transmitted at an exponential rate, and the data is spread at a faster rate in the peer-to-peer network.
Example 3
An embodiment of the present invention provides a cross-department data transmission method, which is different from embodiment 2 in that, as shown in fig. 3, the method further includes the following steps:
s12, when a rotation period is reached and the connectivity of a third department node group is smaller than a connection threshold, a rotation list is generated according to the sharing degree of a target node in the peer-to-peer network from high to low according to the priority, and the connectivity L of the third department node group is calculated according to a formula (I):
α is the total number of the target nodes in all the groups of the third department node group, β is the number of the target nodes in the third department node group, χ is the target nodes in the third department node groupThe total number of established connections, the number of established connections within a target node group for a given third-department node group, r is the number of established connections between the target node and the source node of the third-department node group,
the average value of the performance values of the target nodes in the rotation period of the appointed third department node group is obtained, wherein X is a first correction constant, Z is a second correction constant, and Y is a third correction constant;
the sharing degree F of the target node is calculated according to a formula (II):
wherein m is the number of the data blocks uploaded by the target node in the rotation period, Q is a performance value of the target node in the rotation period, and mu is the total number of all the third department node groups of the target node;
s13, judging whether the target node of the rotation list is connected with the source node, if not, executing the step S14,
and S14, replacing two target nodes with the lowest sharing degree in a third department node group with the connection degree smaller than the connection threshold value with target nodes without the alternation record in the alternation list according to the priority sequence, and keeping the downloading connection and the uploading connection of the third department node group unchanged.
S15, counting performance values of the target nodes in each third department node group, sequencing the performance values from high to low, disconnecting the target nodes connected with the source nodes from the source nodes, reestablishing the same number of connections between the target nodes in each third department node group and the source nodes according to the priority sequence of the performance values, and calculating the performance values according to a formula (III):
wherein the content of the first and second substances,
representing normalization operation, a and b are adjustment coefficients satisfying a, b ∈ [0, 1%]And a + b is 1; v. ofiThe ratio of the size of the transmission data to the downloading time; w1The average value of the data transmission speed of n times in the target node rotation period is obtained; w2And the standard deviation of the data transmission speed for m times in the rotation period of the target node is obtained.
In the method provided by the application, the performance among the groups is balanced by setting a node alternation mechanism, and the overall data transmission speed of the peer-to-peer network is improved; after the nodes are rotated, the target nodes connected with the source nodes are rotated according to the performance values, so that the bottleneck of starting transmission of the peer-to-peer network is opened, and data can be distributed to the peer-to-peer network more quickly.
Example 4
An embodiment of the present invention provides a cross-department data transmission method, which is different from embodiment 3 in that, as shown in fig. 4, the method further includes the following steps:
s16, counting target nodes connected with the source node in each third department node group, and generating a receiving list from high to low according to the priority of the performance value;
s17, dividing the data to be transmitted into M data blocks with the same size, and numbering the data blocks from small to large according to the sequence;
and S18, sequentially sending a data block to each target node recorded on the receiving list and performing cycle traversal until the data block is completely sent.
Example 5
An embodiment of the present invention provides a cross-department data transmission method, which is different from embodiment 1 in that, as shown in fig. 5, the method further includes the following steps:
s19, dividing each data block into N data sub-blocks with the same size, wherein N is the same as the number of target nodes on the receiving list;
s20, establishing a dynamic Mercker hash tree according to a plurality of data blocks, calculating a root node signature of the dynamic Mercker hash tree, calculating a signature of each data block, and sending the root node signature and the signature of each data block to a target node;
the basic principle is that the whole file is divided into a plurality of small file blocks, the file blocks are subjected to hash operation, then the hash values of the file blocks are connected in a tree structure, and the connected values are re-hashed, and the connection and re-hashing are repeated until a separate root hash is generated, in a data field part of the Merck hash tree, the nodes of each Dynamic Merck Hash Tree (DMHT) can contain two parts of information, namely a hash value and a relative sequence number, wherein the relative sequence number is used for representing the number of leaf nodes taking the current node as a root node of a subtree, the relative sequence number of the leaf node is 1 and is used for representing the relative sequence number, the relative sequence number is obtained by combining the data field part information of the left and right child nodes, in the DMHT, Auxiliary Authentication Information (AAI) is obtained by combining the hash values of the data field part information of the left and right child nodes, and the Auxiliary Authentication Information (AAI) is obtained by adopting a short-leaf signature scheme L from the leaf nodes to the root node, and the leaf nodes are signed on the relative sibling path of the DMHT;
s21, the target node verifies each data block using the signature attached to the data block;
s22, if the verification cannot be carried out, discarding the data block; otherwise, executing step S23;
s23, the target node informs other target nodes with download connection to stop sending the data block to the target node;
and S24, the target node verifies the integrity of the transmission data by using the signature attached to the data block and the signature of the root node, and if the transmission data is not complete, the source node is informed to resend the data.
In the method provided by the application, in order to improve the storage efficiency and the verification efficiency to the maximum extent, the data to be transmitted is divided into M data blocks with the same size, each data block is divided into N data sub-blocks with the same size, and the data file is divided, wherein N is the same as the number of target nodes on a receiving list; by carrying out signature verification on the data blocks, when the target node receives data, the data blocks which are not verified are not received, and other target nodes with download connection are informed to stop sending corresponding data blocks to the target node after the data blocks are received, so that data redundancy is avoided; the signature attached to the data block and the root node signature are used for verifying the integrity of the transmitted data, and the integrity of the data received by the target node is guaranteed.
Another embodiment of the present invention provides another computer-readable storage medium, which may be the computer-readable storage medium contained in the memory in the above-described embodiment; or it may be a separate computer-readable storage medium not incorporated in the terminal. The computer readable storage medium stores one or more programs for use by one or more processors in performing the methods provided by the embodiments.
The embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), or the like.
The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (7)
1. A method for cross-department data transmission, the method comprising:
s1, establishing a special network for connecting the source node and the target node;
s2, establishing a peer-to-peer network which is connected between the source node and the target node and is connected between the target nodes;
s3, judging the type of the data to be transmitted by the source node;
s4, if the data is common data, transmitting the data to the target node through the private network;
and S5, if the data is real-time data, switching the private network into a peer-to-peer network and transmitting the data to the target node through the peer-to-peer network.
2. The method according to claim 1, characterized in that the method further comprises the steps of:
s6, dividing the target nodes by taking departments as units to establish a plurality of first department node groups;
s7, adding the source nodes into each first department node group to generate a plurality of second department node groups;
s8, adding each target node into at least one other second department node group to generate a plurality of third department node groups;
s9, establishing uploading connection between the source node and a plurality of target nodes in each third department node group;
s10, establishing at least two uploading connections and two downloading connections between the target node in each third department node group and other target nodes in the same group, wherein the uploading connections and the downloading connections are unidirectional UDP connections;
and S11, establishing at least two downloading connections and two uploading connections between the target node in each third department node group and the target nodes in other third department node groups.
3. The method according to claim 2, characterized in that the method further comprises the steps of:
s12, when a rotation period is reached and the connectivity of a third department node group is smaller than a connection threshold, generating a rotation list according to the sharing degree of a target node in the peer-to-peer network and the priority, wherein the connectivity L of the third department node group is calculated according to a formula (I):
wherein α is the total number of the target nodes in all the groups of the designated third department node group, β is the number of the target nodes in the designated third department node group, χ is the total number of the target nodes in the designated third department node group, the number of the connections established in the target node group of the designated third department node group, r is the number of the connections established between the target nodes and the source nodes in the third department node group,
the average value of the performance values of the target nodes in the rotation period of the appointed third department node group is obtained, wherein X is a first correction constant, Z is a second correction constant, and Y is a third correction constant;
s13, judging whether the target node of the rotation list is connected with the source node, if not, executing the step S14,
and S14, replacing two target nodes with the lowest sharing degree in a third department node group with the connection degree smaller than the connection threshold value with target nodes without the alternation record in the alternation list according to the priority sequence, and keeping the downloading connection and the uploading connection of the third department node group unchanged.
4. The method according to claim 3, wherein the sharing degree F of the target node is calculated according to the formula (two):
wherein m is the number of the data blocks uploaded by the target node in the rotation period, Q is the performance value of the target node in the rotation period, and μ is the total number of all the third department node groups of the target node.
5. The method according to claim 4, further comprising, after step S14:
s15, counting performance values of the target nodes in each third department node group, sequencing the performance values from high to low, disconnecting the target nodes connected with the source nodes from the source nodes, reestablishing the same number of connections between the target nodes in each third department node group and the source nodes according to the priority sequence of the performance values, and calculating the performance values according to a formula (III):
wherein the content of the first and second substances,
representing normalization operation, a and b are adjustment coefficients satisfying a, b ∈ [0, 1%]And a + b is 1; v. ofiThe ratio of the size of the transmission data to the downloading time; w1The average value of the data transmission speed of n times in the target node rotation period is obtained; w2And the standard deviation of the data transmission speed for m times in the rotation period of the target node is obtained.
6. The method of claim 5, further comprising the steps of:
s16, counting target nodes connected with the source node in each third department node group, and generating a receiving list according to the performance value priority;
s17, dividing the data to be transmitted into M data blocks with the same size, and numbering the data blocks from small to large according to the sequence;
and S18, sequentially sending a data block to each target node recorded on the receiving list and performing cycle traversal until the data block is completely sent.
7. The method of claim 6, further comprising the steps of:
s19, dividing each data block into N data sub-blocks with the same size, wherein N is the same as the number of target nodes on the receiving list;
s20, establishing a dynamic Mercker hash tree according to a plurality of data blocks, calculating a root node signature of the dynamic Mercker hash tree, calculating a signature of each data block, and sending the root node signature and the signature of each data block to a target node;
s21, the target node verifies each data block using the signature attached to the data block;
s22, if the verification cannot be carried out, discarding the data block; otherwise, executing step S23;
s23, the target node informs other target nodes with download connection to stop sending the data block to the target node;
and S24, the target node verifies the integrity of the transmission data by using the signature attached to the data block and the signature of the root node, and if the transmission data is not complete, the source node is informed to resend the data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010206095.8A CN111431997B (en) | 2020-03-23 | 2020-03-23 | Cross-department data transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010206095.8A CN111431997B (en) | 2020-03-23 | 2020-03-23 | Cross-department data transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111431997A true CN111431997A (en) | 2020-07-17 |
| CN111431997B CN111431997B (en) | 2020-11-17 |
Family
ID=71548569
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010206095.8A Active CN111431997B (en) | 2020-03-23 | 2020-03-23 | Cross-department data transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111431997B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6760328B1 (en) * | 1999-10-14 | 2004-07-06 | Synchrodyne Networks, Inc. | Scheduling with different time intervals |
| CN1992602A (en) * | 2005-12-29 | 2007-07-04 | 盛趣信息技术（上海）有限公司 | Method for implementing real-time broadcast to the downloaded multimedia file based on P2P network |
| CN101087403A (en) * | 2007-05-31 | 2007-12-12 | 吴彬 | Distributed stream media order system based on P2P technology and implementation method for stream media program order |
| CN101800731A (en) * | 2009-02-06 | 2010-08-11 | 株式会社日立制作所 | Network transmission management server, network transmission management method and network transmission system |
| CN103731907A (en) * | 2013-12-24 | 2014-04-16 | 广西大学 | Network selection method based on multi-network convergence and multi-mode terminal device |
| CN105227276A (en) * | 2015-09-30 | 2016-01-06 | 河南大学 | A kind of peer-to-peer network data transmission method based on UDT |
| CN107181783A (en) * | 2016-03-11 | 2017-09-19 | 上汽通用汽车有限公司 | The method and apparatus for transmitting data using Ethernet in vehicle |
-
2020
- 2020-03-23 CN CN202010206095.8A patent/CN111431997B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6760328B1 (en) * | 1999-10-14 | 2004-07-06 | Synchrodyne Networks, Inc. | Scheduling with different time intervals |
| CN1992602A (en) * | 2005-12-29 | 2007-07-04 | 盛趣信息技术（上海）有限公司 | Method for implementing real-time broadcast to the downloaded multimedia file based on P2P network |
| CN101087403A (en) * | 2007-05-31 | 2007-12-12 | 吴彬 | Distributed stream media order system based on P2P technology and implementation method for stream media program order |
| CN101800731A (en) * | 2009-02-06 | 2010-08-11 | 株式会社日立制作所 | Network transmission management server, network transmission management method and network transmission system |
| CN103731907A (en) * | 2013-12-24 | 2014-04-16 | 广西大学 | Network selection method based on multi-network convergence and multi-mode terminal device |
| CN105227276A (en) * | 2015-09-30 | 2016-01-06 | 河南大学 | A kind of peer-to-peer network data transmission method based on UDT |
| CN107181783A (en) * | 2016-03-11 | 2017-09-19 | 上汽通用汽车有限公司 | The method and apparatus for transmitting data using Ethernet in vehicle |
Non-Patent Citations (1)
| Title |
|---|
| 张莉等: "基于互联网信息传输的网络大数据校准技术研究", 《光通信与网络》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111431997B (en) | 2020-11-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3907973A1 (en) | Method for establishing communication connection and proxy server | |
| EP4054117A1 (en) | Computer-implemented system and method for propagation and communication of data in a network such as a blockchain network | |
| CN112468518B (en) | Access data processing method and device, storage medium and computer equipment | |
| CN112119620B (en) | System and method for propagating data packets in a network of nodes | |
| CN108306824B (en) | Message sending method and device | |
| CN112954406B (en) | Data downloading method and device, computer equipment and storage medium | |
| WO2019184262A1 (en) | Multi-type media data network address translation traversing method, terminal and system | |
| Mahmoodi Khaniabadi et al. | An intelligent sustainable efficient transmission internet protocol to switch between User Datagram Protocol and Transmission Control Protocol in IoT computing | |
| US20210227034A1 (en) | A method and system for transmitting streaming media resources | |
| Zhang et al. | Graph theory-based QoE-driven cooperation stimulation for content dissemination in device-to-device communication | |
| CN111431997B (en) | Cross-department data transmission method | |
| US11539919B1 (en) | Dynamic cloud video composition | |
| CN113259418A (en) | Method, apparatus and computer-readable storage medium for transmitting data | |
| Chang et al. | An efficient service discovery system for dual-stack cloud file service | |
| CN110912904B (en) | Malicious device identification method and device, storage medium and computer device | |
| CN105763617B (en) | A kind of load-balancing method and system | |
| Du et al. | Accelerating blockchain-enabled distributed machine learning by proof of useful work | |
| US20210021607A1 (en) | Systems and methods for random differential relay and network coding | |
| US20210297710A1 (en) | Uniform packet streaming | |
| CN115801298A (en) | Method, system, device and storage medium for file transmission | |
| US9455911B1 (en) | In-band centralized control with connection-oriented control protocols | |
| KR20160102231A (en) | Stateless message routing | |
| US11722412B1 (en) | Dynamically managing connection parameters among multiple computing devices | |
| US20150100622A1 (en) | Network Device Mediation | |
| CN117081983B (en) | Data transmission method and device |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20201030 Address after: No.68, 6th floor, building 17, No.30 yard, Shixing street, Shijingshan District, Beijing 100043 Applicant after: BEIJING READ TV INFINITE TECHNOLOGY Co.,Ltd. Address before: 233199 Team No. 35 of the Eastern Educational Ground of Jiaochang Village, Fengyang County, Chuzhou City, Anhui Province Applicant before: Liu Xinchang |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |