Method for determining delay, and terminal device and network device

Abstract

The present application belongs to the field of communications. Disclosed are a method for determining a delay, and a terminal device and a network device. The method for determining a delay in the embodiments of the present application comprises: acquiring the maximum packet length, the priority, a source node and a destination node of a service flow to be deployed; determining a path between the source node and the destination node and each node of the path; and when there is an objective function corresponding to the priority of said service flow on each node of the path, determining a delay of said service flow according to the maximum packet length of said service flow and the objective function, wherein the objective function represents the correspondence between the maximum packet length and the delay of said service flow.

Description

Method for determining time delay, terminal device and network device

[0001] CROSS-REFERENCE TO RELATED APPLICATIONS

[0002] This application claims priority to the Chinese patent application filed with the China Patent Office on June 12, 2023, with application number 202310695074.0 and invention name “Method for determining delay, terminal device and network device”. The entire contents of the Chinese patent application are incorporated herein by reference. Technical Field

[0003] The embodiments of the present application relate to the field of communications, and in particular to a method for determining delay, a terminal device, and a network device. Background Art

[0004] In some instances, the processing delay of network nodes is a fixed value, which cannot meet the parameter input of the network calculation model. It is necessary to dynamically obtain the node processing delay for different packet lengths. In related technologies, there are various ways to measure the latency of network device nodes. The latency of the device node can be tested by connecting the device node to a tester and running a traffic flow. However, this method can only be used in small-scale topologies and measure the latency of a limited number of nodes. Different topologies have different scales, and it is impossible to accurately measure the different processing delays of each node.

[0005] Summary of the Invention

[0006] The embodiments of the present application provide a method for determining delay, a terminal device, and a network device, which can measure and obtain the different processing delays of each node with high precision.

[0007] In a first aspect, a method for determining delay is provided, the method comprising: obtaining a maximum packet length, priority, source node, and destination node of a service flow to be deployed; determining a path between the source node and the destination node and each node of the path; and determining the delay of the service flow to be deployed based on the maximum packet length of the service flow to be deployed and the target function, when there is an objective function corresponding to the priority of the service flow to be deployed on each node of the path, wherein the objective function represents the correspondence between the maximum packet length and the delay of the service flow to be deployed.

[0008] In a second aspect, a network device is provided, which includes a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the method described in the first aspect.

[0009] In a third aspect, a readable storage medium is provided, on which a program or instruction is stored. When the program or instruction is executed by a processor, the steps of the method described in the first aspect are implemented.

[0010] In a fourth aspect, a computer program product is provided, which includes a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the method described in the first aspect.

[0011] In a fifth aspect, a chip is provided, comprising a processor and a communication interface, wherein the communication interface is coupled to the processor, and the processor is configured to run a program or instruction to implement the method described in the first aspect.

[0012] In a sixth aspect, a computer program / program product is provided, wherein the computer program / program product is stored in a non-volatile storage medium, and the program / program product is executed by at least one processor to implement the method as described in the first aspect. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] FIG1 is a schematic flowchart of a method for determining a time delay according to an embodiment of the present application;

[0014] FIG2 is a schematic flowchart of a method for determining a time delay according to an embodiment of the present application;

[0015] FIG3 is a schematic flowchart of a method for determining a time delay according to an embodiment of the present application;

[0016] FIG4 is a schematic diagram of a network topology of a method for determining delay according to an embodiment of the present application;

[0017] FIG5 is a schematic structural diagram of an apparatus for determining a time delay according to another embodiment of the present application;

[0018] FIG6 is a schematic structural diagram of a network device according to another embodiment of the present application. DETAILED DESCRIPTION

[0019] The following will be combined with the accompanying drawings in the embodiments of the present application to clearly describe the technical solutions in the embodiments of the present application. Obviously, the embodiments described are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field are within the scope of protection of this application.

[0020] The terms "first," "second," and the like in the specification and claims of this application are used to distinguish similar objects and are not used to describe a particular order or precedence. It should be understood that the terms used in this manner are interchangeable where appropriate so that the embodiments of this application can be implemented in an order other than that illustrated or described herein. In addition, the term "and / or" in the specification and claims refers to at least one of the connected objects, and the character " / " generally indicates that the objects connected are in an "or" relationship.

