WO2021142632A1

WO2021142632A1 - Transmission time determination method, link state evaluation method, computing device, and medium

Info

Publication number: WO2021142632A1
Application number: PCT/CN2020/072080
Authority: WO
Inventors: 张海涛; 于禾; 周文晶; 王琪
Original assignee: 西门子股份公司; 西门子（中国）有限公司
Priority date: 2020-01-14
Filing date: 2020-01-14
Publication date: 2021-07-22

Abstract

The present disclosure relates to a transmission time determination method, a link state evaluation method, a computing device, and a medium. A method for determining a data transmission time, wherein data transmission is based on a transmission control protocol, comprises: a first sending step: a first node sends a data packet to a second node, and the first node records a first moment when the data packet is sent to the second node; a first receiving step: the first node receives an acknowledgement data packet from the second node, and records a second moment when the acknowledgement data packet is received from the second node, wherein the received acknowledgement data packet comprises a processing time when the second node processes the data packet; and a transmission time determining step: the first node determines a data transmission time from the first node to the second node at least on the basis of the first moment, the second moment, and the processing time.

Description

Transmission time determination method, link state evaluation method, computing device and medium

Technical field

The present disclosure generally relates to the technical field of the Internet of Things, and more specifically, to a transmission time determination method, a link state evaluation method, a computing device, and a medium.

Background technique

Industrial Internet of Things (IoT) applications have developed rapidly recently. Fig. 1 shows a schematic diagram of a basic architecture 100 of an IOT application. The architecture includes a field device 102, an edge controller 104, and a cloud platform 106. The field device 102 performs field operations to generate field data; the edge controller 104 responds to the collected field data, translates the data, and sends the data to the cloud platform 106; on the cloud platform 106, the data is analyzed and visualized.

The route from the edge device to the cloud platform is selected through the router or gateway of the Internet. If the path is overloaded, the transmission delay from the edge device to the cloud will be relatively large, so data may be lost in the process of data transmission from the edge device to the cloud platform.

If the transmission time of the path from the edge device to the cloud platform can be known in advance, the data sent on the edge device side can be adjusted to avoid data loss or reduce the transmission delay, such as reducing the amount of data and increasing the transmission gap.

Although the traditional routing algorithm can calculate the transmission cost through hops or weighted hops to select the corresponding path, there is no way to obtain the transmission cost except for the routing algorithm.

Summary of the invention

A brief overview of the present invention is given below in order to provide a basic understanding of certain aspects of the present invention. It should be understood that this summary is not an exhaustive summary of the present invention. It is not intended to determine the key or important part of the present invention, nor is it intended to limit the scope of the present invention. Its purpose is merely to present some concepts in a simplified form as a prelude to the more detailed description that will be discussed later.

In view of the above, the present disclosure proposes a method for automatically calculating the data transmission time between two nodes, which uses the existing Transmission Control Protocol (TCP) transmission mechanism to expand the transmitted data packet, The transmission time can be calculated flexibly.

According to one aspect of the present disclosure, there is provided a method for determining data transmission time, wherein the data transmission is based on a transmission control protocol and includes: a first sending step: a first node sends a data packet to a second node, and the first node records The first moment when the second node sends the data packet; the first receiving step: the first node receives the confirmation data packet from the second node, and records the receipt of the confirmation data from the second node The second moment of the packet, wherein the received confirmation data packet includes the processing time for the second node to process the data packet; and the step of determining the transmission time: the first node is based at least on the first moment, The second time and the processing time determine the data transmission time from the first node to the second node.

Optionally, in an example of the foregoing aspect, the step of determining the transmission time includes: determining the transmission time from the first node to the first node based on the first time, the second time, the processing time, and the load information. The data transmission time of the second node.

Optionally, in an example of the foregoing aspect, the data packet is a TCP keep-alive data packet, and the confirmation data packet is a TCP keep-alive confirmation data packet.

