Network delay in-band telemetry method and apparatus, electronic device, and storage medium
Through the link layer discovery protocol and minimum vertex coverage algorithm, the detection path and the deployment of probe equipment are built, which solves the problem of network delay measurement under the distributed Internet architecture, realizes efficient and accurate global network delay measurement, and improves the network Real-time perception of state.
Patent Information
- Application Number
- PCT/CN2024/090674
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-05-06
- Filing Date
- 2024-04-29
- Publication Date
- 2024-11-14
AI Technical Summary
Under the distributed Internet architecture, traditional network measurement methods are difficult to achieve efficient and accurate network delay measurement, especially in the case of complex network structure and surge in data traffic. How to deploy in-band network telemetry to complete global network delay Accurate measurement has become an urgent problem.
The link layer discovery protocol obtains the whole network topology information, establishes a mathematical model, and simplifies the model based on the minimum vertex coverage algorithm, constructs a set of detection paths, deploys probe devices, sends probe packets along the detection path, and controls network devices to add information fields. Extract and calculate link delay information, and update link delay information across the entire network.
The deployment location and detection path of network measurement terminals are optimized, the real-time and accuracy of network delay measurement is enhanced, the time-consuming and overhead of traditional methods is reduced, and the perception ability of network state is improved.
Smart Images