[0021] As shown in Figure 1, an embodiment of the present application provides a method for determining latency, which can be executed by a network device. In other words, the method can be executed by software or hardware installed on the network device. The network device can be a controller or a network node including a controller. The method includes the following steps.

[0022] S11: Obtain the maximum packet length, priority, source node, and destination node of the service flow to be deployed.

[0023] For example, the source node of the service flow to be deployed is node 1, the destination node is node 6, the priority is 5, and the maximum packet length is 1500 bytes.

[0024] S12: Determine a path between the source node and the destination node and each node on the path.

[0025] Determine the path from node1 to node6 and the nodes included in the path: node1, node2, node3, node4, node5, and node6.

[0026] S13: When an objective function corresponding to the priority of the service flow to be deployed exists on each node of the path, determine the delay of the service flow to be deployed according to the maximum packet length of the service flow to be deployed and the objective function.

[0027] The objective function represents the corresponding relationship between the maximum packet length and delay of the service flow to be deployed.

[0028] For example, determine whether there is a delay-packet length function curve corresponding to priority 5 on the path from node1 to node6. When it is determined that there is a delay-packet length function curve corresponding to priority 5 on the path from node1 to node6, determine the delay of the service flow to be deployed based on the maximum packet length of the service flow to be deployed and the objective function. Among them, when the priority of node1 is 5, the functional relationship between delay and packet length is y=0.0033x+9.3684, when the priority of node2 is 5, the functional relationship between delay and packet length is y=0.0033x+10.1476, when the priority of node3 is 5, the functional relationship between delay and packet length is y=0.0033x+11.1376, and when the priority of node6 is 5, the functional relationship between delay and packet length is y=0.0039x+11.0608.

[0029] Substituting the maximum packet length of 1500 bytes into the latency-packet length function equations for node 1 through node 6, we calculate the processing delay for node 1 to be 0.0034*1500+9.3684=14.47us, the processing delay for node 2 to be 0.0033*1500+10.1476=15.10us, the processing delay for node 3 to be 0.0033*1500+11.1376=16.09us, and the processing delay for node 6 to be 0.0039*1500+11.0608=14.47us.

[0030] The method for determining delay provided in an embodiment of the present application obtains the maximum packet length, priority, source node and destination node of the business flow to be deployed; determines the path between the source node and the destination node and each node of the path; and, in the case where there is an objective function corresponding to the priority of the business flow to be deployed on each node of the path, determines the delay of the business flow to be deployed based on the maximum packet length of the business flow to be deployed and the objective function. The objective function represents the corresponding relationship between the maximum packet length and delay of the business flow to be deployed, and can measure and obtain the different processing delays of each node with high precision.

[0031] As shown in Figure 2, an embodiment of the present application provides a method for determining latency, which can be executed by a network device. In other words, the method can be executed by software or hardware installed on the network device. The network device can be a controller or a network node including a controller. The method includes the following steps.

[0032] S101: The controller obtains information such as the maximum packet length, priority, source node, and destination node of the service flow to be deployed.

[0033] This step can be described in the same manner as S11 in the embodiment of FIG1 , and will not be described again here.

[0034] S102: The controller queries whether the nodes on the path that the service flow needs to pass through have a delay-packet length fitting curve of this priority.

[0035] If not, continue with S103 and subsequent steps; if yes, go to S107.

[0036] S103: The controller selects a source node and a destination node, and configures OAM messages of different packet lengths. The OAM message priority is the same as the service flow, and measures the processing delay of all the nodes passed through.

[0037] In other words, if no target function corresponding to the priority of the service flow to be deployed exists at each node on the path, a target management message is sent to the source node, wherein the target management message indicates the measurement of processing delay parameters of multiple nodes on the path. In one embodiment, the target management message includes an Operation Administration and Maintenance (OAM) message. Thus, in the method for determining delay provided by an embodiment of the present application, a controller configures OAM messages of different packet lengths and priorities to measure the processing delay of all nodes passed from the source node to the destination node.

[0038] S104: The destination node sends an OAM message carrying the measurement value to the controller.