Optionally, in an example of the foregoing aspect, the first node is an edge device, and the second node is a cloud platform.

According to another aspect of the present disclosure, a method for determining data transmission time is provided, the data transmission is based on a transmission control protocol, and includes: a second receiving step: a second node receives a data packet sent from a first node, and records The third time when the data packet is received; the processing step: the second node processes the data packet; and the second sending step: the second node sends a confirmation data packet, and records the sending of the confirmation data At the fourth time of the packet, the confirmation data packet includes the processing time for the second node to process the data packet, where the processing time is the elapsed time from the third time to the fourth time.

Optionally, in an example of the foregoing aspect, the confirmation data packet further includes load information of the second node.

According to another aspect of the present disclosure, a link state evaluation method is provided, which includes: a first node and a second node respectively repeatedly execute the above-mentioned method for determining data transmission time to determine the first node and the second node. Multiple data transmission times of the link between the two nodes; and evaluating the state of the link based on the multiple data transmission times.

According to another aspect of the present disclosure, a link state evaluation method is provided, which includes: a transmission time calculation step: for each of a plurality of links between a node and a plurality of other nodes, repeat the above The method for determining the data transmission time is to calculate multiple data transmission times for each link; the storage step: store multiple data transmission times for each link; and the state assessment step: when the node is to be in the multiple When data transmission is performed on one of the links, the status of the link is evaluated based on the stored data transmission time of the link.

Optionally, in an example of the above aspect, the transmission time calculation step further includes: constructing multiple data packets of different predetermined sizes, and for each link, calculating and transmitting each data packet of the predetermined size. The storing step further includes: storing a plurality of data transmission times corresponding to each data packet of a predetermined size transmitted on each link.

According to another aspect of the present disclosure, a computing device is provided, including: at least one processor; and a memory coupled with the at least one processor, the memory is used to store instructions, when the instructions are used by the at least one When the processor executes, the processor is caused to execute the method as described above.

According to another aspect of the present disclosure, there is provided a non-transitory machine-readable storage medium, which stores executable instructions that, when executed, cause the machine to perform the method as described above.

According to another aspect of the present disclosure, there is provided a computer program including computer-executable instructions that, when executed, cause at least one processor to perform the method as described above.

According to another aspect of the present disclosure, there is provided a computer program product that is tangibly stored on a computer-readable medium and includes computer-executable instructions that, when executed, cause at least A processor executes the method described above.

The transmission time determination method and the link state evaluation method according to the present disclosure can use the existing TCP transmission mechanism to automatically calculate the data transmission time between two nodes, and the link state can be evaluated in real time based on the data transmission time. When the link is overloaded, the amount of data sent can be reduced, or the transmission gap can be increased, so as to avoid data loss or reduce transmission delay.

The method according to the present disclosure uses the existing TCP transmission mechanism, so as long as there is a TCP connection, the method according to the present disclosure can be used, and only minor modifications to the confirmation data packet are required, so the existing transmission system has little impact.

Most TCP connections use the TCP keep-alive mechanism to check whether the connection is active. The method according to the present disclosure can use the existing TCP keep-alive mechanism to calculate the transmission time, and automatically measure the transmission time in real time without the need to transmit more data packets.

TCP keep-alive packets are periodically sent between the two ends of a TCP connection. Therefore, the data transmission time can be obtained periodically by the method according to the present disclosure, so that the status of the link can be evaluated in real time. It is also possible to set the sending interval of TCP keep-active data packets according to the needs of the application, that is, to set the measurement period of the transmission time, so as to further ensure the real-time and accuracy of the assessment of the link status.

Data packets of different sizes have different transmission times. According to the current application, the size of the TCP keep-alive data packet can be set to be the same as the data packet size used by the application data to ensure the calculated data transmission time More precise.

Description of the drawings