Figure CN2024090674_14112024_PF_FP_ABST
Abstract
Description
Network delay in-band telemetry method, device, electronic device and storage medium
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application is based on the Chinese patent application with application number 202310500422.4 and application date May 6, 2023, and claims the priority of the Chinese patent application. The entire content of the Chinese patent application is hereby introduced into this application as a reference. Technical Field
[0003] The embodiments of the present invention relate to the field of network delay measurement, and in particular to a method, device, electronic device and storage medium for in-band telemetry of network delay. Background Art
[0004] With the rapid development of the internet and the continuous increase in global internet users, internet data traffic is rapidly increasing due to the rapid increase in users and increasing user demands. The massive size, complex equipment, and diverse protocols have made the internet bloated and massive. The tightly coupled control logic and data plane of the traditional internet under a distributed architecture pose significant challenges to internet network developers and managers, making network transmission and configuration optimization more difficult. Network transmission management is closely related to the timely perception and accurate measurement of network status. With the surge in traffic and the increasing complexity of network structure configuration, the distributed architecture of traditional internetworks and the tight coupling between traditional switch hardware and control logic have made it increasingly difficult to obtain network status using traditional network measurement methods. Therefore, the development of efficient and accurate network telemetry technology is of great significance.
[0005] In recent years, software-defined networking (SDN) and programmable data plane (PDP) technologies have developed rapidly, becoming a new technological pillar for network telemetry. The SDN architecture separates the control and data planes, which are tightly coupled to network devices in traditional networks. The control plane is moved to the network controller, leaving only the data plane in the network's switching devices. The control plane controls the data plane by issuing flow table rules to the data plane switches using the OpenFlow protocol. Data plane programmability provides users with programmable data plane capabilities. Programmable switches allow for programmable processing of network packets during transmission. The software-defined networking architecture overcomes the rigidity of the traditional tight coupling of control and forwarding. Centralized control provides a global view and centralized management of the network. Data plane programmability frees up data plane hardware, providing a protocol-agnostic forwarding architecture and unleashing powerful processing capabilities within the data plane. The combination of software-defined networking and data plane programmability brings greater flexibility to large-scale network status telemetry.
[0006] In-band network telemetry (INT) technology leverages software-defined networking (SDN) and data plane programmability. During packet forwarding, the data packet carries the corresponding network device parameters at each hop. At the receiving terminal, these parameters are extracted, and network status information along the forwarding path is calculated and submitted to the network controller. Network latency, as a key indicator of network status information, requires accurate INT measurement. Deploying in-band network telemetry to accurately measure global network latency has become a pressing issue.
[0007] Summary of the Invention
[0008] In view of this, in order to solve the above technical problems or part of the technical problems, the embodiments of the present invention provide a network delay in-band telemetry method, device, electronic device and storage medium.
[0009] In a first aspect, an embodiment of the present invention provides a method for in-band telemetry of network latency, comprising:
[0010] Obtaining network-wide topology information through a link layer discovery protocol, establishing a network-wide topology view, and attempting to establish a mathematical model for network-wide latency measurement based on the network-wide topology;
[0011] Simplifying the mathematical model based on a minimum vertex cover algorithm, and estimating a minimum vertex cover set of the entire network topology view based on the simplified mathematical model;
[0012] Constructing a set of detection paths that meet preset conditions based on the minimum vertex cover set, and deploying a set of probe devices based on the minimum vertex cover set;
[0013] Mount a probe host on each device in the probe device set, and send probe packets along a detection path starting from the probe device in the detection path set;
[0014] Control all network forwarding devices to add multiple information fields to the probe packet during the process of sending and / or forwarding the probe packet;
[0015] When each probe device receives a probe packet with itself as the destination, it extracts multiple information fields in the probe packet and calculates link delay information on the probe packet path based on the multiple information fields;
[0016] Based on the link delay information of each probe device, the link delay information of the entire network is updated.
[0017] In one possible implementation, the method further includes:
[0018] The topology of the entire network is modeled as a full network topology view, with network switching devices and terminals as vertices in the graph and network links as undirected edges in the graph;
[0019] Based on the full network topology view, an in-band network telemetry method is used to detect all paths, and the time efficiency and cost of detecting all paths are obtained;
[0020] Based on all the paths, the time efficiency and the overhead of detecting all the paths, a mathematical model for the whole network delay measurement problem is established.
[0021] In one possible implementation, the method further includes:
[0022] Calculating the degree of association of each vertex-to-edge pair based on the full network topology view, and selecting vertex-to-edge pairs with an association degree greater than a preset threshold for coverage based on a minimum vertex cover algorithm;
[0023] Recalculate the degree of association of the uncovered edges of each vertex, and repeat the step of selecting vertex pairs with an association degree greater than a preset threshold to cover the edges based on the minimum vertex cover algorithm until all edges in the graph are covered, thereby obtaining the minimum vertex cover set of the entire network topology view.
[0024] In one possible implementation, the method further includes:
[0025] The probe host sends the probe packet along the detection path starting from the probe device in the minimum vertex cover set in a source routing manner;
[0026] The probe packets destined for each probe device are obtained and forwarded to the detection terminals connected to each probe device.
[0027] In one possible implementation, the method further includes:
[0028] The difference between the probe packet arrival time marked at the first probe device of a certain hop and the probe packet arrival time marked at the second probe device of the previous hop is used as the link delay between the first probe device and the second probe device;
[0029] The difference between the probe packet arrival time marked at the first probe device of a certain hop and the probe packet sending time marked at the second probe device of the previous hop is used as the propagation delay of the link between the first probe device and the second probe device.
[0030] In one possible implementation, the method further includes:
[0031] Regularly obtain the link delay information reported by each probe device and update the link delay information of the entire network based on the reported link delay information.
[0032] In one possible implementation, the method further includes:
[0033] A plurality of information fields are added to the probe packet through a programmable switch, wherein the plurality of information fields at least include packet arrival time, receiving port, packet sending time, sending port, and own device number.
[0034] In a second aspect, an embodiment of the present invention provides a network delay in-band telemetry device, comprising:
[0035] An establishment part is configured to obtain network-wide topology information through a link layer discovery protocol, establish a network-wide topology view, and attempt to establish a mathematical model for the network-wide delay measurement problem based on the network-wide topology;
[0036] A simplification part is configured to simplify the mathematical model based on a minimum vertex cover algorithm, and estimate a minimum vertex cover set of the entire network topology view based on the simplified mathematical model;
[0037] A deployment part is configured to construct a set of detection paths that meet preset conditions based on the minimum vertex cover set, and deploy a set of probe devices based on the minimum vertex cover set;
[0038] The detection part is configured to mount a probe host on each device in the probe device set and send probe packets along a detection path in the detection path set that takes the probe device as a starting point;
[0039] an adding part configured to control all network forwarding devices to add a plurality of information fields to the probe packet during the process of sending and / or forwarding the probe packet;
[0040] The acquisition part is configured to obtain, when each probe device receives a probe packet with itself as the destination, extract multiple information fields in the probe packet, and calculate the link delay information on the probe packet path based on the multiple information fields;
[0041] The update module is used to update the link delay information of the entire network based on the link delay information of each probe device.
[0042] In a third aspect, an embodiment of the present invention provides an electronic device, comprising: a processor and a memory, wherein the processor is used to execute a network delay in-band telemetry program stored in the memory to implement the network delay in-band telemetry method described in the first aspect above.
[0043] In a fourth aspect, an embodiment of the present invention provides a storage medium, comprising: the storage medium stores one or more programs, and the one or more programs can be executed by one or more processors to implement the network delay in-band telemetry method described in the first aspect above.
[0044] The network delay in-band telemetry solution provided by the embodiment of the present invention obtains the whole network topology information through the link layer discovery protocol, establishes the whole network topology view, and attempts to establish a mathematical model for the whole network delay measurement problem based on the whole network topology; simplifies the mathematical model based on the minimum vertex cover algorithm, and estimates the minimum vertex cover set of the whole network topology view based on the simplified mathematical model; constructs a detection path set that meets preset conditions based on the minimum vertex cover set, and deploys a probe device set based on the minimum vertex cover set; mounts a probe host on each device in the probe device set, and sends probe packets along the detection path starting from the probe device in the detection path set; controls all network forwarding devices to add multiple information fields to the probe packet during the process of sending and / or forwarding the probe packet; obtains each probe device when receiving a probe packet with itself as the destination, extracts multiple information fields in the probe packet, and calculates the link delay information on the probe packet path based on the multiple information fields; updates the whole network link delay information based on the link delay information of each probe device. This solution uses the minimum vertex cover algorithm to optimize the deployment locations of measurement terminals in the network and reconstruct the set of detection paths in the network, thereby planning the network measurement solution for in-band telemetry and enhancing the real-time performance and accuracy of network delay measurement. BRIEF DESCRIPTION OF THE DRAWINGS
[0045] FIG1 is a flow chart of a method for in-band telemetry of network delay provided by an embodiment of the present invention;
[0046] FIG2 is a flow chart of a heuristic algorithm for finding a minimum vertex cover set provided by an embodiment of the present invention;
[0047] FIG3 is a flow chart of an algorithm for constructing a detection path set provided by an embodiment of the present invention;
[0048] FIG4 is a flowchart of a whole-network link delay measurement process provided by an embodiment of the present invention;
[0049] FIG5 is a diagram showing the relationship between the scale of a random topology graph and the time required for measuring link delay across the entire network, provided by an embodiment of the present invention;
[0050] FIG6 is a diagram showing the relationship between the scale of a random topology graph and the overall network link delay measurement overhead provided by an embodiment of the present invention;
[0051] FIG7 is a schematic structural diagram of a network delay in-band telemetry device provided by an embodiment of the present invention;
[0052] FIG8 is a schematic structural diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0053] To make the objectives, technical solutions, and advantages of the embodiments of the present invention more clear, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative efforts shall fall within the scope of protection of the present invention.
[0054] To facilitate understanding of the embodiments of the present invention, specific embodiments will be further explained below with reference to the accompanying drawings. The embodiments do not limit the embodiments of the present invention.
[0055] FIG1 is a flow chart of a method for in-band telemetry of network delay provided by an embodiment of the present invention. As shown in FIG1 , the method specifically includes:
[0056] S11. Obtain the network-wide topology information through the link layer discovery protocol, establish a network-wide topology view, and attempt to establish a mathematical model for the network-wide delay measurement problem based on the network-wide topology.
[0057] In an embodiment of the present invention, an in-band telemetry simulation system for the entire network link delay is constructed based on an Open Network Operating System (ONOS) controller and a Mininet (Mininet) simulation software platform, and a telemetry main program is deployed on a minimum vertex cover set by mounting a probe host.
[0058] Specifically, the entire network topology is modeled as an undirected simple connected graph, with network switches and terminals as vertices and network links as undirected edges. Devices that use probe packets for network latency detection are defined as probe devices. In-band telemetry, some devices are selected as probe devices, corresponding to some vertices in the network. Furthermore, when referring to edges in the network and their corresponding links, or devices in the network and their corresponding nodes, no distinction is made.
[0059] The network is modeled as a simple undirected graph G(V,E), where V = {v1,v2,...,v n} is the vertex set of the graph, E={e1,e2,...,e m} is the edge set of the graph. Using in-band network telemetry to detect in the network, the forwarding path of the probe packet is defined as a detection path. A detection path can be represented as a path in the network graph model path = {v0, e0, v1, e1, ..., v k-1 ,e k-1 ,v k}, where e i The two endpoints are v i and v i+1 , i∈{0,1,2,...,k-1}. The number of edges on a probe path defines its length. According to the definition of a probe path, both the starting and ending vertices of the probe path are probe devices. The following introduces some symbols and terminology, and models the problem of in-band telemetry for network-wide latency.
[0060] For an edge e in the network i , if e i ∈path, then the detection path path is said to cover e i .e i Covered by path means that probing the path will get e i In order to measure the delay of each link in the entire network, it is necessary to find a set of detection paths in the network S = {path i |i=1,2,...,l}, so that every edge in the network is covered by a detection path in S, that is, Make path j Cover i .
[0061] First, we measure the timeliness of in-band telemetry. Let edge e α The propagation delay is τ α , node v α The queuing and processing delay at αSince the probe traffic is small and the sending delay is ignored, the in-band network telemetry is used to check the path i ={v0,e0,...,v k-1 ,e k-1 ,v k The time required to perform a delay detection is:
[0062] Where τ α ,κ α >0, it can be seen that the real-time performance of in-band telemetry is significantly negatively correlated with the detection path length.
[0063] For the selection S={path i |i=1,2,...,l}, the detection on all detection paths is carried out in parallel, then the time required to detect the link delay of the entire network is: T max =max{T i |i=1,2,...,l} (2)
[0064] Where T i Indicates that the path in S is monitored using in-band network telemetry. j The time consumed for in-band telemetry. The selection of S must ensure that the detection path length is not too large, so that T max It is within a reasonable range to ensure the real-time and accuracy of in-band telemetry.
[0065] Secondly, the cost of in-band telemetry is measured. The additional cost of in-band telemetry is mainly divided into two parts: the deployment cost of the probe device and the additional cost caused by repeated link measurements. Assuming that the average deployment cost of the probe device is c, select S = {path i |i=1,2,...,l}, let V0 be the set of probe devices that need to be deployed, that is:
[0066] The total cost of deploying probe devices is proportional to the total number of deployed probe devices: Cost deploy =c×|V0| (4)
[0067] Let the average cost of transmitting a single probe packet on an edge be d, and let m0 be the sum of the path lengths in S, that is: m0 = Σ path∈S length(path) (5)
[0068] The link repetition rate is:
[0069] The total cost of link repeated detection is: Cost redundant =λ×d×|E| (7)
[0070] In practice, due to the small amount of probe traffic, d is usually small. When the link repetition rate λ is not very large, the overhead caused by link repeated measurement is often small compared to the probe device deployment overhead.
[0071] In summary, the problem of in-band telemetry of the entire network delay can be abstractly described as: finding a set of detection paths S = {path i |i=1,2,l., so that for There is a path j e i Cover and minimize the following indicators:
[0072] 1)T max =max{T i |i=1,2,...,l}
[0073] 2) Cost deploy =c×|V0|
[0074] 3) Cost redundant =λ×d×|E|.
[0075] S12. Simplify the mathematical model based on the minimum vertex cover algorithm, and estimate the minimum vertex cover set of the entire network topology view based on the simplified mathematical model.
[0076] To simplify the mathematical model of the in-band telemetry problem of the entire network delay, we can use the minimum vertex cover algorithm based on the degree of association, give priority to covering the edges with vertices with a large degree of association, and estimate the minimum vertex cover set V″ of the network topology G(V,E) through multiple rounds of iterative addition.
[0077] Specifically, the network-wide in-band delay telemetry problem modeled above is a multi-objective combinatorial optimization problem. The three objectives are mutually constrained, making it difficult to directly find the optimal solution to this combinatorial optimization problem. Furthermore, in practice, the measurement of some indicators is influenced by the subjective utility of network managers, so obtaining an absolutely optimal solution is not very meaningful. Therefore, the embodiments of the present invention comprehensively weigh the importance of the three objectives, making trade-offs among them and finding a satisfactory solution within the acceptable range of each indicator.
[0078] Since the time consumption of in-band telemetry is directly related to the accuracy and availability of the measurement results, the time consumption of detecting the link delay of the entire network is T max It is the most important indicator and needs to be guaranteed first to ensure T maxThe key is to ensure that the maximum length of the detection path is small. Secondly, because the probe traffic is small in actual situations, when the repetition rate of link coverage is not very large, the overhead caused by repeated link measurements is small. Therefore, it is necessary to optimize the deployment overhead of the probe equipment while ensuring that the link repetition rate is within a reasonable range, that is, to optimize the number of deployed probe devices. In summary, the embodiment of the present invention transforms the above problem into solving the minimum point coverage problem and constructs the optimal detection path set S.
[0079] For a vertex v and an edge e in an undirected graph G(V,E), if e is associated with v, then edge e is said to be covered by vertex v. If for If edge e is covered by vertex v, then V′ is called a vertex cover of graph G(V,E). is a point cover of the graph G(V,E), and for any point cover of G(V,E) If |V″| ≤ |V′|, then V″ is called a minimum vertex cover of the graph G(V,E). For general graphs, there is no efficient algorithm that can find the optimal solution to the minimum vertex cover problem. In fact, the minimum vertex cover problem is one of Karp's famous 21 NP-complete problems. Currently, algorithms that can guarantee the efficiency of solving the minimum subversion problem are all heuristic algorithms. Next, we will first explain some terms and symbols, and then describe the heuristic algorithm of the present invention.
[0080] For an undirected graph G(V,E), E(G) represents the set of edges of G, that is, E(G) == E. V(G) represents the set of vertices of G, that is, V(G) == V. Let is the set of points in graph G, then E G (V′) represents the set of edges in graph G associated with vertices in V′. GV′ represents the graph G minus vertices in V′ and E G The graph obtained after adding the edges in (V′), that is, GV′==(VV′,E- G E(′V). Let path = {v0e 01 v...v 1k-1 e k-}v k is a path in graph G, then G-path represents the graph obtained by removing the edges in path from graph G, that is, G-path == (V, EE(path)).
[0081] For an edge e=(v0,v1) in an undirected graph G(V,E), if v0≠v1, then vertex v0 is said to be adjacent to vertex v1. For a vertex v∈V, the set of points in V adjacent to v is called the domain of vertex v in graph G, denoted by NG (v), namely: N G (v)={w∈V|w≠v and (v,w)∈E} (8)
[0082] For a vertex v∈V in an undirected graph G(V,E), the degree of association of v is defined as the sum of the degrees of all points adjacent to v, plus the degree of v itself. The degree of association of v is recorded as D(v), then
[0083] Furthermore, the heuristic algorithm based on the degree of association of an embodiment of the present invention is described. In each iteration of the minimum point cover algorithm based on the degree of association, vertices with a high degree of association are preferentially selected to cover edges, and it is ensured that no adjacent points are added to the point cover set in the same iteration. At the end of each iteration, the covered edges are deleted from the graph, and the degree of association is recalculated for the next iteration until all edges in the graph are covered, and the vertex cover set is output. The steps of the minimum point cover algorithm based on the degree of association are as follows:
[0084] 1) Initialize graph G′=G, Vertex access mark: Initialize graph G′=G, initialize vertex cover set Initialize the visit flag of each vertex visited(w) = false,
[0085] 2) If The algorithm ends and outputs the vertex cover set V″.
[0086] 3) Otherwise, recalculate the vertex association degree D(w) in G′,
[0087] 4) Delete vertices with an association degree of 0 from the graph G′, that is, G′=G′-{w∈V(G′)|D(w)==0}.
[0088] 5) Select the unvisited vertex v with the largest degree of association in G′ and visit v: V″={v}∪ V ″. Select v∈V(G′), visited(v)==false, st
[0089] D(v) == max{D(w)|w∈V(G′) and visited(w) == false}. Set visited(v) = true and let V″ = {v}∪V″.
[0090] 6) Access the fields of v: For Set visited(w)=true.
[0091] 7) Delete vertex v from G′: G′=G′-{v}.
[0092] 8) Are there any unvisited vertices in G′?
[0093] if Go to 4).
[0094] 9) Reset the visit flags of all nodes in G': visited(w) = false, Go to 2).
[0095] In summary, the heuristic algorithm flow for finding the minimum vertex cover set is shown in Figure 2.
[0096] S13. Construct a set of detection paths that meet preset conditions based on the minimum vertex cover set, and deploy a set of probe devices based on the minimum vertex cover set.
[0097] According to the minimum vertex cover set V″ of the network topology G(V,E), the optimal detection path set S is constructed. A minimum vertex cover set of the network G(V,E) of V″ has been obtained. The algorithm for constructing the detection path in S is as follows:
[0098] 1) Initialize the graph G′=G, initialize
[0099] 2) If The algorithm ends.
[0100] 3) Otherwise, take any edge e0=(v0,v1) in E(G′), where v0∈V″.
[0101] Pick According to the definition of the minimum vertex cover set, one of the endpoints of e0 is v0∈V″, and the other endpoint of e0 is denoted as v1.
[0102] 4) If v1∈V″, let path=v0e0v1, go to 7).
[0103] 5) Otherwise, if deg(v1)=1, set path=v0e0v1e0v0, go to 7).
[0104] 6) Otherwise, take any edge e1 connected to v1 = (v1, v2), where v1 ≠ v2, and let path = v0e0v1e1v2.
[0105] Take any edge e1 connected to v1 (e1≠e0), according to the definition of the minimum vertex cover set, e1 is covered by a vertex v2 in V″, because Then v2≠v1. Let path=v0e0v1e1v2.
[0106] 7) Let S = S∪{path}, G′ = G′-path, and go to 2).
[0107] In summary, the algorithm flow for reconstructing the optimal detection path set S based on the minimum vertex cover set is shown in Figure 3.
[0108] The following describes the excellent properties of the optimal detection path set S constructed above. First, for any detection path path∈S, length(path)≤2, so the maximum path length in S is ≤2, and the time required to detect the link delay of the entire network is T max The smaller the value, the higher the measurement accuracy. Secondly, the link repetition rate λ of the detection path path ≤1, there is no link overlap in different detection paths, so the global link repetition rate λ≤1. Since the probe traffic is small, d is usually small, and the additional cost of link repeated detection is Cost redundant ≤d×|E| is smaller. Finally, since the set V0 of probe devices that need to be deployed is exactly the minimum vertex cover set V″, after first ensuring the target T max Under the premise of optimizing and maintaining a small link repetition rate, the minimum vertex cover set ensures the optimization of the number of deployed probe devices and reduces the probe device deployment cost. deploy .
[0109] S14: Mount a probe host on each device in the probe device set, and send a probe packet along a detection path in the detection path set that starts with the probe device.
[0110] Mount the probe host to the network device in the probe device cluster. Each probe host is mounted to a probe device v∈V and uses source routing to send probe packets along the probe path starting from v in S. For each probe path in S, path=ve0...v k-1 e k-1 v k , defined by the detection path, v k It is also a probe device. The probe packet generated by the probe host mounted by v is source routed along the path v→v1→...→v k-1 →v k Each probe device v provides a default route to forward all probe packets with v as the destination to the probe terminal under v.
[0111] S15. Control all network forwarding devices to add multiple information fields to the probe packet during the process of sending and / or forwarding the probe packet.
[0112] In an embodiment of the present invention, all network forwarding devices add information fields such as packet arrival time, receiving port, packet sending time, sending port, and own device number to the probe packet through a programmable switch during the process of sending and / or forwarding the probe packet.
[0113] S16 , when each probe device receives a probe packet destined for itself, extracts multiple information fields from the probe packet, and calculates link delay information on the probe packet path based on the multiple information fields.
[0114] Any probe device receives a probe packet with itself as the destination, extracts the information field in the probe packet, and calculates the link delay on the probe packet path. Specifically, assuming that a certain hop v i The arrival time of the probe packet marked at is t i , previous hop v i-1 The arrival time of the probe packet marked at is t i-1 , the sending time is t′ i-1 , then the link e=(v i-1 ,v i ) is τ=t i -t i-1 , the propagation delay is τ′=t i -t′ i-1 After receiving and processing some probe packets, the probe host reports the collected link delay information to the controller.
[0115] S17. Based on the link delay information of each probe device, update the link delay information of the entire network.
[0116] The controller obtains the link delay reports submitted regularly by the probe devices and updates and summarizes the global network link delay information.
[0117] In summary, the entire processing flow of in-band telemetry of link delay in the entire network is shown in Figure 4. The entire processing flow of in-band telemetry of link delay in the entire network includes: obtaining the topology information of the entire network to establish a problem model; simplifying the problem model to calculate the maximum vertex cover V″; constructing a detection path set S according to V″ and generating a measurement strategy; the probe device sends a probe packet along the detection path; each hop forwarding device adds measurement information to the probe packet header; the probe device receives the probe packet, calculates the link delay of the packet path, and reports it to the controller; the controller collects and summarizes the delay report to complete the measurement.
[0118] Figure 5 shows the relationship between the size of a random topology graph and the time required to measure link delay across the entire network. As the total number of random topology vertices increases, the time required to perform a single measurement of link delay across the entire network using the method of the present invention gradually increases. As the network scale increases further, the time required to perform a single full-network link delay measurement using the method of the present invention is superior to the traditional method of measuring link-by-link round-trip delays. As the scale of the network topology continues to grow, the advantages of the method of the present invention become even more pronounced.
[0119] Figure 6 shows the relationship between random topology scale and network-wide link delay measurement overhead. Since the link duplication coverage ratio λ of the method according to the present invention is ≤ 1, while the link duplication coverage ratio of the traditional method is 1, the traffic overhead of the method according to the present invention is consistently superior to that of the traditional method. Furthermore, the method according to the present invention interacts less with the control plane, resulting in less overhead associated with frequent interactions between the data plane and the control plane.
[0120] By comparing the relationship between measurement delay and measurement overhead, the embodiment of the present invention can quickly and accurately measure the link delay of the entire network. A single full-network link delay measurement is faster than traditional methods and requires less traffic overhead than traditional methods.
[0121] The network delay in-band telemetry method provided by the embodiment of the present invention obtains the whole network topology information through the link layer discovery protocol, establishes the whole network topology view, and attempts to establish a mathematical model for the whole network delay measurement problem based on the whole network topology; simplifies the mathematical model based on the minimum vertex cover algorithm, and estimates the minimum vertex cover set of the whole network topology view based on the simplified mathematical model; constructs a detection path set that meets the preset conditions based on the minimum vertex cover set, and deploys a probe device set based on the minimum vertex cover set; mounts a probe host on each device in the probe device set, and sends probe packets along the detection path starting from the probe device in the detection path set; controls all network forwarding devices to add multiple information fields to the probe packet during the process of sending and / or forwarding the probe packet; obtains each probe device when receiving a probe packet with itself as the destination, extracts multiple information fields in the probe packet, and calculates the link delay information on the probe packet path based on the multiple information fields; updates the whole network link delay information based on the link delay information of each probe device. This method uses the minimum vertex cover algorithm to optimize the deployment location of measurement terminals in the network and reconstruct the set of detection paths in the network, thereby planning the network measurement scheme for in-band telemetry and enhancing the real-time performance and accuracy of network delay measurement.
[0122] FIG7 shows a schematic diagram of the structure of a network delay in-band telemetry device according to an embodiment of the present invention. As shown in FIG7 , the device includes:
[0123] Establishment section 701 is configured to obtain network-wide topology information through a link layer discovery protocol, establish a network-wide topology view, and attempt to establish a mathematical model for the network-wide latency measurement problem based on the network-wide topology. For detailed descriptions, please refer to the corresponding descriptions of the above method embodiments and will not be repeated here.
[0124] The simplification part 702 is configured to simplify the mathematical model based on the minimum vertex cover algorithm and estimate the minimum vertex cover set of the entire network topology view based on the simplified mathematical model. Detailed descriptions can be found in the corresponding descriptions of the above method embodiments, which will not be repeated here.
[0125] The deployment part 703 is configured to construct a set of detection paths that meet preset conditions based on the minimum vertex cover set, and deploy a set of probe devices based on the minimum vertex cover set. Detailed descriptions refer to the corresponding descriptions of the above method embodiments, which will not be repeated here.
[0126] The detection part 704 is configured to mount a probe host on each device in the probe device set and send probe packets along the detection path in the detection path set starting from the probe device. Detailed descriptions refer to the corresponding descriptions of the above method embodiments, which will not be repeated here.
[0127] The adding part 705 is configured to control all network forwarding devices to add multiple information fields to the probe packet during the process of sending and / or forwarding the probe packet. Detailed descriptions refer to the corresponding descriptions of the above method embodiments, which will not be repeated here.
[0128] Acquisition section 706 is configured to obtain information about each probe device when it receives a probe packet destined for itself, extract multiple information fields from the probe packet, and calculate link delay information along the probe packet path based on the multiple information fields. For detailed descriptions, please refer to the corresponding description of the above method embodiment and will not be repeated here.
[0129] The updating part 707 is configured to update the link delay information of the entire network based on the link delay information of each probe device. Detailed descriptions refer to the corresponding descriptions of the above method embodiments, which will not be repeated here.
[0130] The network delay in-band telemetry device provided in an embodiment of the present invention is used to execute the network delay in-band telemetry method provided in the above embodiment. Its implementation method and principle are the same. For details, please refer to the relevant description of the above method embodiment and will not be repeated here.
[0131] In some embodiments, the establishment part 701 is further configured to model the topology of the entire network as a full network topology view, with network switching devices and terminals as vertices in the graph and network links as undirected edges in the graph; based on the full network topology view, an in-band network telemetry method is used to detect all paths, and the time efficiency and cost of detecting all paths are obtained; based on all paths, the time efficiency and cost of detecting all paths, a mathematical model for the full network delay measurement problem is established,
[0132] In some embodiments, the simplification part 702 is also configured to calculate the degree of association of each vertex pair of edges based on the full network topology view, and select vertex pairs of edges with a degree of association greater than a preset threshold for coverage based on the minimum vertex cover algorithm; recalculate the degree of association of each uncovered edge of each vertex, and repeat the step of selecting vertex pairs of edges with a degree of association greater than a preset threshold for coverage based on the minimum vertex cover algorithm until all edges in the graph are covered, thereby obtaining the minimum vertex cover set of the full network topology view.
[0133] In some embodiments, the detection part 704 is also configured so that the probe host sends probe packets along the detection path starting from the probe device in the minimum vertex cover set using source routing; obtains probe packets with each probe device as the destination and forwards them to the detection terminal under each probe device.
[0134] In some embodiments, the acquisition part 706 is also configured to use the difference between the arrival time of the probe packet marked at the first probe device of a certain hop and the arrival time of the probe packet marked at the second probe device of the previous hop as the link delay between the first probe device and the second probe device; and use the difference between the arrival time of the probe packet marked at the first probe device of a certain hop and the sending time of the probe packet marked at the second probe device of the previous hop as the propagation delay of the link between the first probe device and the second probe device.
[0135] In some embodiments, the updating part 707 is further configured to periodically obtain link delay information reported by each probe device, and update the link delay information of the entire network based on the reported link delay information.
[0136] In some embodiments, the acquisition part 706 is further configured to add multiple information fields to the probe packet through a programmable switch, wherein the multiple information fields include at least packet arrival time, receiving port, packet sending time, sending port, and its own device number.
[0137] FIG8 shows an electronic device according to an embodiment of the present invention. As shown in FIG8 , the electronic device may include a processor 801 and a memory 802 , wherein the processor 801 and the memory 802 may be connected via a bus or other means. FIG8 takes the connection via a bus as an example.
[0138] The processor 801 may be a central processing unit (CPU). The processor 801 may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or a combination of the above chips.
[0139] Memory 802, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as the program instructions / modules corresponding to the methods provided in the embodiments of the present invention. Processor 801 executes the non-transitory software programs, instructions, and modules stored in memory 802 to perform various processor functions and data processing, thereby implementing the methods in the above-mentioned method embodiments.
[0140] The memory 802 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and application programs required for at least one function; the data storage area may store data created by the processor 801, etc. In addition, the memory 802 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some embodiments, the memory 802 may optionally include a memory remotely located relative to the processor 801, and these remote memories may be connected to the processor 801 via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0141] One or more modules are stored in the memory 802 and, when executed by the processor 801 , perform the method in the above method embodiment.
[0142] The specific details of the above electronic device can be understood by referring to the corresponding descriptions and effects in the above method embodiments, and will not be repeated here.
[0143] Those skilled in the art will appreciate that all or part of the processes in the above-described embodiments can be implemented by instructing related hardware through a computer program. The program can be stored in a computer-readable storage medium, and when executed, the program can include the processes in the above-described embodiments. The storage medium can be a magnetic disk, an optical disk, a read-only memory (ROM), a random access memory (RAM), a flash memory, a hard disk drive (HDD), or a solid-state drive (SSD). The storage medium can also include a combination of the above-mentioned types of memory.
[0144] Although the embodiments of the present invention have been described with reference to the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention. Such modifications and variations are all within the scope defined by the appended claims. Industrial Applicability
[0145] The present invention provides a network delay in-band telemetry method, device, electronic device and storage medium, the method comprising: obtaining network-wide topology information through a link layer discovery protocol, establishing a network-wide topology view, and attempting to establish a mathematical model for the network-wide delay measurement problem based on the network-wide topology; simplifying the mathematical model based on a minimum vertex cover algorithm, and estimating a minimum vertex cover set of the network-wide topology view based on the simplified mathematical model; constructing a detection path set that meets preset conditions based on the minimum vertex cover set, and deploying a probe device set based on the minimum vertex cover set; mounting a probe host on each device in the probe device set, and sending probe packets along the detection path in the detection path set with the probe device as the starting point; controlling all network forwarding devices to add multiple information fields to the probe packet during the process of sending and / or forwarding the probe packet; obtaining when each probe device receives a probe packet with itself as the destination, extracting multiple information fields in the probe packet, and calculating the link delay information on the probe packet path based on the multiple information fields; updating the network-wide link delay information based on the link delay information of each probe device. The present invention uses a minimum vertex cover algorithm to optimize the deployment positions of measurement terminals in the network and reconstruct the set of detection paths in the network, thereby planning the network measurement scheme of in-band telemetry and enhancing the real-time performance and accuracy of network delay measurement.
Claims
1. A network delay in-band telemetry method, comprising: Obtain the network topology information through the link layer discovery protocol, establish the network topology view, and try to establish a mathematical model for the network delay measurement problem based on the network topology; Simplifying the mathematical model based on a minimum vertex cover algorithm, and estimating a minimum vertex cover set of the entire network topology view based on the simplified mathematical model; Constructing a set of detection paths that meet preset conditions based on the minimum vertex cover set, and deploying a set of probe devices based on the minimum vertex cover set; Mount a probe host on each device in the probe device set, and send a probe packet along a detection path in the detection path set starting from the probe device; Control all network forwarding devices to add multiple information fields to the probe packet during the process of sending and / or forwarding the probe packet; When each probe device receives a probe packet with itself as the destination, it extracts multiple information fields in the probe packet, and calculates link delay information on the probe packet path based on the multiple information fields; Based on the link delay information of each probe device, update the link delay information of the entire network.
2. The method according to claim 1, wherein: The method of obtaining the whole network topology information through the link layer discovery protocol, establishing the whole network topology view, and attempting to establish a mathematical model for the whole network delay measurement problem based on the whole network topology includes: The topology of the entire network is modeled as a full network topology view, with network switching devices and terminals as vertices in the graph and network links as undirected edges in the graph; Based on the whole network topology view, all paths are detected by using an in-band network telemetry method, and the time efficiency and cost of detecting all paths are obtained; Based on all the paths, detecting the time efficiency and overhead of all the paths, a mathematical model for the whole network delay measurement problem is established.
3. The method according to claim 1, wherein: The method of simplifying the mathematical model based on a minimum vertex cover algorithm and estimating a minimum vertex cover set of the entire network topology view based on the simplified mathematical model includes: Calculate the degree of association of each vertex to the edge based on the full network topology view, and select vertex to the edge with a degree of association greater than a preset threshold for coverage based on a minimum vertex cover algorithm; Recalculate the degree of association of the uncovered edges of each vertex, repeat the step of selecting vertex edges with a degree of association greater than a preset threshold to cover based on the minimum vertex cover algorithm, until all edges in the graph are covered, and obtain the minimum vertex cover set of the entire network topology view.
4. The method according to claim 3, wherein: The step of mounting a probe host on each device in the probe device set and sending a probe packet along a detection path starting from the probe device in the detection path set includes: The probe host sends the probe packet along the detection path starting from the probe device in the minimum vertex cover set in a source routing manner; The probe packets destined for each probe device are obtained and forwarded to the detection terminals attached to each probe device.
5. The method according to claim 4, wherein: The step of obtaining, when each probe device receives a probe packet with itself as the destination, extracting multiple information fields in the probe packet, and calculating link delay information on the probe packet path based on the multiple information fields, includes: The difference between the probe packet arrival time marked at the first probe device of a certain hop and the probe packet arrival time marked at the second probe device of the previous hop is used as the link delay between the first probe device and the second probe device; The difference between the probe packet arrival time marked at the first probe device of a certain hop and the probe packet sending time marked at the second probe device of the previous hop is used as the propagation delay of the link between the first probe device and the second probe device.
6. The method according to claim 5, wherein: The updating of the whole network link delay information based on the link delay information of each probe device includes: The link delay information reported by each probe device is obtained regularly, and the link delay information of the entire network is updated based on the reported link delay information.
7. The method according to claim 5, wherein: The method further comprises: A plurality of information fields are added to the probe packet through a programmable switch, wherein the plurality of information fields at least include a packet arrival time, a receiving port, a packet sending time, a sending port, and a device number thereof.
8. A network delay in-band telemetry device, comprising: An establishment part is configured to obtain the whole network topology information through the link layer discovery protocol, establish the whole network topology view, and attempt to establish a mathematical model for the whole network delay measurement problem based on the whole network topology; A simplification part is configured to simplify the mathematical model based on a minimum vertex cover algorithm, and estimate a minimum vertex cover set of the full network topology view based on the simplified mathematical model; A deployment part, configured to construct a set of detection paths that meet preset conditions based on the minimum vertex cover set, and deploy a set of probe devices based on the minimum vertex cover set; The detection part is configured to mount a probe host on each device in the probe device set, and send a probe packet along a detection path in the detection path set starting from the probe device; an adding part, configured to control all network forwarding devices to add a plurality of information fields to the probe packet during the process of sending and / or forwarding the probe packet; The acquisition part is configured to acquire, when each probe device receives a probe packet with itself as the destination, extract multiple information fields in the probe packet, and calculate the link delay information on the probe packet path based on the multiple information fields; The updating part is configured to update the link delay information of the entire network based on the link delay information of each probe device.
9. The device according to claim 8, wherein: The establishing part is further configured to model the topology of the entire network as a network-wide topology view, with network switching devices and terminals being vertices in the graph and network links being undirected edges in the graph; Based on the whole network topology view, all paths are detected by using an in-band network telemetry method, and the time efficiency and cost of detecting all paths are obtained; Based on all the paths, detecting the time efficiency and overhead of all the paths, a mathematical model for the whole network delay measurement problem is established.
10. The device according to claim 8, wherein: The simplification part is further configured to calculate the degree of association of each vertex to the edge based on the whole network topology view, and select the vertex to the edge with the degree of association greater than a preset threshold to cover based on the minimum vertex cover algorithm; Recalculate the degree of association of the uncovered edges of each vertex, repeat the step of selecting vertex edges with a degree of association greater than a preset threshold to cover based on the minimum vertex cover algorithm, until all edges in the graph are covered, and obtain the minimum vertex cover set of the entire network topology view.
11. The device according to claim 10, wherein: The detection part is further configured so that the probe host sends the probe packet along the detection path starting from the probe device in the minimum vertex cover set in a source routing manner; The probe packets destined for each probe device are obtained and forwarded to the detection terminals attached to each probe device.
12. The device according to claim 11, wherein The acquisition part is further configured to use the difference between the probe packet arrival time marked at the first probe device of a certain hop and the probe packet arrival time marked at the second probe device of the previous hop as the link delay between the first probe device and the second probe device; The difference between the probe packet arrival time marked at the first probe device of a certain hop and the probe packet sending time marked at the second probe device of the previous hop is used as the propagation delay of the link between the first probe device and the second probe device.
13. The device according to claim 12, wherein: The updating part is also configured to periodically obtain link delay information reported by each probe device, and update the link delay information of the entire network based on the reported link delay information.
14. The device according to claim 12, wherein: The acquisition part is also configured to add multiple information fields to the probe packet through a programmable switch, wherein the multiple information fields at least include packet arrival time, receiving port, packet sending time, sending port, and own device number.
15. An electronic device, comprising: A processor and a memory, wherein the processor is used to execute a network delay in-band telemetry program stored in the memory to implement the network delay in-band telemetry method according to any one of claims 1 to 7.
16. A storage medium storing one or more programs, wherein the one or more programs can be executed by one or more processors to implement the network delay in-band telemetry method according to any one of claims 1 to 7.
Citation Information
Patent Citations
Probe deployment method and device for power communication private network service monitoring
CN105187273A
Link fault diagnosis method based on time delay
CN106100925A
A method and apparatus for deploying a power wireless private network probe
CN109041071A
Network time delay in-band telemetering method and device, electronic equipment and storage medium
CN116232956A
Optimal probing for unicast network delay tomography
US20100118715A1