[0039] S105: The controller calculates the processing delay corresponding to different packet lengths of each node through which the OAM message passes, and subtracts the timestamp t1 of the inbound port from the timestamp t2 before the outbound port queue of each node to obtain the processing delay tpro=t2-t1 of this priority of each node.

[0040] In other words, the controller receives processing delay parameters for each node on the path, including a second timestamp before the target management message enters the egress queue of any node and a first timestamp when the target management message enters the ingress port of any node. The controller determines the processing delay for any node based on the difference between the second timestamp and the first timestamp. Specifically, the controller calculates the processing delay for each node at that priority level as tpro = t2 - t1 by subtracting the ingress timestamp t1 from the egress queue timestamp t2 for each node.

[0041] Measuring node processing latency using OAM messages, as shown in Figure 3, requires adding a timestamp of t1 upon arrival at the node's ingress port and a timestamp of t2 before sending the message to the egress queue. The OAM message undergoes the same timestamping process at each node as it passes through on its way from the source to the destination. Upon reaching the destination, the timestamp information carried in the OAM message is sent to the controller, which subtracts the timestamps at each node, i.e., t2 - t1 = tpro, to calculate the node's processing latency. Furthermore, it is necessary to configure the sending of OAM messages with varying packet lengths and priorities. Repeating this OAM measurement process allows the controller to determine the processing latency corresponding to each node in the topology, regardless of packet length and priority.

[0042] Compared to the method of determining latency by using traffic, the method of determining latency by using timestamps in this step is more suitable for large-scale topologies. The method of determining latency by using traffic includes testing the latency of the device node by connecting it to a tester and using traffic. This method can only be used in small-scale topologies and is used to measure the latency of a limited number of nodes. Therefore, in the method of determining latency provided in the embodiment of the present application, the controller obtains the node processing latency by subtracting the timestamp of the inbound port from the timestamp before the outbound port queue in the OAM message.

[0043] S106: The controller fits the processing delays corresponding to different packet lengths to obtain a delay-packet length function curve for each node at this priority.

[0044] That is, based on the correspondence between the target management message packet length and the processing delay of each node on the path, the objective function corresponding to the priority of the to-be-deployed service flow at each node on the path is determined. In one example, there are multiple target management messages, each of which has a different packet length, and the objective function indicates the correspondence between different packet lengths and the processing delay of each node on the path. In another example, there are multiple target management messages, each of which has a different priority, and the objective function indicates the correspondence between different priorities and the processing delay of each node on the path.

[0045] After obtaining the processing delays corresponding to the different packet lengths and priorities of each node, the controller fits these different processing delays and fits a function curve y = f(x) for each node, representing the delay-packet length function for each priority level, where y is the delay and x is the packet length. Fitting involves connecting a series of points on a plane with a smooth curve. The fitted curve can generally be represented by a function. There are many fitting methods, such as the least squares fitting method. If several discrete function values ​​{f1, f2, …, fn} of a function are known, the difference between the function and the known point set (in the least squares sense) is minimized by adjusting several unknown coefficients f (λ1, λ2, …, λn) in the function. The least squares method (also known as the least squares method) finds the best function match for the data by minimizing the sum of squared errors and minimizing the sum of squared errors between the obtained data and the actual data. The least squares method can be used for curve fitting.

[0046] S107: The controller takes the maximum packet length of the service flow to be deployed into the delay-packet length function curve of each node at this priority level to calculate the corresponding processing delay value.

[0047] The controller then reads the maximum packet length and priority of the service flow currently to be deployed, and uses the delay-packet length function curve corresponding to the priority of each node to calculate the corresponding processing delay value. Therefore, in the method for determining delay provided in the embodiment of the present application, the controller linearly fits the maximum processing delay corresponding to multiple different packet lengths and priorities to derive the delay-packet length curve function for each node at different priorities. Based on the curve function, the processing delay value corresponding to the packet length and priority of the service actually to be deployed at each node can be calculated.

[0048] S108: The controller transmits the calculated processing delay as a parameter to the network calculation module. The network calculation module uses the processing delay of each node to calculate the upper bound of the end-to-end maximum delay of the service flow.