With reference to the following description of the embodiments of the present invention in conjunction with the accompanying drawings, the above and other objectives, features and advantages of the present invention will be more easily understood. The components in the drawings are only to illustrate the principle of the present invention. In the drawings, the same or similar technical features or components will be represented by the same or similar reference numerals.

Figure 1 shows a schematic diagram of the basic architecture of the IOT application;

FIG. 2 is a flowchart showing an exemplary process of a method for determining a data transmission time according to an embodiment of the present disclosure;

Figure 3 is a schematic diagram showing data transmission between two nodes;

4 is a flowchart showing an exemplary process of a data transmission time determination method according to an embodiment of the present disclosure;

FIG. 5 is a flowchart showing an exemplary process of a link state evaluation method according to an embodiment of the present disclosure;

FIG. 6 is a flowchart showing an exemplary process of a link state evaluation method according to another embodiment of the present disclosure;

FIG. 7 is a block diagram showing an exemplary configuration of a first device for determining data transmission time according to an embodiment of the present disclosure;

FIG. 8 is a block diagram showing an exemplary configuration of a second device for determining data transmission time according to an embodiment of the present disclosure; and

FIG. 9 shows a block diagram of a computing device 900 that implements determining data transmission time or performing link state evaluation according to an embodiment of the present disclosure.

Reference number

100: Basic IOT architecture 102: Field equipment

104: Edge controller 106: Cloud platform

200: Data transmission time determination method S202, S204, S206, S402, S404,

S406, S502, S504, S602, S604,

S606: Steps

300: Data transmission diagram P1: First node

P2: The second node Tsend: TCP keeps active data packet transmission

time

Tack: TCP keeps alive and confirms data packet transmission T1: the first moment

Lost time

T2: second moment Tp2: second node processing time

Tp1: first node processing time Tr: third moment

Ts: Fourth moment 241: Production line name

242: Type of production line 400: Method for determining data transmission time

500, 600: Link status evaluation method 700: First device

702: First sending unit 704: First receiving unit

706: Transmission time determination unit 800: Second device

802: Second receiving unit 804: Processing unit

806: Second sending unit 900: Computing equipment

902: Processor 904: Memory

Detailed ways

The subject matter described herein will now be discussed with reference to example embodiments. It should be understood that the discussion of these embodiments is only to enable those skilled in the art to better understand and realize the subject described herein, and is not to limit the scope of protection, applicability, or examples set forth in the claims. The function and arrangement of the discussed elements can be changed without departing from the scope of protection of the present disclosure. Various examples can omit, substitute, or add various procedures or components as needed. For example, the described method may be executed in a different order from the described order, and various steps may be added, omitted, or combined. In addition, features described with respect to some examples can also be combined in other examples.

As used herein, the term "including" and its variations mean open terms, meaning "including but not limited to". The term "based on" means "based at least in part on." The terms "one embodiment" and "an embodiment" mean "at least one embodiment." The term "another embodiment" means "at least one other embodiment." The terms "first", "second", etc. may refer to different or the same objects. Other definitions can be included below, whether explicit or implicit. Unless clearly indicated in the context, the definition of a term is consistent throughout the specification.

In the method according to the present disclosure, a method for automatically calculating the data transmission time between two nodes is proposed, which uses the existing Transmission Control Protocol (TCP) transmission mechanism to perform data packet transmission For extension, the transmission time can be calculated flexibly.

In order to calculate the transmission time between two nodes, it can be achieved by sending a measurement data packet between the two nodes, and including the measurement method in the node and the data packet.

Many data transmission protocols use TCP connections to transmit data, such as OPC UA (Object Linking and Embedding (OLE) for Process Control Unified Architecture), http, and https. Most cloud applications are also based on TCP connections. For example, OPC UA is used to send data from the edge device side to the cloud platform side.

The method for determining the data transmission time according to an embodiment of the present disclosure will now be described with reference to the accompanying drawings.

