CN109951507B - Data transmission method, system, node and computer readable storage medium - Google Patents
Data transmission method, system, node and computer readable storage medium Download PDFInfo
- Publication number
- CN109951507B CN109951507B CN201711389217.6A CN201711389217A CN109951507B CN 109951507 B CN109951507 B CN 109951507B CN 201711389217 A CN201711389217 A CN 201711389217A CN 109951507 B CN109951507 B CN 109951507B
- Authority
- CN
- China
- Prior art keywords
- node
- file
- data
- reconciliation
- data transmission
- 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
Landscapes
- Computer And Data Communications (AREA)
Abstract
The present disclosure provides a data transmission method, system, node and computer readable storage medium, relating to the technical field of data transmission, the method comprises: a 1 st node on a data transmission path sends a 1 st data file and an account checking file to a 2 nd node, and the data transmission path is provided with N nodes; the ith node sends an ith data file and an ith reconciliation file to an (i + 1) th node, wherein i is more than or equal to 2 and less than or equal to N-1, and the ith reconciliation file comprises a reconciliation check file sent to a next node from the 1 st node to a front node in adjacent nodes in the (i + 1) th node and a reconciliation feedback file sent to the front node from the 1 st node to the rear node in the adjacent nodes in the i th node; and the Nth node determines the data transmission quality between the adjacent nodes according to the account checking file sent by the previous node to the next node and the account checking feedback file sent by the next node to the previous node in the adjacent nodes on the data transmission path.
Description
Technical Field
The present disclosure relates to the field of data transmission technologies, and in particular, to a data transmission method, system, node, and computer-readable storage medium.
Background
The network data has extremely high value in the aspects of network operation analysis, user behavior analysis, business marketing strategy and the like. However, since network data is scattered in various professional fields such as wireless, access, core, service, etc., to fully exert data efficiency, it is necessary to collect the data in a centralized manner to perform application analysis of cross-domain big data.
At present, data transmission of various types of network data involves multiple paragraphs such as data generation, data acquisition, data processing, and data storage.
Disclosure of Invention
The inventor finds that when the data file passes through a plurality of paragraphs, only the reconciliation file of the data file is interacted between adjacent nodes. For example, the data sending node sends the reconciliation check file to the data receiving node, and the data receiving node returns the reconciliation feedback file to the data sending node. Therefore, the adjacent nodes can acquire the information such as the sending and receiving time of the data file through the account checking file, and the data transmission quality between the adjacent nodes can be obtained.
However, the data sink node located downstream of the data transmission path cannot obtain the data transmission quality of the earlier upstream node, and cannot monitor the data transmission quality of the entire data transmission path.
Accordingly, the inventors propose the following.
According to an aspect of the embodiments of the present disclosure, there is provided a data transmission method, including: a 1 st node on a data transmission path sends a 1 st data file and a reconciliation check file to a 2 nd node, wherein the data transmission path is provided with N nodes; the ith node sends an ith data file and an ith reconciliation file to an (i + 1) th node, wherein i is more than or equal to 2 and less than or equal to N-1, and the ith reconciliation file comprises a reconciliation check file sent to a next node from the 1 st node to an adjacent node in the (i + 1) th node and a reconciliation feedback file sent to the previous node from the next node from the 1 st node to the adjacent node in the (i) th node; the Nth node determines the data transmission quality between the adjacent nodes according to the account checking file sent by the previous node to the next node and the account checking feedback file sent by the next node to the previous node in the adjacent nodes on the data transmission path; the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
In some embodiments, the data file transmission information comprises at least one of: the size and the total number of the data files sent by the previous node; the data file reception information includes at least one of: the size of the data file received by the latter node, the total number of receptions.
In some embodiments, the determining the quality of data transmission between neighboring nodes comprises: and the Nth node determines the data transmission integrity rate between adjacent nodes according to the size of the data file sent by the previous node, the identifier of the previous node, the size of the data file received by the next node and the identifier of the next node.
In some embodiments, the determining the quality of data transmission between neighboring nodes comprises: and the Nth node determines the data transmission integrity rate between adjacent nodes according to the total number of the data files sent by the previous node, the identification of the previous node, the total number of the data files received by the next node and the identification of the next node.
In some embodiments, the data file transmission information further includes a transmission start time of a data file transmitted by a previous node; the data file receiving information also comprises the receiving end time of the data file received by the next node; the determining the data transmission quality between the adjacent nodes comprises: the Nth node determines the transmission time of the data file according to the sending start time of the data file sent by the previous node and the receiving end time of the data file received by the next node; calculating the qualified number of the data files of which the transmission time is less than the preset time; and calculating the ratio of the qualified quantity to the total quantity of the sent data to obtain the data transmission timeliness rate between the adjacent nodes.
According to another aspect of the embodiments of the present disclosure, there is provided a data transmission system including N nodes on a data transmission path, the N nodes including: the 1 st node is used for sending the 1 st data file and the reconciliation check file to the 2 nd node; the ith node is used for sending an ith data file and an ith reconciliation file to the (i + 1) th node, wherein i is more than or equal to 2 and less than or equal to N-1, and the ith reconciliation file comprises a reconciliation check file sent to a next node from the 1 st node to an adjacent node in the (i + 1) th node and a reconciliation feedback file sent to the previous node from the next node from the 1 st node to the adjacent node in the (i) th node; the Nth node is used for determining the data transmission quality between the adjacent nodes according to the account checking file sent by the previous node to the next node and the account checking feedback file sent by the next node to the previous node in the adjacent nodes on the data transmission path; the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
In some embodiments, the data file transmission information comprises at least one of: the size and the total number of the data files sent by the previous node; the data file reception information includes at least one of: the size of the data file received by the latter node, the total number of receptions.
In some embodiments, the nth node is configured to determine a data transmission integrity rate between adjacent nodes according to a size of a data file sent by a previous node, an identifier of the previous node, a size of a data file received by a next node, and an identifier of the next node.
In some embodiments, the nth node is configured to determine a data transmission integrity rate between adjacent nodes according to the total number of data files transmitted by the previous node, the identifier of the previous node, the total number of data files received by the next node, and the identifier of the next node.
In some embodiments, the data file transmission information further includes a transmission start time of a data file transmitted by a previous node; the data file receiving information also comprises the receiving end time of the data file received by the next node; the Nth node is used for determining the transmission time of the data file according to the sending start time of the data file sent by the previous node and the receiving end time of the data file received by the next node; calculating the qualified number of the data files of which the transmission time is less than the preset time; and calculating the ratio of the qualified quantity to the total quantity of the sent data to obtain the data transmission timeliness rate between the adjacent nodes.
According to another aspect of the embodiments of the present disclosure, there is provided a data transmission method, including: an ith node on a data transmission path sends an ith data file and an ith reconciliation file to an (i + 1) th node, wherein the ith reconciliation file comprises a reconciliation check file sent to a next node from the 1 st node to a front node in adjacent nodes in the (i + 1) th node and a reconciliation feedback file sent to the front node from the 1 st node to the rear node in the adjacent nodes in the i th node; wherein, the data transmission path is provided with N nodes, i is more than or equal to 2 and less than or equal to N-1; the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
According to another aspect of the embodiments of the present disclosure, a data transmission node is provided, where the node is an ith node on a data transmission path, the data transmission path has N nodes, i is greater than or equal to 2 and is less than or equal to N-1, and the node includes: the data sending unit is used for sending an ith data file and an ith reconciliation file to an (i + 1) th node, wherein i is more than or equal to 2 and less than or equal to N-1, and the ith reconciliation file comprises a reconciliation check file sent to a next node from the 1 st node to an adjacent node in the (i + 1) th node and a reconciliation feedback file sent to the previous node from the next node from the 1 st node to the adjacent node in the (i) th node; the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
According to another aspect of the embodiments of the present disclosure, there is provided a data transmission node, including: a memory; and a processor coupled to the memory, the processor configured to perform the method of any of the above embodiments based on instructions stored in the memory.
According to a further aspect of the embodiments of the present disclosure, there is provided a computer-readable storage medium having stored thereon computer program instructions, which when executed by a processor, implement the method according to any one of the embodiments described above.
In the embodiment of the disclosure, while the previous node sends the data file to the next node, the previous reconciliation check file and the reconciliation feedback file interacted between the nodes are also relayed to be transmitted, so that the final node on the data transmission path, that is, the nth node, can obtain the reconciliation check file and the reconciliation feedback file interacted between any adjacent nodes, and further, the data transmission quality between any adjacent nodes can be determined according to the reconciliation check file and the reconciliation feedback file interacted between adjacent nodes.
The technical solution of the present disclosure is further described in detail by the accompanying drawings and examples.
Drawings
In order to more clearly illustrate the embodiments of the present disclosure 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 some embodiments of the present disclosure, and other drawings can be obtained by those skilled in the art without creative efforts.
Fig. 1 is a schematic flow diagram of a data transmission method according to one embodiment of the present disclosure;
FIG. 2 is a schematic block diagram of a data transmission system according to one embodiment of the present disclosure;
FIG. 3 is a schematic structural diagram of a data transmission node according to an embodiment of the present disclosure
Fig. 4 is a schematic structural diagram of a data transmission node according to another embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a data transmission node according to yet another embodiment of the present disclosure.
Detailed Description
The technical solutions in the embodiments of the present disclosure will be clearly and completely described below with reference to the drawings in the embodiments of the present disclosure, and it is obvious that the described embodiments are only a part of the embodiments of the present disclosure, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments disclosed herein without making any creative effort, shall fall within the protection scope of the present disclosure.
The relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
Fig. 1 is a flow diagram of a data transmission method according to one embodiment of the present disclosure.
In step 102, the 1 st node on the data transmission path sends the 1 st data file and the reconciliation check file to the 2 nd node. Here, there are a total of N nodes on the data transmission path. The 1 st node may be, for example, a data generation node, and thus the 1 st data file may be a data file generated by the 1 st node.
In step 104, the ith node sends an ith data file and an ith reconciliation file to the (i + 1) th node, wherein i is more than or equal to 2 and is less than or equal to N-1.
The ith reconciliation file comprises a reconciliation check file sent to a next node by a previous node from the 1 st node to adjacent nodes in the (i + 1) th node and a reconciliation feedback file sent to the previous node by the next node from the 1 st node to the adjacent nodes in the ith node.
It should be understood that the previous node among the neighboring nodes may also be referred to as a data transmitting node, and the subsequent node may also be referred to as a data receiving node. The data file sent by the previous node to the next node may be a data file forwarded by the previous node, or may be a data file obtained by processing the received data file by the previous node.
The intermediate nodes (node 2 to node N-1) may be, for example, data collection nodes, data processing nodes, and the like.
In step 106, the nth node determines the data transmission quality between the adjacent nodes according to the reconciliation check file sent by the previous node to the next node and the reconciliation feedback file sent by the next node to the previous node in the adjacent nodes on the data transmission path.
The reconciliation check file can comprise the identification of the previous node and the sending information of the data file, and the reconciliation feedback file can comprise the identification of the next node and the receiving information of the data file. The identity of the previous/subsequent node may be, for example, the device code of the node, or a combination of the host name and IP address of the node.
The data file transmission information may include, for example, at least one of the following: the name, size, total number of transmissions, transmission start time, etc. of the data file transmitted by the previous node. The data file reception information may include, for example, at least one of the following: the name, size, total number of receptions, reception end time, and the like of the data file received by the latter node.
The nth node can respectively extract the identifier of the previous node and the identifier of the next node from the interactive reconciliation check file and the reconciliation feedback file between any adjacent nodes, and then the data transmission quality between the two nodes is determined according to the data file sending information and the data file receiving information.
In the above embodiment, the previous node transmits the data file to the next node and simultaneously relays the reconciliation check file and the reconciliation feedback file interacted between the previous nodes, so that the terminal node on the data transmission path, that is, the nth node, can obtain the reconciliation check file and the reconciliation feedback file interacted between any adjacent nodes, and further, the data transmission quality between any adjacent nodes can be determined according to the reconciliation check file and the reconciliation feedback file interacted between adjacent nodes.
As an example, the reconciliation check file can include a file header and a plurality of reconciliation check records, i.e., data file transmission information.
Illustratively, the file header may be as shown in table 1 below.
TABLE 1
Illustratively, the reconciliation check record may be as shown in table 2 below.
TABLE 2
As an example, the reconciliation feedback file may include a file header and a plurality of reconciliation feedback records, i.e., data file receipt information.
Illustratively, the file header may be as shown in table 3 below.
TABLE 3
For example, the reconciliation feedback record may be as shown in table 4 below.
TABLE 4
The nth node may determine the data transmission quality between any adjacent nodes according to the contents of the data file transmission information and the data file reception information. Several different implementations are described below.
As a specific implementation manner, the data file sending information may include a size of the data file sent by the previous node, and the data file receiving information may include a size of the data file received by the subsequent node. In this implementation manner, the nth node may determine the data transmission integrity rate between adjacent nodes according to the size of the data file sent by the previous node, the identifier of the previous node, the size of the data file received by the subsequent node, and the identifier of the subsequent node. For example, the ratio of the size of the data file received by the next node to the size of the data file transmitted by the previous node may be used as the data transmission integrity rate between the two adjacent nodes.
As another specific implementation manner, the data file transmission information may include a total number of transmissions of the data file transmitted by the previous node, and the data file reception information may include a total number of receptions of the data file received by the subsequent node. In this implementation manner, the nth node may determine the data transmission integrity rate between adjacent nodes according to the total number of data files sent by the previous node, the identifier of the previous node, the total number of data files received by the subsequent node, and the identifier of the subsequent node. For example, the ratio of the total number of receptions of the data file received by the next node to the total number of transmissions of the data file transmitted by the previous node may be used as the data transmission integrity rate between the two neighboring nodes.
As still another specific implementation manner, the data file transmission information may include a total transmission amount and a transmission start time of the data file transmitted by the previous node; the data file reception information may include a reception end time of the data file received by the subsequent node. In this implementation, the nth node may determine the transmission time of each data file according to the transmission start time of the data file transmitted by the previous node and the reception end time of the data file received by the subsequent node; calculating the qualified number of the data files of which the transmission time is less than the preset time; and calculating the ratio of the qualified quantity to the total quantity of the sent data to obtain the data transmission timeliness rate between the adjacent nodes.
And under the condition that the data transmission quality between the adjacent nodes is determined to be abnormal, alarm intervention can be carried out. For example, in the case that the data transmission integrity rate between the adjacent nodes is lower than the preset integrity rate corresponding to the adjacent nodes, an alarm may be performed. For another example, the alarm may be given when the data transmission and timeliness rate between the adjacent nodes is lower than the preset timeliness rate corresponding to the adjacent nodes.
In the present specification, the embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts in the embodiments are referred to each other. For the system embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to the partial description of the method embodiment.
Fig. 2 is a schematic structural diagram of a data transmission system according to one embodiment of the present disclosure. As shown in fig. 2, the system of this embodiment includes N nodes on the data transmission path.
The 1 st node is used for sending the 1 st data file and the reconciliation check file to the 2 nd node.
The ith node is used for sending an ith data file and an ith reconciliation file to the (i + 1) th node, i is more than or equal to 2 and less than or equal to N-1, and the ith reconciliation file comprises a reconciliation check file sent to a next node from the 1 st node to an adjacent node in the (i + 1) th node and a reconciliation feedback file sent to the previous node from the next node from the 1 st node to the adjacent node in the (i) th node.
The Nth node is used for determining the data transmission quality between the adjacent nodes according to the account checking file sent by the previous node to the next node and the account checking feedback file sent by the next node to the previous node in the adjacent nodes on the data transmission path.
The reconciliation check file may include an identifier of a previous node and data file sending information, and the reconciliation feedback file may include an identifier of a subsequent node and data file receiving information. The data file transmission information may include at least one of: the size and the total number of the data files sent by the previous node; the data file reception information may include at least one of: the size of the data file received by the latter node, the total number of receptions.
In the above embodiment, the previous node transmits the data file to the next node and simultaneously relays the reconciliation check file and the reconciliation feedback file interacted between the previous nodes, so that the terminal node on the data transmission path, that is, the nth node, can obtain the reconciliation check file and the reconciliation feedback file interacted between any adjacent nodes, and further, the data transmission quality between any adjacent nodes can be determined according to the reconciliation check file and the reconciliation feedback file interacted between adjacent nodes.
As a specific implementation manner, the data file sending information may include a size of the data file sent by the previous node, and the data file receiving information may include a size of the data file received by the subsequent node. In this implementation manner, the nth node may be configured to determine the data transmission integrity rate between adjacent nodes according to the size of the data file sent by the previous node, the identifier of the previous node, the size of the data file received by the subsequent node, and the identifier of the subsequent node.
As another specific implementation manner, the data file transmission information may include a total number of transmissions of the data file transmitted by the previous node, and the data file reception information may include a total number of receptions of the data file received by the subsequent node. In this implementation manner, the nth node may be configured to determine a data transmission integrity rate between adjacent nodes according to the total number of data files sent by the previous node, the identifier of the previous node, the total number of data files received by the subsequent node, and the identifier of the subsequent node.
As still another specific implementation manner, the data file transmission information may include a total transmission amount and a transmission start time of the data file transmitted by the previous node; the data file reception information may include a reception end time of the data file received by the subsequent node. In this implementation, the nth node may be configured to determine a transmission time of each data file according to a transmission start time of a data file transmitted by a previous node and a reception end time of a data file received by a subsequent node; calculating the qualified number of the data files of which the transmission time is less than the preset time; and calculating the ratio of the qualified quantity to the total quantity of the sent data to obtain the data transmission timeliness rate between the adjacent nodes.
The present disclosure also provides another data transmission method. In the method, an ith node on a data transmission path sends an ith data file and an ith reconciliation file to an (i + 1) th node, wherein the ith reconciliation file comprises a reconciliation check file sent from the 1 st node to a previous node in adjacent nodes in the (i + 1) th node and a reconciliation feedback file sent from the 1 st node to the previous node in the adjacent nodes in the ith node. Here, the data transmission path has N nodes, 2 ≦ i ≦ N-1. The reconciliation check file comprises the identification of the previous node and the data file sending information, and the reconciliation feedback file comprises the identification of the next node and the data file receiving information.
Fig. 3 is a schematic structural diagram of a data transmission node according to one embodiment of the present disclosure. The node of the embodiment is used as the ith node on the data transmission path, the data transmission path is provided with N nodes, and i is more than or equal to 2 and less than or equal to N-1. As shown in fig. 3, the node of this embodiment includes:
the data sending unit 301 is configured to send an ith data file and an ith reconciliation file to an (i + 1) th node, where i is greater than or equal to 2 and less than or equal to N-1, and the ith reconciliation file includes a reconciliation check file sent by a previous node to a next node in adjacent nodes from the (1) th node to the (i + 1) th node and a reconciliation feedback file sent by a next node to the previous node in adjacent nodes from the (1) th node to the i-th node; the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
Of course, it should be understood that the node may further include a data receiving unit 302, configured to receive the i-1 th data and the i-1 st reconciliation file sent by the i-1 st node, where the i-1 st reconciliation file includes a reconciliation check file sent by a previous node from the 1 st node to an adjacent node in the i-1 st node to a subsequent node from the adjacent node from the 1 st node to the i-1 st node, and a reconciliation feedback file sent by a subsequent node from the adjacent node from the 1 st node to the i-1 st node to the previous node.
It should be noted that, for the case where i is 2, that is, for the 2 nd node, the i-1 st reconciliation file only includes the reconciliation check file sent by the 1 st node to the 2 nd node.
Fig. 4 is a schematic structural diagram of a data transmission system according to another embodiment of the present disclosure. As shown in fig. 4, the system of this embodiment includes a memory 401 and a processor 402. The memory 401 may be a magnetic disk, flash memory, or any other non-volatile storage medium. The memory 401 is used for storing instructions corresponding to the method of any one of the foregoing embodiments. Coupled to memory 401, processor 402 may be implemented as one or more integrated circuits, such as a microprocessor or microcontroller. The processor 402 is used to execute instructions stored in the memory 401.
Fig. 5 is a schematic structural diagram of a data transmission system according to yet another embodiment of the present disclosure. As shown in fig. 5, the system 500 of this embodiment includes a memory 501 and a processor 502. The processor 502 is coupled to the memory 501 by a BUS (BUS) 503. The system 500 may also be connected to an external storage device 505 through a storage interface 504 to call external data, and may also be connected to a network or an external computer system (not shown) through a network interface 506.
The present disclosure also provides a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the steps of the method of any of the preceding embodiments.
The solution provided by the present disclosure may have one or more of the following benefits:
on one hand, the reconciliation files are transmitted in a relay mode, so that the node transformation amount is small, and the cost is low.
On the other hand, a side-hung monitoring module is not required to be arranged for each node, and the side-hung monitoring module collects monitoring information and transmits the monitoring information to the data sink node in a unified mode to perform analysis processing. According to the scheme, the data quality monitoring of the end-to-end full path can be realized only by analyzing the reconciliation file transmitted by the indirect force of the adjacent nodes by the data aggregation node, and the system architecture is further simplified.
On the other hand, the scheme disclosed by the invention can be suitable for an end-to-end data convergence scene, and has the advantages of low system transformation cost and good cost-benefit ratio.
As will be appreciated by one skilled in the art, embodiments of the present disclosure may be provided as a method, apparatus, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Thus far, the present disclosure has been described in detail. Some details that are well known in the art have not been described in order to avoid obscuring the concepts of the present disclosure. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.
Although some specific embodiments of the present disclosure have been described in detail by way of example, it should be understood by those skilled in the art that the foregoing examples are for purposes of illustration only and are not intended to limit the scope of the present disclosure. It will be appreciated by those skilled in the art that modifications may be made to the above embodiments without departing from the scope and spirit of the present disclosure. The scope of the present disclosure is defined by the appended claims.
Claims (14)
1. A method of data transmission, comprising:
a 1 st node on a data transmission path sends a 1 st data file and a reconciliation check file to a 2 nd node, wherein the data transmission path is provided with N nodes;
the ith node sends an ith data file and an ith reconciliation file to an (i + 1) th node, wherein i is more than or equal to 2 and less than or equal to N-1, and the ith reconciliation file comprises a reconciliation check file sent by a previous node to a next node from the 1 st node to any adjacent node in the (i + 1) th node and a reconciliation feedback file sent by a next node to the previous node from the 1 st node to any adjacent node in the (i) th node;
the Nth node determines the data transmission quality between any adjacent nodes according to the account checking file sent by the previous node to the next node and the account checking feedback file sent by the next node to the previous node in any adjacent nodes on the data transmission path;
the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
2. The method of claim 1, wherein,
the data file transmission information includes at least one of: the size and the total number of the data files sent by the previous node;
the data file reception information includes at least one of: the size of the data file received by the latter node, the total number of receptions.
3. The method of claim 2, wherein the determining the quality of data transmission between any neighboring nodes comprises:
and the Nth node determines the data transmission integrity rate between any adjacent nodes according to the size of the data file sent by the previous node, the identifier of the previous node, the size of the data file received by the next node and the identifier of the next node.
4. The method of claim 2, wherein the determining the quality of data transmission between any neighboring nodes comprises:
and the Nth node determines the data transmission integrity rate between any adjacent nodes according to the total number of the data files sent by the previous node, the identification of the previous node, the total number of the data files received by the next node and the identification of the next node.
5. The method of claim 2, wherein the data file transmission information further includes a transmission start time of a data file transmitted by a previous node; the data file receiving information also comprises the receiving end time of the data file received by the next node;
the determining the data transmission quality between any adjacent nodes comprises:
the Nth node determines the transmission time of the data file according to the sending start time of the data file sent by the previous node and the receiving end time of the data file received by the next node;
calculating the qualified number of the data files of which the transmission time is less than the preset time;
and calculating the ratio of the qualified quantity to the total quantity of the sent data so as to obtain the data transmission timeliness rate between any adjacent nodes.
6. A data transmission system comprising N nodes on a data transmission path, the N nodes comprising:
the 1 st node is used for sending the 1 st data file and the reconciliation check file to the 2 nd node;
the ith node is used for sending an ith data file and an ith reconciliation file to the (i + 1) th node, wherein i is more than or equal to 2 and less than or equal to N-1, and the ith reconciliation file comprises a reconciliation check file sent by a previous node to a next node in any adjacent nodes from the (1) th node to the (i + 1) th node and a reconciliation feedback file sent by a next node to the previous node in any adjacent nodes from the (1) th node to the i +1 th node;
the Nth node is used for determining the data transmission quality between any adjacent nodes according to the account checking file sent by the previous node to the next node and the account checking feedback file sent by the next node to the previous node in any adjacent nodes on the data transmission path;
the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
7. The system of claim 6, wherein,
the data file transmission information includes at least one of: the size and the total number of the data files sent by the previous node;
the data file reception information includes at least one of: the size of the data file received by the latter node, the total number of receptions.
8. The system of claim 7, wherein,
and the Nth node is used for determining the data transmission integrity rate between any adjacent nodes according to the size of the data file sent by the previous node, the identifier of the previous node, the size of the data file received by the next node and the identifier of the next node.
9. The system of claim 7, wherein,
and the Nth node is used for determining the data transmission integrity rate between any adjacent nodes according to the total number of the data files sent by the previous node, the identification of the previous node, the total number of the data files received by the next node and the identification of the next node.
10. The system of claim 7, wherein the data file transmission information further includes a transmission start time of a data file transmitted by a previous node; the data file receiving information also comprises the receiving end time of the data file received by the next node;
the Nth node is used for determining the transmission time of the data file according to the sending start time of the data file sent by the previous node and the receiving end time of the data file received by the next node; calculating the qualified number of the data files of which the transmission time is less than the preset time; and calculating the ratio of the qualified quantity to the total quantity of the sent data so as to obtain the data transmission timeliness rate between any adjacent nodes.
11. A method of data transmission, comprising:
an ith node on a data transmission path sends an ith data file and an ith reconciliation file to an (i + 1) th node, wherein the ith reconciliation file comprises a reconciliation check file sent to a next node from the 1 st node to any adjacent node in the (i + 1) th node and a reconciliation feedback file sent to the previous node from the 1 st node to any adjacent node in the i th node, so that the Nth node determines the data transmission quality between any adjacent nodes according to the reconciliation check file sent to the next node from the previous node to any adjacent node on the data transmission path and the reconciliation feedback file sent to the previous node from the next node;
wherein, the data transmission path is provided with N nodes, i is more than or equal to 2 and less than or equal to N-1;
the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
12. A data transmission node, the node is the ith node on a data transmission path, the data transmission path has N nodes, i is more than or equal to 2 and less than or equal to N-1, the node includes:
the data transmission unit is used for transmitting an ith data file and an ith reconciliation file to an (i + 1) th node, wherein i is more than or equal to 2 and less than or equal to N-1, the ith reconciliation file comprises a reconciliation check file transmitted to a next node by a front node from the (1) th node to any adjacent node in the (i + 1) th node and a reconciliation feedback file transmitted to the front node by a back node from the (1) th node to any adjacent node in the (i) th node, so that the data transmission quality between any adjacent nodes is determined by the Nth node according to the reconciliation check file transmitted to the next node by the front node and the reconciliation feedback file transmitted to the front node by the back node in any adjacent node on the data transmission path;
the reconciliation check file comprises an identifier of a previous node and data file sending information, and the reconciliation feedback file comprises an identifier of a next node and data file receiving information.
13. A data transmission node comprising:
a memory; and
a processor coupled to the memory, the processor configured to perform the method of claim 11 based on instructions stored in the memory.
14. A computer-readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the method of claim 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711389217.6A CN109951507B (en) | 2017-12-21 | 2017-12-21 | Data transmission method, system, node and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711389217.6A CN109951507B (en) | 2017-12-21 | 2017-12-21 | Data transmission method, system, node and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109951507A CN109951507A (en) | 2019-06-28 |
| CN109951507B true CN109951507B (en) | 2021-12-14 |
Family
ID=67005403
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711389217.6A Active CN109951507B (en) | 2017-12-21 | 2017-12-21 | Data transmission method, system, node and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109951507B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1658611A (en) * | 2005-03-22 | 2005-08-24 | 中国科学院计算技术研究所 | Method for guarantee service quality of radio local network |
| CN101072086A (en) * | 2006-05-10 | 2007-11-14 | 明基电通股份有限公司 | Transmission quality detecting method |
| CN101616037A (en) * | 2009-07-27 | 2009-12-30 | 华为技术有限公司 | The detection method of packet loss, Apparatus and system in the network service |
| CN105591835A (en) * | 2015-08-12 | 2016-05-18 | 杭州华三通信技术有限公司 | Link quality detection method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8433783B2 (en) * | 2010-09-29 | 2013-04-30 | Citrix Systems, Inc. | Systems and methods for providing quality of service via a flow controlled tunnel |
-
2017
- 2017-12-21 CN CN201711389217.6A patent/CN109951507B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1658611A (en) * | 2005-03-22 | 2005-08-24 | 中国科学院计算技术研究所 | Method for guarantee service quality of radio local network |
| CN101072086A (en) * | 2006-05-10 | 2007-11-14 | 明基电通股份有限公司 | Transmission quality detecting method |
| CN101616037A (en) * | 2009-07-27 | 2009-12-30 | 华为技术有限公司 | The detection method of packet loss, Apparatus and system in the network service |
| CN105591835A (en) * | 2015-08-12 | 2016-05-18 | 杭州华三通信技术有限公司 | Link quality detection method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109951507A (en) | 2019-06-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106549878B (en) | Service distribution method and device | |
| CN106302104B (en) | User relationship identification method and device | |
| CN109450936A (en) | A kind of adaptation method and device of the hetero-com-munication agreement based on Kafka | |
| CN111131379A (en) | Distributed flow acquisition system and edge calculation method | |
| CN109213758B (en) | Data access method, device, equipment and computer readable storage medium | |
| CN109218058B (en) | Method and system for acquiring OAM information and computer readable storage medium | |
| CN111651510A (en) | Data processing method and device, electronic equipment and computer readable storage medium | |
| CN111147403B (en) | Message processing method and device, storage medium and electronic device | |
| CN108306824B (en) | Message sending method and device | |
| CN104424240B (en) | Multilist correlating method, main service node, calculate node and system | |
| CN108718258B (en) | Quality detection method and equipment for inter-board link | |
| CN108733698A (en) | A kind of processing method and background service system of log information | |
| CN107562555A (en) | The cleaning method and server of duplicate data | |
| CN107018088B (en) | Transmission link selection method and device | |
| CN106131134A (en) | A kind of message content merges De-weight method and system | |
| CN109951507B (en) | Data transmission method, system, node and computer readable storage medium | |
| CN107343037B (en) | Data transmission method and device of distributed storage system | |
| CN106888238A (en) | A kind of method of data synchronization and device | |
| CN109831335B (en) | Data monitoring method, monitoring terminal, storage medium and data monitoring system | |
| EP2690560A2 (en) | Method of benchmarking the behaviour of a replacement information system with the old system | |
| CN109462510B (en) | CDN node quality evaluation method and device | |
| CN116578911A (en) | Data processing method, device, electronic equipment and computer storage medium | |
| CN106304122B (en) | Business data analysis method and system | |
| CN105721398A (en) | Data access method and device | |
| CN111131512B (en) | Equipment information processing method and 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 |