CN109951507A - Data transmission method, system, node and computer readable storage medium - Google Patents

Data transmission method, system, node and computer readable storage medium Download PDF

Info

Publication number
CN109951507A
CN109951507A CN201711389217.6A CN201711389217A CN109951507A CN 109951507 A CN109951507 A CN 109951507A CN 201711389217 A CN201711389217 A CN 201711389217A CN 109951507 A CN109951507 A CN 109951507A
Authority
CN
China
Prior art keywords
node
data file
file
data
reconciliation
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
Application number
CN201711389217.6A
Other languages
Chinese (zh)
Other versions
CN109951507B (en
Inventor
梁朝霞
钱爽
杨迪
孙隆
周峰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN201711389217.6A priority Critical patent/CN109951507B/en
Publication of CN109951507A publication Critical patent/CN109951507A/en
Application granted granted Critical
Publication of CN109951507B publication Critical patent/CN109951507B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Computer And Data Communications (AREA)

Abstract

Present disclose provides a kind of data transmission method, system, node and computer readable storage mediums, it is related to technical field of data transmission, the described method includes: the first node on data transfer path sends the 1st data file and reconciliation audit files to second node, there is N number of node on data transfer path;I-th node sends the i-th data file and i-th pair account file to i+1 node, 2≤i≤N-1, i-th pair account file include the latter node of the reconciliation audit files that previous node of the first node into i+1 node in adjacent node is sent to latter node and first node into the i-th node in the adjacent node reconciliation feedback file that a node is sent forward;Nth node determines the data transmission quality between adjacent node according to the reconciliation audit files and latter node that previous node is sent to latter node in adjacent node on data transfer path the reconciliation feedback file that a node is sent forward.

Description

Data transmission method, system, node and computer readable storage medium
Technical field
This disclosure relates to technical field of data transmission, especially a kind of data transmission method, system, node and computer can Read storage medium.
Background technique
Network data has high value to network operation analysis, user behavior analysis, business marketing strategy etc.. But since network data is dispersed in each professional domains such as wireless, access, core, business, data efficiency is given full play to, it needs After converging in these data sets, the applied analysis of cross-domain big data could be carried out.
Currently, the data transmission of disparate networks data is related to data generation, data acquisition, data mart modeling, data storage etc. Multiple paragraphs.
Summary of the invention
Inventors have found that only the reconciliation of interactive data files is literary between adjacent node when data file passes through multiple paragraphs Part.For example, data transmitting node sends reconciliation audit files to data reception node, data reception node is to data transmitting node Return to reconciliation feedback file.Therefore, adjacent node can know transmission and receiving time of data file etc. by reconciliation file Information, so as to obtain the data transmission quality between adjacent node.
But the data gathering node in data transfer path downstream can not obtain the data of upstream node earlier Transmission quality can not be monitored the data transmission quality of entire data transfer path.
Accordingly, following technical solution is inventors herein proposed.
According to the one side of the embodiment of the present disclosure, a kind of data transmission method is provided, comprising: on data transfer path 1 node sends the 1st data file and reconciliation audit files to second node, has N number of node on the data transfer path;I-th Node sends the i-th data file and i-th pair account file, 2≤i≤N-1 to i+1 node, and the i-th pair account file includes the 1st The reconciliation audit files and first node that previous node of the node into i+1 node in adjacent node is sent to latter node The latter node reconciliation feedback file that a node is sent forward into the i-th node in adjacent node;Nth node is according to the number The reconciliation audit files sent according to previous node in adjacent node in transmission path to latter node and latter node forward one The reconciliation feedback file that node is sent, determines the data transmission quality between adjacent node;Wherein, the reconciliation audit files packet The mark and data file for including previous node send information, and the reconciliation feedback file includes the mark and data text of latter node Part receives information.
In some embodiments, it includes at least one in following that the data file, which sends information: previous node is sent Data file size, send total quantity;It includes at least one in following: latter node that the data file, which receives information, Size, the total number of receipts amount of received data file.
In some embodiments, the data transmission quality between the determining adjacent node includes: nth node according to previous The size of data file that node is sent, the mark of previous node, the size of the received data file of latter node and latter The mark of node determines the data transmission percentage of head rice between adjacent node.
In some embodiments, the data transmission quality between the determining adjacent node includes: nth node according to previous The transmission total quantity for the data file that node is sent, the mark of previous node, the reception of the received data file of latter node are total The mark of quantity and latter node determines the data transmission percentage of head rice between adjacent node.
In some embodiments, the data file sends the transmission that information further includes the data file that previous node is sent Time started;The data file receives the reception end time that information further includes the received data file of latter node;It is described Determine that the data transmission quality between adjacent node includes: that the transmission for the data file that nth node is sent according to previous node is opened The reception end time of beginning time and the received data file of latter node, determine the transmission time of data file;Calculate data The transmission time of file is less than the qualified quantity of the data file of preset time;It calculates qualified quantity and sends the ratio of total quantity Value, to obtain the transmission promptness rate of the data between adjacent node.
According to the another aspect of the embodiment of the present disclosure, a kind of data transmission system is provided, including the N on data transfer path A node, N number of node includes: first node, for sending the 1st data file and reconciliation audit files to second node;I-th Node, for sending the i-th data file and i-th pair account file, 2≤i≤N-1, the i-th pair account file packet to i+1 node Include reconciliation audit files, the Yi Ji that previous node of the first node into i+1 node in adjacent node is sent to latter node Latter node of 1 node into the i-th node in the adjacent node reconciliation feedback file that a node is sent forward;Nth node is used for According to previous node is sent to latter node in adjacent node on the data transfer path reconciliation audit files and latter The reconciliation feedback file that node is sent to previous node, determines the data transmission quality between adjacent node;Wherein, the reconciliation Audit files include that the mark of previous node and data file send information, and the reconciliation feedback file includes the mark of latter node Know and data file reception information.
In some embodiments, it includes at least one in following that the data file, which sends information: previous node is sent Data file size, send total quantity;It includes at least one in following: latter node that the data file, which receives information, Size, the total number of receipts amount of received data file.
In some embodiments, the size for the data file that the nth node is used to be sent according to previous node, previous section Mark, the size of the received data file of latter node and the mark of latter node of point, determine the number between adjacent node According to transmission percentage of head rice.
The transmission total quantity for the data file that in some embodiments, the nth node is used to be sent according to previous node, The mark of the mark of previous node, the total number of receipts amount of the received data file of latter node and latter node, determines adjacent Data between node transmit percentage of head rice.
In some embodiments, the data file sends the transmission that information further includes the data file that previous node is sent Time started;The data file receives the reception end time that information further includes the received data file of latter node;It is described Transmission time started of the data file that nth node is used to be sent according to previous node and the received data file of latter node The end time is received, determines the transmission time of data file;The transmission time for calculating data file is less than the data of preset time The qualified quantity of file;Calculate qualified quantity and send the ratio of total quantity, with obtain the transmission of the data between adjacent node and When rate.
According to the another aspect of the embodiment of the present disclosure, a kind of data transmission method is provided, comprising: on data transfer path I-th node sends the i-th data file and i-th pair account file to i+1 node, and the i-th pair account file includes first node to the The reconciliation audit files and first node that previous node in i+1 node in adjacent node is sent to latter node are to the i-th section The latter node reconciliation feedback file that a node is sent forward in point in adjacent node;Wherein, on the data transfer path With N number of node, 2≤i≤N-1;Wherein, the reconciliation audit files include that the mark of previous node and data file send letter Breath, the reconciliation feedback file includes the mark and data file reception information of latter node.
According to the embodiment of the present disclosure in another aspect, providing a kind of data transmission nodal, the node is transmitted as data The i-th node on path, has N number of node, 2≤i≤N-1 on the data transfer path, and the node includes: that data are sent Unit, for sending the i-th data file and i-th pair account file, 2≤i≤N-1, the i-th pair account file packet to i+1 node Include reconciliation audit files, the Yi Ji that previous node of the first node into i+1 node in adjacent node is sent to latter node Latter node of 1 node into the i-th node in the adjacent node reconciliation feedback file that a node is sent forward;Wherein, described right Account audit files include that the mark of previous node and data file send information, and the reconciliation feedback file includes latter node Mark and data file reception information.
According to the embodiment of the present disclosure in another aspect, providing a kind of data transmission nodal, comprising: memory;And coupling To the processor of the memory, the processor is configured to above-mentioned any based on the instruction execution for being stored in the memory Method described in one embodiment.
According to the also one side of the embodiment of the present disclosure, a kind of computer readable storage medium is provided, calculating is stored thereon with Method described in any one above-mentioned embodiment is realized in machine program instruction, the instruction when being executed by processor.
In the embodiment of the present disclosure, previous node is while sending data file to latter node, also before refile Node between interaction reconciliation audit files and reconciliation feedback file so that the terminal note on data transfer path, i.e. N The reconciliation audit files and reconciliation feedback file of interaction between the available arbitrary neighborhood node of node, and then can be according to adjacent segments The reconciliation audit files and reconciliation feedback file of interaction determine the data transmission quality between arbitrary neighborhood node between point.
Below by drawings and examples, the technical solution of the disclosure is described in further detail.
Detailed description of the invention
In order to illustrate more clearly of the embodiment of the present disclosure or technical solution in the prior art, to embodiment or will show below There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this Disclosed some embodiments for those of ordinary skill in the art without creative efforts, can be with It obtains other drawings based on these drawings.
Fig. 1 is the flow diagram according to the data transmission method of an embodiment of the present disclosure;
Fig. 2 is the structural schematic diagram according to the data transmission system of an embodiment of the present disclosure;
Fig. 3 is the structural schematic diagram according to the data transmission nodal of an embodiment of the present disclosure
Fig. 4 is the structural schematic diagram according to the data transmission nodal of the disclosure another embodiment;
Fig. 5 is the structural schematic diagram according to the data transmission nodal of the disclosure another embodiment.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present disclosure, the technical solution in the embodiment of the present disclosure is carried out clear, complete Site preparation description, it is clear that described embodiment is only disclosure a part of the embodiment, instead of all the embodiments.It is based on Embodiment in the disclosure, those of ordinary skill in the art without creative labor it is obtained it is all its His embodiment belongs to the range of disclosure protection.
Unless specifically stated otherwise, positioned opposite, the digital table of the component and step that otherwise illustrate in these embodiments Up to the unlimited the scope of the present disclosure processed of formula and numerical value.
Simultaneously, it should be appreciated that for ease of description, the size of various pieces shown in attached drawing is not according to reality Proportionate relationship draw.
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable In the case of, the technology, method and apparatus should be considered as authorizing part of specification.
It is shown here and discuss all examples in, any occurrence should be construed as merely illustratively, without It is as limitation.Therefore, the other examples of exemplary embodiment can have different values.
It should also be noted that similar label and letter indicate similar terms in following attached drawing, therefore, once a certain Xiang Yi It is defined in a attached drawing, then in subsequent attached drawing does not need that it is further discussed.
Fig. 1 is the flow diagram according to the data transmission method of an embodiment of the present disclosure.
First node in step 102, data transfer path sends the 1st data file to second node and text is verified in reconciliation Part.Here, there is altogether N number of node on data transfer path.First node for example can be data and generate node, therefore the 1st data File can be the data file of first node generation.
In step 104, the i-th node sends the i-th data file and i-th pair account file, 2≤i≤N-1 to i+1 node.
I-th pair account file includes that previous node of the first node into i+1 node in adjacent node is sent to latter node The reconciliation that a node is sent forward of latter node into the i-th node in adjacent node of reconciliation audit files and first node Feedback file.
It should be appreciated that the previous node in adjacent node is referred to as data transmitting node, latter node is referred to as Data reception node.Previous node can be the data file that previous node forwards to the data file that latter node is sent, Previous node be can be to the data file that the receives data file that carries out that treated.
Intermediate node (second node to N-1 node) is such as can be data acquisition node, data mart modeling node.
In step 106, nth node is according to previous node is sent to latter node in adjacent node on data transfer path Reconciliation audit files and the latter node reconciliation feedback file that a node is sent forward, determine the data between adjacent node Transmission quality.
Reconciliation audit files may include that the mark of previous node and data file send information, and reconciliation feedback file can be with Mark and data file reception information including latter node.The mark of previous/latter node for example can be setting for the node Standby coding, alternatively, being the combination of the host name and IP address of the node.
It for example may include at least one in following that data file, which sends information: the data file that previous node is sent Title, size, transmission total quantity, transmission time started etc..Data file receive information for example may include in following at least One: title, size, total number of receipts amount, reception end time of the latter received data file of node etc..
Nth node can extract respectively from reconciliation audit files interactive between arbitrary neighborhood node and reconciliation feedback file The mark of previous node and the mark of latter node, and then determined according to data file transmission information and data file reception information Data transmission quality between the two nodes.
In above-described embodiment, previous node is while sending data file to latter node, also before refile The reconciliation audit files and reconciliation feedback file of interaction between node, so that the terminal note on data transfer path, i.e. N save The reconciliation audit files and reconciliation feedback file of interaction between the available arbitrary neighborhood node of point, and then can be according to adjacent node Between interaction reconciliation audit files and reconciliation feedback file determine the data transmission quality between arbitrary neighborhood node.
As an example, reconciliation audit files may include file header and a plurality of reconciliation checks of the records, i.e. data file Send information.
Illustratively, file header can be as shown in table 1 below.
Table 1
Illustratively, reconciliation checks of the records can be as shown in table 2 below.
Table 2
As an example, reconciliation feedback file may include file header and a plurality of reconciliation feedback record, i.e. data file Receive information.
Illustratively, file header can be as shown in table 3 below.
Table 3
Illustratively, reconciliation feedback record can be as shown in table 4 below.
Table 4
Nth node can determine arbitrary neighborhood section according to the content that data file sends information and data file reception information Data transmission quality between point.Several different implementations introduced below.
As a specific implementation, it may include the data file that previous node is sent that data file, which sends information, Size, data file receive the size that information may include the received data file of latter node.In the implementation, N section Size, the mark of previous node, the received data file of latter node for the data file that point can be sent according to previous node Size and latter node mark, determine between adjacent node data transmission percentage of head rice.For example, can be with later section The ratio of the size for the data file that the size and previous node of the received data file of point are sent is as the two adjacent nodes Between data transmit percentage of head rice.
As another specific implementation, it may include the data file that previous node is sent that data file, which sends information, Transmission total quantity, data file receive information may include the received data file of latter node total number of receipts amount.The reality In existing mode, nth node can according to the transmission total quantity for the data file that previous node is sent, the mark of previous node, after The total quantity of the received data file of one node and the mark of latter node, determine that the data between adjacent node transfer Whole rate.For example, can be with the data file that the total number of receipts amount of the received data file of latter node and previous node are sent The ratio for sending total quantity transmits percentage of head rice as the data between the two adjacent nodes.
As another specific implementation, it may include the data file that previous node is sent that data file, which sends information, Transmission total quantity and send the time started;It may include connecing for the received data file of latter node that data file, which receives information, Receive the end time.In the implementation, nth node can according to previous node send data file the transmission time started and The reception end time of the latter received data file of node, determine the transmission time of each data file;Calculate data file Transmission time be less than preset time data file qualified quantity;It calculates qualified quantity and sends the ratio of total quantity, with Obtain the data transmission promptness rate between adjacent node.
In the case where determining the data transmission quality exception between adjacent node, alarm intervention can also be carried out.For example, In the case that data transmission percentage of head rice between adjacent node is lower than adjacent node corresponding default percentage of head rice, it can be accused It is alert.In another example in the case that the data transmission promptness rate between adjacent node is lower than the corresponding default promptness rate of adjacent node, it can To be alerted.
Each embodiment in this specification is described in a progressive manner, the highlights of each of the examples are with its The difference of its embodiment, the same or similar part cross-reference between each embodiment.For system embodiment For, since it is substantially corresponding with embodiment of the method, so being described relatively simple, referring to the portion of embodiment of the method in place of correlation It defends oneself bright.
Fig. 2 is the structural schematic diagram according to the data transmission system of an embodiment of the present disclosure.As shown in Fig. 2, the implementation The system of example includes N number of node on data transfer path.
First node is used to send the 1st data file and reconciliation audit files to second node.
I-th node is used to send the i-th data file and i-th pair account file, 2≤i≤N-1, i-th pair account to i+1 node File include previous node of the first node into i+1 node in adjacent node sent to latter node reconciliation audit files, And latter node of the first node into the i-th node in the adjacent node reconciliation feedback file that a node is sent forward.
Nth node is used for according to the reconciliation core that previous node is sent to latter node in adjacent node on data transfer path File and latter node the reconciliation feedback file that a node is sent forward are looked into, determines the data transmission matter between adjacent node Amount.
Above-mentioned reconciliation audit files may include that the mark of previous node and data file send information, reconciliation feedback file It may include the mark and data file reception information of latter node.Data file send information may include in following at least One: the size for the data file that previous node is sent sends total quantity;It may include in following that data file, which receives information, At least one of: size, the total number of receipts amount of the latter received data file of node.
In above-described embodiment, previous node is while sending data file to latter node, also before refile The reconciliation audit files and reconciliation feedback file of interaction between node, so that the terminal note on data transfer path, i.e. N save The reconciliation audit files and reconciliation feedback file of interaction between the available arbitrary neighborhood node of point, and then can be according to adjacent node Between interaction reconciliation audit files and reconciliation feedback file determine the data transmission quality between arbitrary neighborhood node.
As a specific implementation, it may include the data file that previous node is sent that data file, which sends information, Size, data file receive the size that information may include the received data file of latter node.In the implementation, N section Size, the mark of previous node, the received data of latter node for the data file that point can be used for being sent according to previous node The mark of the size of file and latter node determines the data transmission percentage of head rice between adjacent node.
As another specific implementation, it may include the data file that previous node is sent that data file, which sends information, Transmission total quantity, data file receive information may include the received data file of latter node total number of receipts amount.The reality In existing mode, nth node can be used for the mark of the transmission total quantity of the data file according to previous node transmission, previous node The mark of knowledge, the total quantity of the received data file of latter node and latter node determines that the data between adjacent node pass Defeated percentage of head rice.
As another specific implementation, it may include the data file that previous node is sent that data file, which sends information, Transmission total quantity and send the time started;It may include connecing for the received data file of latter node that data file, which receives information, Receive the end time.In the implementation, when the transmission for the data file that nth node can be used for being sent according to previous node starts Between and the received data file of latter node the reception end time, determine the transmission time of each data file;Calculate data The transmission time of file is less than the qualified quantity of the data file of preset time;It calculates qualified quantity and sends the ratio of total quantity Value, to obtain the transmission promptness rate of the data between adjacent node.
The disclosure additionally provides another data transmission method.In this method, the i-th node on data transfer path is to I+1 node sends the i-th data file and i-th pair account file, i-th pair account file include first node adjacent segments into i+1 node The reconciliation audit files and first node that previous node in point is sent to latter node are into the i-th node in adjacent node The latter node reconciliation feedback file that a node is sent forward.Here, there is N number of node, 2≤i≤N- on data transfer path 1.Reconciliation audit files include that the mark of previous node and data file send information, and reconciliation feedback file includes latter node Mark and data file reception information.
Fig. 3 is the structural schematic diagram according to the data transmission nodal of an embodiment of the present disclosure.The node of the embodiment is made For the i-th node on data transfer path, there is N number of node, 2≤i≤N-1 on data transfer path.As shown in figure 3, the reality The node for applying example includes:
Data transmission unit 301, for sending the i-th data file and i-th pair account file, 2≤i≤N- to i+1 node 1, i-th pair account file includes the reconciliation that previous node of the first node into i+1 node in adjacent node is sent to latter node The latter node of audit files and first node into the i-th node in the adjacent node reconciliation feedback text that a node is sent forward Part;Wherein, reconciliation audit files include that the mark of previous node and data file send information, and reconciliation feedback file includes latter The mark and data file reception information of node.
It should be understood, of course, that node can also include data receipt unit 302, for receiving the i-th-of the transmission of the (i-1)-th node 1 data and the (i-1)-th reconciliation file, the (i-1)-th reconciliation file include that first node is previous in adjacent node into the i-th node Latter node of the reconciliation audit files and first node that node is sent to latter node into the (i-1)-th node in adjacent node The reconciliation feedback file sent to previous node.
It should be noted that the case where for i=2, i.e., for second node, the (i-1)-th reconciliation file only includes first node The reconciliation audit files sent to second node.
Fig. 4 is the structural schematic diagram according to the data transmission system of the disclosure another embodiment.As shown in figure 4, the reality The system for applying example includes memory 401 and processor 402.Memory 401 can be disk, flash memory or other any non-volatile Storage medium.Memory 401 is used to store the corresponding instruction of method of any one aforementioned embodiment.Processor 402 is coupled to Memory 401 may be implemented as one or more integrated circuits, such as microprocessor or microcontroller.Processor 402 is used for Execute the instruction stored in memory 401.
Fig. 5 is the structural schematic diagram according to the data transmission system of the disclosure another embodiment.As shown in figure 5, the reality The system 500 for applying example includes memory 501 and processor 502.Processor 502 is coupled to memory by bus (BUS) 503 501.The system 500 can also be connected to external memory 505 by memory interface 504 to call external data, may be used also To be connected to network or external computer system (not shown) by network interface 506.
The disclosure additionally provides a kind of computer readable storage medium, is stored thereon with computer program instructions, the instruction The step of method of any one aforementioned embodiment is realized when being executed by processor.
The disclosure provide scheme can have it is one or more of following the utility model has the advantages that
On the one hand, by refile reconciliation file, small to the revamping workload of node, cost is small.
On the other hand, without hanging monitoring module for the setting of each node is other, monitoring module acquisition monitoring information is hung by side and is united One, which sends data gathering node to, is analyzed and processed.Between the scheme of the disclosure only needs data gathering node to analyze adjacent node The reconciliation file of refile, can be realized the data quality monitoring of end-to-end complete trails, and system architecture is further simplified.
In another aspect, the scheme of the disclosure can be adapted for end-to-end data convergence scene, system reform cost is low, has Good cost-effectiveness.
It should be understood by those skilled in the art that, embodiment of the disclosure can provide as method, apparatus or computer program Product.Therefore, complete hardware embodiment, complete software embodiment or reality combining software and hardware aspects can be used in the disclosure Apply the form of example.Moreover, it wherein includes the computer of computer usable program code that the disclosure, which can be used in one or more, The calculating implemented in non-transient storage medium (including but not limited to magnetic disk storage, CD-ROM, optical memory etc.) can be used The form of machine program product.
The disclosure is reference according to the method for the embodiment of the present disclosure, the flow chart of equipment (system) and computer program product And/or block diagram describes.It should be understood that each process in flowchart and/or the block diagram can be realized by computer program instructions And/or the combination of the process and/or box in box and flowchart and/or the block diagram.It can provide these computer programs to refer to Enable the processor of general purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices to generate One machine so that by the instruction that the processor of computer or other programmable data processing devices executes generate for realizing The device for the function of being specified in one or more flows of the flowchart and/or one or more blocks of the block diagram.
These computer program instructions, which may also be stored in, is able to guide computer or other programmable data processing devices with spy Determine in the computer-readable memory that mode works, so that it includes referring to that instruction stored in the computer readable memory, which generates, Enable the manufacture of device, the command device realize in one box of one or more flows of the flowchart and/or block diagram or The function of being specified in multiple boxes.
These computer program instructions also can be loaded onto a computer or other programmable data processing device, so that counting Series of operation steps are executed on calculation machine or other programmable devices to generate computer implemented processing, thus in computer or The instruction executed on other programmable devices is provided for realizing in one or more flows of the flowchart and/or block diagram one The step of function of being specified in a box or multiple boxes.
So far, the disclosure is described in detail.In order to avoid covering the design of the disclosure, it is public that this field institute is not described The some details known.Those skilled in the art as described above, completely it can be appreciated how implementing technology disclosed herein Scheme.
Although being described in detail by some specific embodiments of the example to the disclosure, the skill of this field Art personnel it should be understood that above example merely to be illustrated, rather than in order to limit the scope of the present disclosure.The skill of this field Art personnel are it should be understood that can modify to above embodiments in the case where not departing from the scope of the present disclosure and spirit.This public affairs The range opened is defined by the following claims.

Claims (14)

1. a kind of data transmission method, comprising:
First node on data transfer path sends the 1st data file and reconciliation audit files to second node, and the data pass There is N number of node on defeated path;
I-th node sends the i-th data file and i-th pair account file, 2≤i≤N-1, the i-th pair account file to i+1 node Reconciliation audit files that previous node including first node into i+1 node in adjacent node is sent to latter node and Latter node of the first node into the i-th node in the adjacent node reconciliation feedback file that a node is sent forward;
Nth node verifies text according to the reconciliation that previous node is sent to latter node in adjacent node on the data transfer path Part and the latter node reconciliation feedback file that a node is sent forward, determine the data transmission quality between adjacent node;
Wherein, the reconciliation audit files include the mark of previous node and data file sends information, the reconciliation feedback text Part includes the mark and data file reception information of latter node.
2. according to the method described in claim 1, wherein,
It includes at least one in following that the data file, which sends information: the size for the data file that previous node is sent, hair Send total quantity;
It includes at least one in following that the data file, which receives information: the size of the latter received data file of node connects Receive total quantity.
3. according to the method described in claim 2, wherein, the data transmission quality between the determining adjacent node includes:
Size, the mark of previous node, the received data of latter node for the data file that nth node is sent according to previous node The mark of the size of file and latter node determines the data transmission percentage of head rice between adjacent node.
4. according to the method described in claim 2, wherein, the data transmission quality between the determining adjacent node includes:
The transmission total quantity for the data file that nth node is sent according to previous node, the mark of previous node, latter node receive Data file total number of receipts amount and latter node mark, determine between adjacent node data transmission percentage of head rice.
5. according to the method described in claim 2, wherein, it further includes the number that previous node is sent that the data file, which sends information, According to the transmission time started of file;The data file receives the reception knot that information further includes the received data file of latter node The beam time;
Data transmission quality between the determining adjacent node includes:
The data file that nth node is sent according to previous node sends time started and the received data file of latter node The end time is received, determines the transmission time of data file;
The transmission time of calculating data file is less than the qualified quantity of the data file of preset time;
It calculates qualified quantity and sends the ratio of total quantity, to obtain the transmission promptness rate of the data between adjacent node.
6. a kind of data transmission system, including N number of node on data transfer path, N number of node includes:
First node, for sending the 1st data file and reconciliation audit files to second node;
I-th node, for sending the i-th data file and i-th pair account file, 2≤i≤N-1, the i-th pair account to i+1 node File include previous node of the first node into i+1 node in adjacent node sent to latter node reconciliation audit files, And latter node of the first node into the i-th node in the adjacent node reconciliation feedback file that a node is sent forward;
Nth node, for according to the reconciliation that previous node is sent to latter node in adjacent node on the data transfer path Audit files and the latter node reconciliation feedback file that a node is sent forward determine the data transmission between adjacent node Quality;
Wherein, the reconciliation audit files include the mark of previous node and data file sends information, the reconciliation feedback text Part includes the mark and data file reception information of latter node.
7. system according to claim 6, wherein
It includes at least one in following that the data file, which sends information: the size for the data file that previous node is sent, hair Send total quantity;
It includes at least one in following that the data file, which receives information: the size of the latter received data file of node connects Receive total quantity.
8. system according to claim 7, wherein
The size for the data file that the nth node is used to be sent according to previous node, the mark of previous node, latter node connect The mark of the size of the data file of receipts and latter node determines the data transmission percentage of head rice between adjacent node.
9. system according to claim 7, wherein
It is the transmission total quantity of the data file that the nth node is used to be sent according to previous node, the mark of previous node, latter The total number of receipts amount of the received data file of node and the mark of latter node determine the data transmission between adjacent node Percentage of head rice.
10. system according to claim 7, wherein it further includes what previous node was sent that the data file, which sends information, The transmission time started of data file;The data file receives the reception that information further includes the received data file of latter node End time;
The transmission time started for the data file that the nth node is used to be sent according to previous node and the received number of latter node According to the reception end time of file, the transmission time of data file is determined;When calculating the transmission time of data file less than presetting Between data file qualified quantity;It calculates qualified quantity and sends the ratio of total quantity, to obtain the number between adjacent node According to transmission promptness rate.
11. a kind of data transmission method, comprising:
The i-th node on data transfer path sends the i-th data file and i-th pair account file, the i-th pair to i+1 node Account file includes the reconciliation verification text that previous node of the first node into i+1 node in adjacent node is sent to latter node The latter node of part and first node into the i-th node in the adjacent node reconciliation feedback file that a node is sent forward;
Wherein, there is N number of node, 2≤i≤N-1 on the data transfer path;
Wherein, the reconciliation audit files include the mark of previous node and data file sends information, the reconciliation feedback text Part includes the mark and data file reception information of latter node.
12. a kind of data transmission nodal, the node is as the i-th node on data transfer path, the data transfer path Above there is N number of node, 2≤i≤N-1, the node includes:
Data transmission unit, for sending the i-th data file and i-th pair account file to i+1 node, 2≤i≤N-1, described the I reconciliation file includes the reconciliation verification that previous node of the first node into i+1 node in adjacent node is sent to latter node The latter node of file and first node into the i-th node in the adjacent node reconciliation feedback file that a node is sent forward;
Wherein, the reconciliation audit files include the mark of previous node and data file sends information, the reconciliation feedback text Part includes the mark and data file reception information of latter node.
13. a kind of data transmission nodal, comprising:
Memory;And
It is coupled to the processor of the memory, the processor is configured to based on the instruction execution for being stored in the memory Method as claimed in claim 11.
14. a kind of computer readable storage medium, is stored thereon with computer program instructions, real when which is executed by processor Now method as claimed in claim 11.
CN201711389217.6A 2017-12-21 2017-12-21 Data transmission method, system, node and computer readable storage medium Active CN109951507B (en)

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 true CN109951507A (en) 2019-06-28
CN109951507B 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 (5)

* Cited by examiner, † Cited by third party
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
US20130304796A1 (en) * 2010-09-29 2013-11-14 Citrix Systems, Inc. Systems and methods for providing quality of service via a flow controlled tunnel
CN105591835A (en) * 2015-08-12 2016-05-18 杭州华三通信技术有限公司 Link quality detection method and device

Patent Citations (5)

* Cited by examiner, † Cited by third party
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
US20130304796A1 (en) * 2010-09-29 2013-11-14 Citrix Systems, Inc. Systems and methods for providing quality of service via a flow controlled tunnel
CN105591835A (en) * 2015-08-12 2016-05-18 杭州华三通信技术有限公司 Link quality detection method and device

Also Published As

Publication number Publication date
CN109951507B (en) 2021-12-14

Similar Documents

Publication Publication Date Title
US11363353B2 (en) Video highlight determination method and apparatus, storage medium, and electronic device
CN104618195B (en) Bandwidth estimation method and apparatus
CN110489042B (en) Method and system for simulating dragging based on video network
US20180063481A1 (en) Human interface device (hid) based control of video data conversion at docking station
WO2020098040A1 (en) Dds-based cross-network segment communication method
CN104244027A (en) Control method and system used for live transmission and play process sharing of audio/video data
CN109327479A (en) Encrypt recognition methods and the device of stream
CN109039959A (en) A kind of the consistency judgment method and relevant apparatus of SDN network rule
JP2010218185A (en) System analysis method, apparatus and program
CN108965112A (en) The method and device of file transmission is carried out using instant message applications
CN109889922A (en) Method, device, equipment and storage medium for forwarding streaming media data
CN111030883A (en) Power information transmission delay analysis method, device, equipment and storage medium
WO2020056633A1 (en) Method for estimating network rate and estimation device
CN104394199B (en) A kind of mobile terminal remote post-sale support method and device
CN106549827A (en) The detection method and device of network state
Dong et al. Copula analysis for statistical network calculus
CN109951507A (en) Data transmission method, system, node and computer readable storage medium
EP4142258A1 (en) Edge computing network, data transmission method and apparatus, device and storage medium
CN107517237A (en) A kind of video frequency identifying method and device
CN104137512B (en) A kind of data back up method, device and system
CN113271474B (en) Method, device, equipment and storage medium for testing streaming media server
CN103607596B (en) Clock alignment processing method and processing device
CN103927341B (en) A kind of method and device for obtaining scene information
US10231004B2 (en) Network recording service
CN106130764B (en) A kind of whether available method and system of monitor video direct broadcasting room data service

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
EE01 Entry into force of recordation of patent licensing contract

Application publication date: 20190628

Assignee: Tianyiyun Technology Co.,Ltd.

Assignor: CHINA TELECOM Corp.,Ltd.

Contract record no.: X2024110000040

Denomination of invention: Data transmission methods, systems, nodes, and computer-readable storage media

Granted publication date: 20211214

License type: Common License

Record date: 20240914

EE01 Entry into force of recordation of patent licensing contract