FIG. 2 is a flowchart showing an exemplary process of a data transmission time determination method 200 according to an embodiment of the present disclosure.

The exemplary process shown in FIG. 2 is a method for determining the data transmission time described from the side of the first node P1 that sends the data packet.

First, in block S202, the first node P1 sends a data packet to the second node P2, and the first node P1 records the first time T1 at which the data packet is sent to the second node P2.

The first node and the second node may be, for example, an edge device and a cloud platform, respectively, or any two devices that perform data transmission. The device types of the first node and the second node are not limited in the method of the present invention.

It can be understood that the data packet sent here may be a measurement data packet specifically used to measure the data transmission time, or a TCP keep-alive data packet in the TCP transmission may be used.

The TCP connection has the feature of keeping alive to check whether the link is active. The mechanism of TCP keep alive is: one end of the TCP connection sends a TCP keep alive (TCP keep alive) packet to the other end, and then the other end sends back a TCP keep alive ACK packet to one end.

Because TCP keep-alive data packets are periodically sent between the two ends of a TCP connection, the TCP keep-alive data packet can be used as a measurement data packet, and the transmission time can be calculated according to the corresponding parameters. The specific parameters can be determined by the time measurement method.

In this article, the data packet sent is a TCP keep-alive data packet as an example for description. However, those skilled in the art will understand that other data packets can also be used as measurement data packets.

Next, in block S204, the first node P1 receives the confirmation data packet from the second node P2, and records the second time T2 when the confirmation data packet is received from the second node P2, wherein, The received confirmation data packet includes the processing time Tp2 for the second node P2 to process the data packet.

The specific process of data transmission between the first node P1 and the second node P2 will now be described with reference to FIG. 3. As shown in Figure 3, the first node P1 sends a TCP keep-alive data packet to the second node P2, and it takes Tsend time. The second node P2 receives the data packet and processes the received data packet within the time Tp2, and then It took Tack time to send a TCP keep-alive confirmation packet to the first node P1. If the first node P1 records that the first time of sending the data packet is T1, and the second time of recording the reception of the TCP keep-alive acknowledgment packet is T2, then the first node P1 sends the TCP keep-alive data packet to the first node P1 to receive TCP The first round-trip transmission time A=T2-T1 of the keep-alive confirmation data packet. The first round-trip transmission time A includes the transmission time Tsend of the TCP keep-alive data packet, the transmission time Tack of the TCP keep-alive acknowledgment data packet, and the processing time Tp2 of the second node P2, so the following equation (1) is given.

A=Tsend+Tack+Tp2...(1)

Because the size of the TCP keep-alive data packet and the TCP keep-alive confirmation data packet are basically the same, and the transmission time of the two data packets is generally within 1-2 minutes, it can be considered that the transmission link will not be large in a short time interval. The change.

Therefore, it can be considered that Tsend is basically equal to Tack. Then equation (1) can be transformed into:

A=2Tsend+Tp2=2Ttr+Tp2...(2)

Ttr=(A-Tp2)/2=A/2-Tp2/2...(3)

Ttr is the data transmission time on the link from the first node P1 to the second node P2.

As mentioned above, the first round-trip transmission time A=T2-T1. Therefore, in block S106, the first time T1 when the first node P1 sends the data packet and the second time T2 when the confirmation data packet is received can be used, and the first The processing time Tp2 for the second node P2 to process the data packet determines the data transmission time from the first node P1 to the second node P2.

Similarly, if the second node P2 sends a TCP keep-alive data packet to the first node P1, and the second node P2 receives a TCP keep-alive confirmation data packet from the first node P1. Record the round-trip transmission time from the second node P2 to the first node P1 as B, then:

B=2Ttr+Tp1

Ttr=B/2-Tp1/2...(4)

According to equation (3) or (4), it can be known that the processing time Tp1 or Tp2 is also a factor that affects the transmission time in the round-trip transmission time A or B. Tp1 or Tp2 is the time for processing TCP keep-alive data packets at node P1 or P2, respectively. Tp1 and Tp2 can be measured separately in the corresponding nodes.