[0049] Network calculus is an end-to-end delay calculation technology based on arrival curves and service curves. By introducing minimum addition algebra, network calculus transforms complex nonlinear queuing problems into mathematical models that are easy to analyze, and then derives system performance through the mathematical relationship between the models to obtain the network delay. The arrival curve and service curve model of the network node established by network calculus can accurately calculate the upper bound of the end-to-end delay for different business flows, providing delay guarantee for deterministic business deployment. In this step, the upper bound of the end-to-end maximum delay of the business flow to be deployed can be determined based on the delay of the business flow to be deployed. Compared with the fixed value of the node processing delay, this step can meet the parameter input requirements of the network calculus model.

[0050] Therefore, in the method for determining delay provided by the embodiment of the present application, the controller configures OAM messages with different packet lengths and priorities to measure the processing delay of all nodes passed from the source node to the destination node, and obtains the node processing delay based on the timestamp before the outbound port queue in the OAM message minus the inbound port timestamp. The controller calculates the maximum processing delay corresponding to messages with different packet lengths and priorities at each node, and linearly fits the maximum processing delays corresponding to multiple different packet lengths and priorities to obtain a delay-packet length curve function under different priorities for each node. Based on the curve function, the processing delay value corresponding to the packet length and priority of the service that actually needs to be deployed at each node can be calculated, and passed to the network calculation module as the processing delay parameter of each node.

[0051] Next, the above steps will be described in detail through specific examples.

[0052] Example 1

[0053] Assume that the network topology is as shown in Figure 4, with a total of 6 nodes. The upper layer has a controller that can configure OAM messages, receive OAM measurement data uploaded by nodes, and perform processing delay fitting.

[0054] In S101 , the controller obtains the maximum packet length, priority, source node, and destination node of the service flow to be deployed, that is, the source node of the service flow to be deployed is node1, the destination node is node6, the priority is 5, and the maximum packet length is 1500 bytes.

[0055] In S102 , there is no delay-packet length function curve corresponding to priority 5 for the node on the queried path.

[0056] In S103, source node node1 and destination node node6 are selected to configure an OAM message with a priority of 5 and a length of 128 bytes, and the OAM message is sent from node 1 to node 6. The target management message indicates measuring processing delay parameters of multiple nodes on the path.

[0057] In S104, after passing through nodes node2 and node3, the timestamps before the ingress and egress queues are recorded at each node respectively, and uploaded to the controller after node6 receives the OAM message. Assume that the timestamps before the ingress and egress queues of node1 recorded in the OAM message are 2.83us and 12.66us respectively, the timestamps before the ingress and egress queues of node2 are 13.85us and 24.42us respectively, the timestamps before the ingress and egress queues of node3 are 25.86us and 37.42us respectively, and the timestamps before the ingress and egress queues of node6 are 38.63us and 50.19us respectively.

[0058] In S105, the controller receives the processing delay parameters of each node on the path; determines the processing delay of each node on the path based on the processing delay parameters of each node on the path; calculates the difference between the input and output timestamps of node1, node2, node3 and node6, that is, the processing delays are assumed to be 9.83us, 10.57us, 11.56us and 11.56us respectively; and configures an OAM message with a priority of 5 and a packet length of 256 bytes. It is assumed that the processing delays of node1-node6 calculated by the controller are 10 .23us, 10.99us, 11.98us, and 12.06us; when the priority is set to 5 and the OAM packet length is 512 bytes, it is assumed that the controller calculates the processing delays of node1 to node6 as 11.11us, 11.84us, 12.83us, and 13.05us respectively; when the priority is set to 5 and the OAM packet length is 1024 bytes, it is assumed that the controller calculates the processing delays of node1 to node6 as 12.85us, 13.57us, 14.56us, and 15.03us respectively. There are multiple target management messages, and each target management message has a different packet length, that is, the priority of node node1 is 5, and the packet lengths are 128 bytes, 256 bytes, 512 bytes and 1024 bytes respectively. Each target management message has a different packet length, and the objective function indicates the correspondence between different packet lengths and the processing delays of each node on the path, that is, the priority is 5, and the packet lengths are 128 bytes, 256 bytes, 512 bytes and 1024 bytes, and the corresponding processing delays are 9.83us, 10.23us, 11.11us and 12.85us respectively.