FIG. 4 is a flowchart showing an exemplary process of a data transmission time determination method 400 according to an embodiment of the present disclosure.

The exemplary process shown in FIG. 4 is a method for determining the data transmission time described from the side of the second node P2 that receives the data packet.

First, in block S402, the second node P2 receives the data packet sent from the first node P1, and records the third time Tr when the data packet is received.

Next, in block S404, the second node P2 processes the data packet.

In block S406, the second node P2 sends a confirmation data packet, and records the fourth time Ts when the confirmation data packet is sent, and the confirmation data packet includes the processing time for the second node P2 to process the data packet , Wherein the processing time is equal to the elapsed time from the third moment to the fourth moment, that is, Tp2=Ts-Tr.

The standard TCP keep-alive data packet and TCP keep-alive confirmation data packet do not include any data. In the present disclosure, in order to calculate the data transmission time, the data packet can be expanded.

Specifically, the TCP keep-alive data packet does not need to be extended, while for the TCP keep-alive acknowledgment data packet, it can be expanded to include the data processing time of the node. That is, the second node P2 may pack the measured data processing time Tp2 of the second node in a TCP keep-alive confirmation data packet, and send it to the first node P1.

That is to say, when the first node P1 receives the confirmation data packet, by analyzing the confirmation data packet, the processing time of the second node P2 to process the data packet can be obtained, so that the first node P1 can send out according to the first node P1 The first time T1 of the data packet and the second time T2 of receiving the confirmation data packet, and the data processing time of the second node P2 included in the received confirmation data packet determine the time from the first node P1 to the second node P2. Data transfer time.

In an example, since the node load also affects the data transmission time, the confirmation data packet sent from the second node P2 to the first node P1 may also include the load information of the second node P2. In this case, when the first node P1 receives the TCP keep-alive confirmation packet, the information obtained by analyzing the confirmation packet may include the node processing time Tp, the node's load information Ln, and so on. Therefore, the first node P1 will determine the data transmission time from the first node to the second node based on the load information in addition to the recorded first time, second time, and the processing time of the second node P2.

Combining equations (3) and (4), the relationship between Tp1 and Tp2 can be obtained as:

A/2-Tp2/2=B/2-Tp1/2

Tp1=B-A+Tp2...(5)

For example, the first round-trip transmission time recorded at the first node P1 is A, and the second round-trip transmission data recorded at the second node P2 is B. In the case that the second data processing time Tp2 of the second node P2 is known, Equation (5) can be used to calculate the first data processing time Tp1 of the first node P1. For example, when the first node is an edge device and the second node is a cloud platform, it is usually easy to know the data processing time of the cloud platform, and equation (5) can be used to calculate the data processing time of the edge device.

In an embodiment according to the present disclosure, the link state may be evaluated based on the data transmission time Ttr. If Ttr is large, it means that it takes more time to transmit data on the link, which may be due to unstable or overloaded link.

FIG. 5 is a flowchart showing an exemplary process of a link state evaluation method 500 according to an embodiment of the present disclosure.

In block S502, the method for determining data transmission time described above with reference to FIGS. 2-4 is repeatedly executed between two nodes to determine multiple data transmissions of the link between the two nodes in a period of time. time.

In block S504, the state of the link is evaluated based on the plurality of data transmission times.

Through the operation in block S502, a transmission time sequence for a link within a period of time can be obtained, for example, Ttr1, Ttr2, Ttr3,... Ttrn. From the curve of the time data on the time axis, we can see whether the time data is stable, increasing or decreasing, so that we can know whether the corresponding link is stable, the load increases or the load decreases. The node can choose an appropriate method to transmit data according to the state of the link. For example, in the case of link overload, the amount of data sent can be reduced, or the transmission gap can be increased, so as to avoid data loss or reduce transmission delay.

TCP is widely used in the network. A node can use different TCP connections to connect to multiple different nodes. For each link using a TCP connection, multiple data transmission times can be calculated separately through the above methods.

FIG. 6 is a flowchart showing an exemplary process of a link state evaluation method 600 according to another embodiment of the present disclosure.

In block S602, for each of the multiple links between one node and multiple other nodes, repeat the method for determining the data transmission time described above with reference to Figures 2-4, and calculate each link separately. Multiple data transmission time of the link.

In block S604, store multiple data transmission times for each link.

For example, multiple data transmission times of each link between a node and other nodes can be stored locally in the node.

In block S606, when the node wants to perform data transmission on one of the multiple links, the status of the link may be evaluated based on the stored data transmission time of the link .

Through the above operations, a node can know the respective status of multiple links between it and multiple other nodes. When the node wants to transmit data on one of the multiple links, it can be based on the link Select the appropriate way to transfer data.

In addition, it can be known that the data packet size is also a factor that affects the transmission time on the same link. This means that on the same link, the transmission time of a 100-byte data packet and the transmission time of a 500-byte data packet are different. Therefore, TCP keepalive data packets of different sizes can be formed respectively, such as 100 bytes in size, 500 bytes in size, and 1000 bytes in size. In addition, the size of the TCP keep-alive confirmation packet corresponds to the size of the TCP keep-alive packet. Therefore, at both ends of a TCP connection, the TCP keep-alive packet and TCP keep-alive confirmation packet should be filled with random data to make the size equal to the corresponding size.

Therefore, in an example, a variety of data packets of different predetermined sizes can be constructed, for example, three data packets of 100 bytes, 500 bytes and 1000 bytes can be constructed respectively, and each predetermined size is adopted for each link. Repeat the method of determining the data transmission time described above with reference to Figures 2-4 to calculate multiple data transmission times. Through this operation, multiple data transmission times can be determined when each link transmits data packets of different sizes. In this case, when storing the transmission time of a link, multiple data transmission times corresponding to data packets of different sizes should be recorded separately.

In this way, the size of the TCP keep-alive data packet can be set to be the same as the data packet size used by the data of the application according to the needs of the application program to transmit data, thereby ensuring that the calculated data transmission time is more accurate.

Because TCP keeps alive, data packets are periodically sent between the two ends of a TCP connection. Therefore, the data transmission time can be obtained periodically by the method according to the present disclosure, and the data transmission time of the stored link can also be periodically updated, so that the status of the link can be evaluated in real time based on the data transmission time of the link. In addition, you can also set the sending interval of TCP keep-alive data packets according to the needs of the application, that is, set the period of measuring the transmission time, to further ensure the real-time and accuracy of the evaluation of the link status.

The connection between the edge device and the cloud is an Internet link based on TCP. Obtain field data according to the size of the edge device and send it to the cloud. Most data transmission from edge devices to the cloud is based on TCP, such as OPC UA protocol, https protocol and so on. Therefore, the above method can be used to calculate the transmission time of the link from the edge device to the cloud. Based on the transmission time, the edge device can evaluate the link status in real time and send data in the corresponding format. For example, when the link is overloaded, it can reduce the amount of data sent, or increase the transmission gap, so as to avoid data loss or can Reduce transmission delay.

The transmission time determination method and the link state evaluation method according to the present disclosure may have at least the following advantages.

FIG. 7 is a block diagram showing an exemplary configuration of a first device 700 for determining a data transmission time according to an embodiment of the present disclosure.

The first device 700 includes a first sending unit 702, a first receiving unit 704, and a transmission time determining unit 706.

The first sending unit 702 is configured to send a data packet to the second node, and record the first moment when the data packet is sent to the second node.