[0059] In S106, the four groups of packet lengths and delay values ​​are fitted, and the functional relationship between the delay and the packet length when the priority is 5 is y = 0.0033x + 9.3684. Similarly, the functional relationship between the delay and the packet length when the priority is 5 fitted by node2 is y = 0.0033x + 10.1476. The functional relationship between the delay and the packet length when the priority is 5 fitted by node3 is y = 0.0033x + 11.1376. The functional relationship between the delay and the packet length when the priority is 5 fitted by node6 is y = 0.0039x + 11.0608.

[0060] In S107, after fitting the functional relationship between the processing delay and packet length of nodes node1-node6 at priority level 5, the controller reads the maximum packet length of the service, 1500 bytes, and substitutes it into the delay-packet length functional relationship of node1-node6. The processing delay of node1 is calculated to be 0.0034*1500+9.3684=14.47us, the processing delay of node2 is 0.0033*1500+10.1476=15.10us, the processing delay of node3 is 0.0033*1500+11.1376=16.09us, and the processing delay of node6 is 0.0039*1500+11.0608=14.47us.

[0061] Afterwards, the upper bound of the maximum delay may be determined in S108.

[0062] Example 2

[0063] Consistent with the topology diagram in Example 1, the delay-packet length function curve for node 6 with a priority of 5 is determined to be y = 0.0039x + 11.0608, which has been fitted in steps S101 to S102. The new service flow to be deployed has a source node of node 4, a destination node of node 6, a priority of 5, and a maximum packet length of 1500 bytes. Nodes 4 and 5 on the queried path do not have a delay-packet length function curve corresponding to priority 5, but node 6 does have a delay-packet length function curve corresponding to priority 5.

[0064] In S103 , a source node node4 and a destination node node5 are selected to configure an OAM message with a priority of 5 and a length of 128 bytes. The OAM message is sent from node node4 to node5 .

[0065] In S104, the timestamps before the ingress and egress queues are recorded at each node. Assume that the timestamps before the ingress and egress queues of node4 recorded in the OAM message are 4.83us and 14.59us respectively, and the timestamps before the ingress and egress queues of node5 are 15.85us and 26.12us respectively. After node5 receives the OAM message, it is uploaded to the controller.

[0066] In S105, the controller calculates the difference between the inbound and outbound timestamps of node4 and node5, assuming the processing delays are 9.76µs and 10.27µs, respectively. Furthermore, an OAM message with a priority of 5 and a packet length of 256 bytes is configured. Assume that the controller calculates the processing delays between node4 and node5 as 10.31µs and 10.65µs, respectively. An OAM message with a priority of 5 and a packet length of 512 bytes is configured. Assume that the controller calculates the processing delays between node4 and node5 as 11.41µs and 111.42µs, respectively. An OAM message with a priority of 5 and a packet length of 1024 bytes is configured. Assume that the controller calculates the processing delays between node4 and node5 as 13.65µs and 12.96µs, respectively. Therefore, the corresponding processing delays for node4 packets with packet lengths of 128 bytes, 256 bytes, 512 bytes, and 1024 bytes are 9.76µs, 10.31µs, 11.41µs, and 13.65µs, respectively.

[0067] In S106, the four groups of packet lengths and delay values ​​are fitted, and the functional relationship between delay and packet length when the priority is 5 is y=0.0043x+9.2096. Similarly, the functional relationship between delay and packet length when the priority is 5 fitted by node5 is y=0.0030x+9.8860.

[0068] In S107, after fitting the functional relationship between the processing delay and packet length of nodes node4-node6 with a priority of 5, the controller reads the maximum packet length of the configured service as 1500 bytes, and substitutes it into the delay-packet length functional relationship of node4-node6. The processing delay of node4 is calculated to be 0.0043*1500+9.2096=15.66us, the processing delay of node5 is 0.0030*1500+9.8860=14.386us, and the processing delay of node6 is 0.0039*1500+11.0608=14.47us.

[0069] In S108 , the processing delay calculated by the node when the maximum packet length is 1500 bytes is input into the network calculation model parameters as the processing delay of the node.