The first receiving unit 704 is configured to receive a confirmation data packet from the second node, and to record a second moment when the confirmation data packet is received from the second node, wherein the received confirmation data packet includes all The processing time for the second node to process the data packet.

The transmission time determining unit 706 is configured to determine the data transmission time from the first node to the second node based on at least the first moment, the second moment, and the processing time.

Wherein, the transmission time determining unit 706 is further configured to determine the data transmission time to the second node based on the first moment, the second moment, the processing time, and the load information.

Wherein, the data packet is a TCP keep-alive data packet, and the confirmation data packet is a TCP keep-alive confirmation data packet.

In an example, the first device 700 is set on an edge device, and the second node is a cloud platform.

FIG. 8 is a block diagram showing an exemplary configuration of a second device 800 for determining data transmission time according to an embodiment of the present disclosure.

The second device 800 includes a second receiving unit 802, a processing unit 804, and a second sending unit 806.

Wherein, the second receiving unit 802 is configured to receive a data packet sent from the first sending unit 702 of the first device 700, and record the third time when the data packet is received.

The processing unit 804 is configured to process the data packet.

The second sending unit 806 is configured to send a confirmation data packet, and record the fourth moment when the confirmation data packet is sent, the confirmation data packet includes the processing time of the processing unit to process the data packet, wherein the The processing time is equal to the elapsed time from the third moment to the fourth moment.

In an example, the confirmation data packet also includes load information of the second node.

In one example, the second device is set on the cloud platform, and the first device is set on the edge device.

It should also be noted that the structures of the first device 700 and the second device 800 for determining the data transmission time and their constituent units shown in FIG. 7 and FIG. 8 are only exemplary, and those skilled in the art can compare FIG. 7 as needed. And the structural block diagram shown in Figure 8 is modified.

The details of the operations and functions of the various parts of the first device 700 and the second device 800 for determining the data transmission time may be related to the embodiments of the data transmission

time determining methods

200 and 400 of the present disclosure described with reference to FIGS. 1-4, for example. The parts are the same or similar, and will not be described in detail here.

As above, referring to FIGS. 1 to 8, the embodiments of the method and device for determining the data transmission time and the method for evaluating the link state according to the embodiments of the present disclosure are described. The methods and devices described above can be implemented by hardware, or by software or a combination of hardware and software.

FIG. 9 shows a block diagram of a computing device 900 that implements determining data transmission time or performing link state evaluation according to an embodiment of the present disclosure. According to an embodiment, the computing device 900 may include at least one processor 902, which executes at least one computer-readable instruction stored or encoded in a computer-readable storage medium (ie, the memory 904) (ie, the above-mentioned in the form of software) Implemented elements).

It should be understood that the computer-executable instructions stored in the memory 904, when executed, cause at least one processor 902 to perform the various operations and functions described above in conjunction with FIGS. 1-6 in the various embodiments of the present disclosure.

According to one embodiment, a non-transitory machine-readable medium is provided. The non-transitory machine-readable medium may have machine-executable instructions (that is, the above-mentioned elements implemented in the form of software), which when executed by a machine, cause the machine to execute the various embodiments of the present disclosure in conjunction with FIGS. 1-6. Various operations and functions described.

According to one embodiment, there is provided a computer program, including computer-executable instructions, which, when executed, cause at least one processor to execute each of the above described in conjunction with FIGS. 1-6 in the various embodiments of the present disclosure. Kinds of operations and functions.

According to one embodiment, there is provided a computer program product, including computer-executable instructions, which, when executed, cause at least one processor to execute the above described in conjunction with FIGS. 1-6 in the various embodiments of the present disclosure. Various operations and functions.

The specific implementations set forth above in conjunction with the drawings describe exemplary embodiments, but do not represent all embodiments that can be implemented or fall within the protection scope of the claims. The term "exemplary" used throughout this specification means "serving as an example, instance, or illustration", and does not mean "preferred" or "advantageous" over other embodiments. The detailed description includes specific details for the purpose of providing an understanding of the described technology. However, these techniques can be implemented without these specific details. In some instances, in order to avoid incomprehensibility to the concepts of the described embodiments, well-known structures and devices are shown in the form of block diagrams.