[0070] Furthermore, assuming that in S101 the maximum packet length of the new service is configured to be 1000 bytes, the priority is 5, and the source and destination nodes are node4 and node5, respectively. In S102, the delay-packet length function curves corresponding to priority 5 are found for nodes node4 and node5 on the path. In S107, the packet length of 1000 bytes is directly substituted into the delay-packet length function equations for node4 and node5, respectively. The processing delay for node4 is calculated to be 0.0043*1000+9.2096=13.51us, and the processing delay for node5 is calculated to be 0.0030*1000+9.8860=12.89us.

[0071] Figure 5 is a structural diagram of an apparatus for determining a time delay according to an embodiment of the present application. As shown in Figure 5, the apparatus 500 for determining a time delay includes: an acquisition module 510 for acquiring the maximum packet length, priority, source node, and destination node of the service flow to be deployed. A first determination module 520 is used to determine the path between the source node and the destination node and each node of the path. A second determination module 530 is used to determine the time delay of the service flow to be deployed based on the maximum packet length of the service flow to be deployed and the objective function when there is an objective function corresponding to the priority of the service flow to be deployed on each node of the path. The objective function represents the correspondence between the maximum packet length and the time delay of the service flow to be deployed.

[0072] In one implementation, the second determination module 530 is used to send a target management message to the source node when there is no target function corresponding to the priority of the service flow to be deployed on each node of the path, and the target management message indicates the measurement of processing delay parameters of multiple nodes on the path.

[0073] In one implementation, the second determination module 530 is used to receive the processing delay parameters of each node on the path after sending the target management message to the source node; determine the processing delay of each node on the path based on the processing delay parameters of each node on the path; and determine the objective function corresponding to the priority of the service flow to be deployed at each node on the path based on the correspondence between the target management message packet length and the processing delay of each node on the path.

[0074] In one implementation, the processing delay parameters include: a second timestamp before the target management message enters the egress port queue of any node, a first timestamp when the target management message enters the ingress port of any node, and a second determination module 530, which is used to determine the difference between the second timestamp and the first timestamp as the processing delay of any node.

[0075] In one implementation, there are multiple target management messages, each of which has a different packet length, and the objective function indicates a correspondence between different packet lengths and a processing delay of each node on the path.

[0076] In one implementation, there are multiple target management messages, each of which has a different priority, and the objective function indicates a correspondence between different priorities and a processing delay of each node on the path.

[0077] In one implementation, the target management message includes an operation and maintenance management message.

[0078] In one implementation, the second determining module 530 is configured to determine an upper bound of the maximum end-to-end delay of the service flow to be deployed based on the delay of the service flow to be deployed after determining the delay of the service flow to be deployed.

[0079] The device for determining the time delay in the embodiments of the present application can be a device, a device or electronic device with an operating system, or a component, integrated circuit, or chip in a terminal. The device or electronic device can be a mobile electronic device or a non-mobile electronic device. For example, the mobile electronic device can be a mobile phone, a tablet computer, a laptop computer, a PDA, an in-vehicle electronic device, a wearable device, an ultra-mobile personal computer (UMPC), a netbook, or a personal digital assistant (PDA), etc. The non-mobile electronic device can be a server, a network attached storage (NAS), a personal computer (PC), a television (TV), a teller machine, or a self-service machine, etc., and the embodiments of the present application do not specifically limit this.

[0080] According to the device 500 of the embodiment of the present application, the process of the method corresponding to the embodiment of Figures 1-2 of the present application can be referred to, and the various units / modules in the device 500 and the above-mentioned other operations and / or functions are respectively for implementing the corresponding processes in the method of Figures 1-2, and can achieve the same or equivalent technical effects. For the sake of brevity, they will not be repeated here.

[0081] In one example, as shown in FIG6 , an embodiment of the present application further provides a communication device 600, comprising a processor 601, a memory 602, and a program or instruction stored in the memory 602 and executable on the processor 601. For example, when the communication device 600 is a terminal, the program or instruction, when executed by the processor 601, implements the various processes of the above-mentioned method embodiment for determining the time delay and can achieve the same technical effect. When the communication device 600 is a network-side device, the program or instruction, when executed by the processor 601, implements the various processes of the above-mentioned method embodiment for determining the time delay and can achieve the same technical effect. To avoid repetition, they will not be described here.