The foregoing description of the present disclosure is provided to enable any person of ordinary skill in the art to implement or use the present disclosure. For those of ordinary skill in the art, various modifications to the present disclosure are obvious, and the general principles defined herein can also be applied to other modifications without departing from the scope of protection of the present disclosure. . Therefore, the present disclosure is not limited to the examples and designs described herein, but is consistent with the widest scope that conforms to the principles and novel features disclosed herein.

Claims

A method for determining the data transmission time, where the data transmission is based on the transmission control protocol, including:

The first sending step: the first node sends a data packet to the second node, and the first node records the first moment when the data packet is sent to the second node;

The first receiving step: the first node receives the confirmation data packet from the second node, and records the second time when the confirmation data packet is received from the second node, wherein the received confirmation data packet Including the processing time for the second node to process the data packet; and

Transmission time determining step: The first node determines the data transmission time from the first node to the second node based on at least the first time, the second time, and the processing time.
The method according to claim 1, wherein the confirmation data packet further includes load information of the second node, wherein the step of determining the transmission time includes:

The data transmission time from the first node to the second node is determined based on the first time, the second time, the processing time, and the load information.
The method according to claim 1 or 2, wherein the data packet is a TCP keep-alive data packet, and the confirmation data packet is a TCP keep-alive confirmation data packet.
The method according to any one of claims 1 to 3, wherein the first node is an edge device, and the second node is a cloud platform.
A method for determining data transmission time, the data transmission is based on a transmission control protocol, and includes:

The second receiving step: the second node receives the data packet sent from the first node, and records the third time when the data packet is received;

Processing step: the second node processes the data packet; and

The second sending step: the second node sends a confirmation data packet, and records the fourth moment when the confirmation data packet is sent, the confirmation data packet includes the processing time of the second node to process the data packet, wherein , The processing time is the elapsed time from the third time to the fourth time.
The method according to claim 5, wherein the confirmation data packet further includes load information of the second node.
Link status assessment methods, including:

The first node and the second node respectively repeatedly execute the method according to any one of claims 1-4 and the method according to any one of claims 5-6 to determine the first node and the Multiple data transmission times of the link between the second nodes; and

The state of the link is evaluated based on the plurality of data transmission times.
Link status assessment methods, including:

Transmission time calculation step: for each of the multiple links between one node and multiple other nodes, repeat the method according to any one of claims 1-4 and according to claims 5-6 In the method described in any one of the above, the multiple data transmission times of each link are calculated separately;

Storage steps: store multiple data transmission times for each link; and

The state evaluation step: when the node wants to perform data transmission on one of the multiple links, the state of the link is evaluated based on the stored data transmission time of the link.
The method of claim 8, wherein:

The transmission time calculation step further includes: constructing a plurality of data packets of different predetermined sizes, and for each link, respectively calculating multiple data transmission times for transmitting each data packet of the predetermined size;

The storing step further includes: storing multiple data transmission times corresponding to each data packet of a predetermined size transmitted on each link.
Computing equipment (900), including:

At least one processor (902); and

A memory (904) coupled to the at least one processor (902), where the memory is used to store instructions. When the instructions are executed by the at least one processor (902), the processor (902) ) Perform the method according to any one of claims 1 to 9.
A non-transitory machine-readable storage medium that stores executable instructions that, when executed, cause the machine to execute the method according to any one of claims 1 to 9.
A computer program comprising computer-executable instructions that, when executed, cause at least one processor to execute the method according to any one of claims 1 to 9.
A computer program product that is tangibly stored on a computer-readable medium and includes computer-executable instructions, which when executed, cause at least one processor to execute according to claims 1 to 9 The method described in any one of.