[0082] An embodiment of the present application also provides a readable storage medium, on which a program or instruction is stored. When the program or instruction is executed by a processor, the various processes of the above-mentioned method embodiment for determining the delay are implemented, and the same technical effect can be achieved. To avoid repetition, it will not be repeated here.

[0083] The processor is the processor in the electronic device described in the above embodiment. The readable storage medium includes a computer-readable storage medium, such as a computer read-only memory (ROM), random access memory (RAM), a magnetic disk, or an optical disk.

[0084] An embodiment of the present application further provides a chip, which includes a processor and a communication interface, wherein the communication interface is coupled to the processor, and the processor is used to run programs or instructions to implement the various processes of the above-mentioned method embodiment for determining the delay, and can achieve the same technical effect. To avoid repetition, it will not be repeated here.

[0085] It should be understood that the chip mentioned in the embodiments of the present application can also be called a system-level chip, a system chip, a chip system or a system-on-chip chip, etc.

[0086] An embodiment of the present application further provides a computer program product, which includes a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the method described in the first aspect.

[0087] It should be noted that, in this article, the terms "comprise", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device comprising a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the presence of other identical elements in the process, method, article or device comprising the element. In addition, it should be noted that the scope of the methods and devices in the embodiments of the present application is not limited to performing functions in the order shown or discussed, and may also include performing functions in a substantially simultaneous manner or in the opposite order according to the functions involved. For example, the described method may be performed in an order different from that described, and various steps may also be added, omitted, or combined. In addition, the features described with reference to certain examples may be combined in other examples.

[0088] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus the necessary general hardware platform, and of course can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of the present application is essentially or the part that contributes to the prior art can be embodied in the form of a computer software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), including a number of instructions for enabling a terminal (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods described in each embodiment of the present application.

[0089] The embodiments of the present application are described above in conjunction with the accompanying drawings, but the present application is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the guidance of this application, ordinary technicians in this field can also make many forms without departing from the purpose of this application and the scope of protection of the claims, all of which are within the protection of this application.

Claims

1. A method for determining a delay, the method comprising: Get the maximum packet length, priority, source node, and destination node of the service flow to be deployed; Determine a path between the source node and the destination node and each node of the path; When there is an objective function corresponding to the priority of the business flow to be deployed on each node of the path, the delay of the business flow to be deployed is determined according to the maximum packet length of the business flow to be deployed and the objective function, and the objective function represents the correspondence between the maximum packet length and the delay of the business flow to be deployed.

2. The method of claim 1, wherein: The method further comprises: In the case that there is no objective function corresponding to the priority of the service flow to be deployed on each node of the path, a target management message is sent to the source node, where the target management message indicates measuring processing delay parameters of multiple nodes on the path.

3. The method of claim 2, wherein: After sending the target management message to the source node, the method further includes: receiving a processing delay parameter of each node on the path; Determining the processing delay of each node on the path according to the processing delay parameter of each node on the path; According to the correspondence between the target management message packet length and the processing delay of each node on the path, the target function corresponding to the priority of the service flow to be deployed on each node of the path is determined.

4. The method of claim 3, wherein: The processing delay parameter includes: a second timestamp before the target management message enters the egress port queue of any node, and a first timestamp when the target management message enters the ingress port of any node. According to the processing delay parameter of each node on the path, determining the processing delay of each node on the path includes: The processing delay of any one of the nodes is determined according to the difference between the second timestamp and the first timestamp.

5. The method of claim 2, wherein: There are multiple target management messages, each of which has a different packet length, and the target function indicates the corresponding relationship between different packet lengths and the processing delay of each node on the path.

6. The method of claim 2, wherein: There are multiple target management messages, each of which has a different priority, and the objective function indicates the corresponding relationship between the different priorities and the processing delay of each node on the path.

7. The method of claim 2, wherein: The target management message includes an operation and maintenance management message.

8. The method of claim 1, wherein: After determining the delay of the service flow to be deployed, the method further includes: According to the delay of the service flow to be deployed, an upper bound of the end-to-end maximum delay of the service flow to be deployed is determined.

9. A network device, comprising a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the method for determining a delay as described in any one of claims 1 to 8.

10. A readable storage medium storing a program or an instruction, wherein the program or the instruction, when executed by a processor, implements the steps of the method for determining a delay according to any one of claims 1 to 8.

Images