CN114500357B - Path determination method and device - Google Patents

Path determination method and device Download PDF

Info

Publication number
CN114500357B
CN114500357B CN202011164675.1A CN202011164675A CN114500357B CN 114500357 B CN114500357 B CN 114500357B CN 202011164675 A CN202011164675 A CN 202011164675A CN 114500357 B CN114500357 B CN 114500357B
Authority
CN
China
Prior art keywords
path
paths
sub
congestion risk
congestion
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011164675.1A
Other languages
Chinese (zh)
Other versions
CN114500357A (en
Inventor
冯晨昕
宋跃忠
李磊
周天然
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Huawei Digital Technologies Co Ltd
Original Assignee
Beijing Huawei Digital Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Huawei Digital Technologies Co Ltd filed Critical Beijing Huawei Digital Technologies Co Ltd
Priority to CN202011164675.1A priority Critical patent/CN114500357B/en
Publication of CN114500357A publication Critical patent/CN114500357A/en
Application granted granted Critical
Publication of CN114500357B publication Critical patent/CN114500357B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/12Shortest path evaluation
    • H04L45/123Evaluation of link metrics
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/38Flow based routing

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the application discloses a path determining method and device, which are used for reducing the number of paths needing to acquire service quality information and improving monitoring efficiency. The path determining method comprises the following steps: the method comprises the steps that first equipment obtains flow information of each path in a plurality of paths; the first device determines the congestion risk degree of each path according to the flow information of each path and the corresponding relation, wherein the corresponding relation is the corresponding relation between the flow information and the congestion risk degree, and the congestion risk degree of the path reflects the congestion condition of the path; and the first equipment determines a target path needing to acquire service quality information from the paths according to the congestion risk degree of each path.

Description

Path determination method and device
Technical Field
The present disclosure relates to the field of communications, and in particular, to a path determining method and apparatus.
Background
With the development of communication networks, more and more traffic flows are carried in the networks. In order to ensure the normal forwarding of network traffic, the network operation needs to be monitored. The acquisition of the service quality information is an important item in network monitoring. The service quality information comprises network parameters such as packet loss rate, delay value and the like, and can embody the actual transmission condition of the service flow in the network.
However, the conventional monitoring method needs to acquire quality of service information of all paths in the network. That is, for each path in the network architecture, the conventional monitoring method needs to acquire the service quality information of the path. Then, as the complexity of the network increases, the number of nodes in the network increases, the number of paths increases, and the number of monitoring tools that need to be deployed increases. Thus, the conventional monitoring method needs to deploy a large number of monitoring tools, and the workload of acquiring the service quality information is increased.
Disclosure of Invention
The embodiment of the application provides a path determining method and device, which reduces the number of paths needing to acquire service quality information and improves monitoring efficiency.
In a first aspect, an embodiment of the present application provides a path determining method, where the method is applied to a first device, and includes: the first device obtains traffic information for each of a plurality of paths, which may include actual traffic for the path. According to the corresponding relation between the traffic information and the congestion risk degree, the first device can determine the congestion risk degree of each path according to the traffic information of each path in the plurality of paths. The congestion risk level represents the congestion condition of the path, and may include, for example, the bandwidth occupancy of the path. After determining the congestion risk level of each path in the plurality of paths, the first device may determine a target path from the plurality of paths according to the congestion risk level of each path. These target paths are paths for which quality of service information needs to be acquired. Thus, the first device can select the target paths from the plurality of paths according to the actual conditions of the paths, and the number of the target paths is not more than the number of all paths. Compared with the prior art, the method can monitor the service quality information of the whole network by only acquiring the service quality information of the target paths with a small number, reduces the number of paths needing to acquire the service quality information, and improves the monitoring efficiency.
In a possible implementation, each path includes at least one sub-path, that is, each path is composed of at least one sub-path. When acquiring traffic information of each of the plurality of paths, the first device may acquire traffic information of each of at least one of the sub-paths constituting the path. When determining the congestion risk degree of each path according to the flow information and the corresponding relation of each path, the first device may determine the congestion risk degree of each segment of sub-paths according to the flow information and the corresponding relation of each segment of sub-paths in at least one segment of sub-paths forming the path; and determining the congestion risk degree of each path according to the congestion risk degree of each sub-path. Therefore, the path is split into at least one section of sub-path, and the monitoring efficiency can be further improved.
In one possible implementation, in determining the congestion risk level of each of the plurality of paths, the first device may sum the congestion risk level of each of at least one of the sub-paths that make up the path, and use the sum as the congestion risk level of the whole.
In one possible implementation, after determining the congestion risk level of each path in the plurality of paths, the first device may select, from the plurality of paths, a path with the congestion risk level greater than or equal to a threshold value to determine as a target path, so as to obtain quality of service information of the target path.
In one possible implementation, the first device may also first select paths from the plurality of paths that have a congestion risk level greater than or equal to the threshold, and determine those paths that have a higher congestion risk level as alternative paths. If the number of the alternative paths is greater than 1, that is, the congestion risk degree of at least one path is not less than the threshold value, the first device may determine, from the multiple alternative paths, a target path that needs to acquire service quality information according to an overlapping relationship between sub-paths whose congestion risk degrees are greater than or equal to the threshold value. The overlapping relationship is a relationship that sub paths, which are included in the multiple alternative paths and have congestion risk degrees greater than or equal to a threshold, overlap each other. Therefore, the alternative paths are screened from the paths, then the target paths are screened from the alternative paths, and the number of the target paths is further reduced and the monitoring efficiency is improved through twice screening.
In one possible implementation, when selecting the target path from the plurality of alternative paths, the first device may select, as the target path, a path that has the smallest number of paths among the alternative paths and includes all sub-paths of the alternative paths having congestion risk levels greater than or equal to the threshold. Therefore, on the premise that the target path can cover all sub-paths with the congestion risk degree larger than or equal to the threshold value, the number of the target paths can be minimized, and the monitoring efficiency is further improved.
In one possible implementation, the service quality information includes a packet loss rate, and the first device may further obtain the packet loss rate of the target path. After obtaining the packet loss rate of the target path, the first device may determine the packet loss rate of the non-target path according to the overlapping relationship between all sub-paths with congestion risk degrees greater than or equal to a threshold value in the non-target path and all sub-paths with congestion risk degrees greater than or equal to the threshold value in the target path in the alternative path, and the packet loss rate of the target path. Thus, the packet loss rate of all paths in the alternative path can be determined according to the packet loss rate of part of paths (namely the target path) in the alternative path.
In a second aspect, an embodiment of the present application provides a path determining apparatus, where the apparatus is located in a first device, and includes an obtaining unit, configured to obtain traffic information of each path in multiple paths; the first determining unit is used for determining the congestion risk degree of each path according to the flow information of each path and the corresponding relation, wherein the corresponding relation is the corresponding relation between the flow information and the congestion risk degree, and the congestion risk degree of the path reflects the congestion condition of the path; and the second determining unit is used for determining a target path needing to acquire service quality information from the plurality of paths according to the congestion risk degree of each path by the first device.
In one possible implementation, each path includes at least one sub-path; the obtaining unit is used for obtaining the flow information of each sub-path in at least one section of sub-path of each path; the first determining unit is used for determining the congestion risk degree of each section of sub-path according to the flow information and the corresponding relation of each section of sub-path; and determining the congestion risk degree of each path according to the congestion risk degree of each sub-path.
In a possible implementation, the first determining unit is configured to determine a sum of congestion risk levels of at least one sub-path of each path as the congestion risk level of each path.
In a possible implementation, the second determining unit is configured to determine, as a target path for which quality of service information needs to be acquired, a path with the congestion risk level greater than or equal to a threshold value among the multiple paths.
In a possible implementation, the second determining unit is configured to determine, as an alternative path, a path including a sub-path, where the congestion risk level is greater than or equal to a threshold, from the plurality of paths; and in response to the number of the alternative paths being greater than 1, determining a target path needing to acquire service quality information from the plurality of alternative paths according to an overlapping relation between sub-paths, wherein the congestion risk degree included in the alternative paths is greater than or equal to a threshold value.
In a possible implementation, the second determining unit is configured to determine, as the target path, a path that has a minimum number of groups of paths in the alternative paths and includes all sub-paths having congestion risk degrees greater than or equal to a threshold value in the alternative paths.
In one possible implementation, the service quality information includes a packet loss rate, and the apparatus further includes a packet loss rate calculation unit; the calculating unit is used for obtaining the packet loss rate of the target path; and determining the packet loss rate of the non-target path according to the overlapping relation between all sub-paths with congestion risk degrees larger than or equal to a threshold value in the non-target path in the alternative paths and all sub-paths with congestion risk degrees larger than or equal to the threshold value in the target path and the packet loss rate of the target path.
In a third aspect, embodiments of the present application provide a first device, including: at least one processor coupled with the at least one memory; the at least one processor is configured to execute a computer program or instructions stored in the at least one memory, and cause the first device to perform the path determining method described in the first aspect.
In a fourth aspect, embodiments of the present application provide a computer readable storage medium comprising instructions, a program or code which, when executed on a computer, causes the computer to perform the method of determining a file according to the first aspect.
Drawings
Fig. 1 is a schematic structural diagram of a network architecture according to an embodiment of the present application;
fig. 2 is a schematic diagram of a path determining method according to an embodiment of the present application;
fig. 3 is a partial schematic diagram of a network architecture according to an embodiment of the present application;
fig. 4 is a schematic diagram of a method for determining a target path according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a network architecture according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of a path determining apparatus 600 according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of an apparatus 700 according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of an apparatus 800 according to an embodiment of the present application.
Detailed Description
The following description provides a path determining method and apparatus for conventional technologies and embodiments of the present application with reference to the accompanying drawings.
Referring to fig. 1, a schematic diagram of a network architecture is shown. The network architecture includes network device 101, network device 102, network device 103, network device 104, network device 105, network device 106, network device 107, network device 108, network device 109, network device 110, and first device 111. Wherein, the network device 101 is connected with the network device 103 and the network device 104 respectively, the network device 102 is connected with the network device 104 and the network device 105 respectively, the network device 106 is connected with the network device 103 and the network device 109 respectively, the network device 107 is connected with the network device 104, the network device 109 and the network device 110 respectively, the network device 108 is connected with the network device 105 and the network device 110 respectively, and the first device 111 is connected with all the above-mentioned network devices.
Assume that the network architecture shown in fig. 1 includes 8 paths, and the 8 paths respectively include: path a (network device 101→network device 104→network device 102), path B (network device 101→network device 103→network device 106→network device 109), path C (network device 101→network device 104→network device 107→network device 109), path D (network device 101→network device 104→network device 107→network device 110), path E (network device 102→device 10 network device 104→network device 107→network device 109), path F (network device 102→network device 104→network device 107→network device 110), path G (network device 102→network device 105→network device 108→network device 110), and path H (network device 109→network device 107→network device 110) total 8 paths.
Then in the conventional monitoring method the first device needs to obtain quality of service information for each of these 8 paths. As one possible implementation, the first device may deploy a monitoring tool on the path. For example, the first device may deploy one or more network probes on the head node of the path, one for each path. In this way, the head node with the network probe deployed may send a data packet that is routed to the tail node. And analyzing the data packet received by the tail node to obtain the related information of the path.
As can be seen, the conventional technology requires the deployment of more monitoring tools for monitoring all paths. Then as the number of node devices in the network architecture increases, the number of paths to be monitored increases, so does the number of network probes (or other monitoring tools) to be deployed by the first device, thereby greatly increasing the workload of acquiring network monitoring.
In order to solve the above-mentioned problems, the embodiments of the present application provide a path determining method, which determines, based on traffic information of a path, a possibility that the path is congested, and selects a path with a higher possibility of congestion from a plurality of paths to monitor, so as to obtain service quality information of the path with the possibility of congestion in a targeted manner. Therefore, the service quality information of all paths does not need to be acquired, and the workload of network monitoring is reduced.
The method provided by the embodiment of the application can be applied to the network architecture shown in fig. 1.
The first device 111 is a controller (such as a software defined network (Software Defined Network, SDN) controller) or a server, and is configured to determine a target path and obtain quality of service information of the target path. The network device 101, the network device 102, the network device 103, the network device 104, the network device 105, the network device 106, the network device 107, the network device 108, the network device 109, and the network device 110 may be network devices, such as routers (routers), switches, and other entity devices supporting routing functions, and may also be servers deploying virtual routers or virtual switches for transmitting traffic flows.
Referring to fig. 2, the method is a schematic diagram of a path determining method according to an embodiment of the present application, where the path determining method according to the embodiment of the present application includes the following steps:
s201: the first device obtains traffic information for each of a plurality of paths.
In this embodiment of the present application, the first device may first obtain traffic information of each path in multiple paths in the network topology. The path is a path for transmitting a traffic flow, and may be any one of paths a to H in fig. 1, for example. The multiple paths may be all paths for transmitting traffic flows in the network architecture, for example, 8 paths from path a to path H in fig. 1. In addition, the first device may determine multiple paths according to the object to be monitored, and when the first path needs to monitor a specific area of the network architecture, the first device may obtain flow information of all paths for transmitting the service flow in the area. Wherein the specific area may be, for example, an autonomous system (autonomous system, AS) in a network architecture. When the first device needs to monitor the AS1 in the network architecture, the first device may acquire traffic information of all paths in the AS 1.
In the embodiment of the present application, the traffic information of the path may include the actual traffic of the path, that is, the data amount actually transmitted by the path in unit time. The actual traffic of the path may be in kilobits per second (kilobit per second, mbps), megabits per second (Million bits per second, mbps), etc. to represent the network bandwidth, representing the actual load of the path. In addition, the traffic information of the path may also include a theoretical traffic of the path, that is, a maximum amount of data that can be transmitted by the path per unit time, indicating a maximum load of the path. The units of theoretical traffic of the path may be consistent with the units of actual traffic of the path.
In a practical application scenario, a path may be composed of at least one segment of sub-path, i.e. the path includes at least one segment of sub-path. The sub-paths can be obtained by dividing the paths by the first equipment according to the network topology structure, or can be obtained by dividing the paths by a technician. In some possible implementations, a sub-path is a path connecting between two adjacent network devices. For example, network device 101→network device 104 in fig. 1 may be considered a sub-path, and network device 104→network device 102 may be considered another sub-path, then path a includes two sub-paths.
When the flow information of the path is acquired, the first device can acquire the flow information of each segment of sub-path respectively, so as to acquire the flow information of the whole path. Considering that network devices are mostly connected through a network interface, it is assumed that a network device located at the head end of a sub-path transmits data to a next-hop network device in the sub-path through a network interface a, and a network device located at the tail end of the sub-path receives data transmitted by a last-hop network device in the sub-path through a network interface B. Then, the data flowing out of the network interface a corresponds to the data flowing into the sub-path, and the data flowing into the network interface B corresponds to the data flowing out of the sub-path. Therefore, the first device may obtain traffic information of a network interface of the network device on the sub-path, and determine the traffic information of the sub-path according to the traffic information of the network interface.
Specifically, the first device may determine, according to a topology structure of the network, a network device located at a head end of the sub-path and a network device located at a tail end of the sub-path. After determining the network device located at the head end of the sub-path, the first device may obtain the traffic information of the network interface corresponding to the sub-path in the network device located at the means of the sub-path and the traffic information of the network interface corresponding to the sub-path in the network device located at the tail end of the sub-path, so as to determine the traffic information of the sub-path according to the traffic information of the network interface. Taking the case that the sub-path traffic information includes the actual traffic and the theoretical traffic of the sub-path as examples, the first device may determine the traffic information of the sub-path according to the actual traffic and the theoretical traffic of the network interface corresponding to the sub-path. Wherein the theoretical flow of a sub-path represents the maximum amount of data that the sub-path can transmit per unit time.
Similarly, when the path comprises a plurality of sections of sub-paths, the first device adopts the method to respectively acquire the flow information of each section of sub-path, so as to acquire the flow information of the whole path.
Taking fig. 1 as an example, assume that network device 101 is connected to network device 104 through network interface a, network device 104 is connected to network device 101 through network interface B, network device 102 through network interface C, and network device 107 through network interface D. The specific connection manner can be seen from a partial schematic view of the network architecture shown in fig. 3.
When the first device 111 needs to acquire the traffic information of the path a, the first device 111 determines that the path a includes two sub-paths, namely, a "network device 101→a network device 104" (hereinafter referred to as sub-path 1) and a "network device 104→a network device 102" (hereinafter referred to as sub-path 2), and determines that the network device located at the head end of the sub-path 1 is the network device 101, the network device located at the tail end of the sub-path 1 is the network device 104, the network device located at the head end of the sub-path 2 is the network device 104, and the network device located at the tail end of the sub-path 2 is the network device 102. Then, the first device 111 may acquire the traffic information of the network interface a of the network device 101 connected to the network device 104 as the traffic information of the sub-path 1, and acquire the traffic information of the network interface C as the traffic information of the sub-path 2, so as to obtain the traffic information of the path a.
Accordingly, the first device 111 may also obtain the traffic information of other paths through a similar method, to obtain the traffic information of the entire path.
S202: and the first equipment determines the congestion risk degree of each path according to the traffic information and the corresponding relation of each path.
After determining the traffic information of each path, the first device may determine the congestion risk level of the path according to the traffic information of the path and the correspondence. The corresponding relation is a corresponding relation between flow information and congestion risk degree, and the congestion risk degree represents the congestion state of the path. The congestion status may represent a quality of service (Quality of Service, qoS), with poor congestion status indicating poor QoS, and a higher packet loss rate and longer delay for the path. Thus, for any path, the first device can determine the congestion risk degree of the path according to the corresponding relation only by determining the flow information of the path.
In some possible implementations, the correspondence may include a correspondence of bandwidth occupancy and congestion risk level. The bandwidth occupancy rate represents the ratio of the actual bandwidth used by the path to the theoretical bandwidth, and may be, for example, the ratio of the actual traffic of the path to the theoretical traffic. If the bandwidth occupancy rate of the path is higher, which means that the idle bandwidth of the path is less, the possibility of congestion of the path is higher, and the first device can determine that the congestion risk degree of the path is a high risk degree; if the bandwidth utilization of the path is lower, which means that the idle bandwidth of the path is more, the possibility of congestion of the path is lower, and the first device may determine that the congestion risk level of the path is a low risk level. Then, the first device may calculate the bandwidth occupancy of the path first, and then determine the congestion risk level of the path according to the bandwidth occupancy. Therefore, the congestion risk degree is determined according to the bandwidth occupancy rate of the path, which is equivalent to predicting the congestion risk according to the actual working condition of the path, and the obtained congestion risk degree has high accuracy and larger reference value.
In some possible implementations, the first device may digitally represent the congestion risk level of the path. For example, when the bandwidth occupancy of a path is below 40%, the probability that the path is congested is extremely low, and the first device may determine that the congestion risk level of the path is 0; when the bandwidth occupancy rate of the path is not lower than 40% and lower than 60%, the path has a certain probability of congestion, but the probability of congestion is still lower, and the first device can determine that the congestion risk degree of the path is 1; when the bandwidth occupancy rate of the path is not lower than 60% and lower than 75%, the probability of congestion of the path is higher, and the first device can determine that the congestion risk degree of the path is 2; when the bandwidth occupancy of the path is not less than 75% and less than 85%, the probability of congestion of the path is higher, and the first device may determine that the congestion risk degree of the path is 4; when the bandwidth occupancy of a path is not less than 85%, the probability of congestion of the path is extremely high, and the first device may determine that the congestion risk degree of the path is 8. Thus, the size of the probability of congestion of the path is directly reflected by the size of the number.
In the embodiment of the present application, when a path is formed by at least one segment of sub-path, the first device may determine the congestion risk level of each segment of sub-path, thereby determining the congestion risk level of the entire path. Specifically, after the flow information of each segment of sub-path is obtained, the first device may determine the congestion risk degree of the sub-path according to the flow information and the corresponding relationship of the sub-path one by one. For example, the first device may calculate a bandwidth occupancy of a sub-path of a certain segment, and determine a congestion risk level of the sub-path according to a correspondence between the bandwidth occupancy and the congestion risk level.
Still taking fig. 1 as an example, assume that the actual traffic of sub-path 1 (i.e. "network device 101→network device 104") is 5Mbps, and the theoretical traffic is 10Mbps; the actual traffic for sub-path 2 (i.e. "network device 104→network device 102") is 3Mbps and the theoretical traffic is 10Mbps. Then, the first device 111 may determine that the bandwidth occupancy of the sub-path 1 is 50%, and determine that the congestion risk level of the sub-path 1 is 1 according to the correspondence; the first device 111 may determine that the bandwidth occupancy of the sub-path 2 is 30% and determine that the congestion risk level of the sub-path 2 is 0 according to the correspondence.
After determining the congestion risk level of each segment of sub-path in the path, the first device may sum the congestion risk levels of each segment of sub-path, and use the result obtained by the summation as the congestion risk level of the path. Still taking fig. 1 as an example, assuming that the congestion risk level of the sub-path 1 is 1 and the congestion risk level of the sub-path 2 is 0, the congestion risk level of the path a is 1+0=1.
S203: the first device determines a target path which needs to acquire service quality information from a plurality of paths according to the congestion risk degree of each path.
After determining the congestion risk level of the paths, the first device may select a target path according to the congestion risk level of each path. The target path is a path with higher possibility of congestion, namely, a path with higher congestion risk. After determining the target path, the first device may obtain quality of service information of the target path, thereby determining a congestion condition of the network.
Since the possibility of congestion of the non-target path is lower than that of congestion of the target path, the possibility of congestion of the non-target path is extremely low when congestion of the target path does not occur. Therefore, the monitoring of the service quality information of the whole network can be realized only by acquiring the service quality information of the target path. Therefore, only the monitoring tools are required to be deployed on the target paths, and the monitoring tools are not required to be deployed on the non-target paths, so that the number of paths for acquiring the service quality information, namely the number of paths for deploying the monitoring tools, is reduced, the number of deployed monitoring tools is reduced, and the monitoring efficiency is improved.
In some possible implementations, the first device may determine one or more paths with the highest degree of congestion risk among the plurality of paths as the target path. For example, the first device ranks the plurality of paths in order of the congestion risk level from high to low, and determines two paths having the highest congestion risk level as the target paths.
In some possible implementations, a threshold of the degree of congestion risk may be stored in the first device. The threshold represents a critical value of the probability of congestion of the path. The first device may compare the congestion risk level of the path with the threshold, and if the first device determines that the congestion risk level of the path is greater than or equal to the threshold, it indicates that the path has a higher possibility of transmitting congestion, and the value of the service quality information of the path is relatively higher; if the first device determines that the congestion risk level of a congested path of a path is less than a threshold value, it is indicated that the path is less likely to be congested, and the value of the quality of service information of the path is relatively low. In this way, the first device can take a path having a relatively high value of the quality of service information as a target path and acquire the quality of service information of the target path. That is, the first device may determine a path having a congestion risk level greater than or equal to a threshold as the target path.
The description will be given by taking fig. 1 as an example. Assuming that the congestion risk level of the path a is 1, the congestion risk level of the path B is 4, and the threshold value of the congestion risk level is 3. Then, since the congestion risk level of the path a is smaller than the threshold value, the path a is less likely to be congested, and the first device 111 may determine that the path a is a non-target path; since the congestion risk level of the path B is greater than the threshold value, the path B is highly likely to be congested, and the first device 111 may determine that the path B is a target path.
In some possible implementations, the threshold of the congestion risk level may be adjusted according to the nature of the monitored network. If the monitored network has strict requirements on congestion, the threshold value of the congestion risk degree can be reduced; if the monitored network is not critical for congestion, the threshold for congestion risk level may be increased appropriately.
In some possible implementations, the first device may obtain the quality of service information of the target path by sending a detection instruction. Specifically, the first device sends a detection instruction to the head node of the target path, where the detection instruction is used to instruct the head node to detect quality of service information of the target path. After receiving the detection instruction, the head node can acquire the service quality information of the target path.
The quality of service information including packet loss rate and delay is described as an example. Assuming that the path a is a target path, the first device 111 may send a detection instruction to the network device 101, where the detection instruction carries information about the path a. Based on the detection instruction, the network device 101 may periodically send a packet addressed to the network device 102 to the network device 104 through the network interface a. The time at which the data packet was generated may be included in the data packet. The network device 102 may receive the data packet and provide a time to receive the data packet to the first device 111. Thus, by analyzing whether the number of data packets received by the network device 102 and the number of data packets generated by the network device 101 agree, the first device 111 can determine the packet loss rate of the path a; by analyzing the time at which network device 102 receives the data packet and the time at which network device 101 generates the data packet, first device 111 can determine the latency of path a.
In order to further improve the monitoring efficiency, in the embodiment of the present application, the first device may determine an alternative path from multiple paths. If the number of the alternative paths is greater than 1, the first device can determine the target paths from the alternative paths according to the congestion risk degree of the sub-paths, so that the number of the target paths is reduced through twice screening, and the monitoring efficiency is improved.
In some possible implementations, the first device may first compare the magnitude relation between the congestion risk level and the threshold value of each path, and determine paths with congestion risk levels greater than or equal to the threshold value in the multiple paths as alternative paths.
In some other implementations, the first device may first determine whether each path of the plurality of paths includes a sub-path having a congestion risk level greater than or equal to a threshold. In the embodiment of the present application, a sub-path with a congestion risk level greater than or equal to a threshold may be referred to as a risk sub-path. The first device may determine a path including the risk sub-path as an alternative path, and further determine a target path from the alternative path. Specifically, the first device may compare the magnitude relation of the congestion risk level of each segment sub-path of each path with the threshold value, respectively. If the congestion risk degree of a certain segment of sub-path is greater than or equal to the threshold value, the possibility of congestion of the segment of sub-path is higher, the value of the service quality information of the risk sub-path is relatively higher, and the risk sub-path belongs to the risk sub-path. The first device determines the path determined to include the sub-path as an alternative path. If a path does not include a risk sub-path, the value of the service quality information of each sub-path of the path is relatively low, and the value of the service quality information of the whole path is relatively low. The first device may determine this path as a non-alternative path.
Still referring to fig. 1, assuming that the threshold of the congestion risk level is 2, the congestion risk level of sub-path 1 "network device 101→network device 104" is 1, the congestion risk level of sub-path 2 "network device 104→network device 105" is 1, the congestion risk level of sub-path 3 "network device 109→network device 107" is 2, and the congestion risk level of sub-path 4 "network device 107→network device 110" is 0.
Since path a includes sub-path 1 and sub-path 2, and the congestion risk levels of both sub-path 1 and sub-path 2 are less than the threshold, the first device 111 determines that path a does not include a risk sub-path having a congestion risk level greater than or equal to the threshold, thereby determining path a as a non-target path. Since the path H includes the sub-path 3 and the sub-path 4, and the congestion risk degree of the sub-path 3 is equal to the threshold value, the first device 111 determines that the sub-path 3 is a risk sub-path and that the path B is an included risk sub-path, thereby determining the path B as a target path.
Of course, in other implementations, the first device may determine the alternative path from the plurality of paths in other manners. For example, the first device may first select a path having a congestion risk level greater than or equal to a threshold value from a plurality of paths, and then select a path including a risk sub-path from the paths as an alternative path. The embodiments of the present application are not limited in this regard.
After determining the alternative paths, the first device may determine whether the number of alternative paths is greater than 1. If the number of alternative paths is equal to 1, the first device may determine the alternative path as the target path. If the number of alternative paths is greater than 1, the first device may determine the target path according to an overlapping relationship between sub-paths whose congestion risk degrees included in the alternative paths are greater than or equal to a threshold. The overlapping relationship represents the degree of overlap of the risk sub-paths between any two of the plurality of alternative paths. For example, it may be whether a risk sub-path comprised by one alternative path is completely covered by a risk sub-path comprised by another alternative path.
In some possible implementations, the first device may determine whether the risk sub-path included in the alternative path is completely covered by the risk sub-path included in the other alternative path. If the risk sub-path included in one alternative path is completely covered by the risk sub-path included in another alternative path, the service quality information of the next alternative path can be obtained according to the service quality information of the previous alternative path. Thus, the first device may determine an alternative path, in which the risk sub-path is completely covered by another alternative path, as a non-target path, thereby reducing the number of target paths.
Still referring to fig. 1, if path a includes risk sub-path 1 "network device 101→network device 102", path B includes risk sub-path 1 and risk sub-path 2 "network device 107→network device 109". The first device may determine that the risk sub-path included in path a is completely covered by the risk sub-path included in path B, thereby determining path a as a non-target path.
In order to reduce the number of target paths as much as possible, in the embodiment of the present application, the first device may select a path that has the smallest number of sets of alternative paths and includes all risk sub-paths, and determine the set of alternative paths as the target path. In this way, the target path includes all sub-paths with congestion risk levels greater than or equal to the threshold and is relatively small in number, i.e., the number of paths that need to acquire quality of service information is small. Therefore, the workload of acquiring the service quality information is reduced on the premise of ensuring the accuracy of the monitoring result.
In some possible implementations, the first device may determine the target path from the alternative paths by solving a vector set. For a specific method, reference may be made to the target path determining method shown in fig. 4, which includes:
S401: the first device generates a vector for each alternative path.
In the embodiment of the present application, the first device may generate a vector corresponding to each alternative path in the multiple alternative paths according to the correspondence between the alternative paths and the risk sub-paths. When generating the vector corresponding to the alternative path, the first device may determine the number of elements in the vector according to the number of all risk sub-paths in the network architecture, and sort all risk sub-paths to determine the risk sub-path corresponding to each element in the vector. Then, the first device may determine values of elements corresponding to each risk sub-path in the vector according to the correspondence between the alternative path and the risk sub-path, so as to obtain a vector corresponding to the alternative path. For example, the fake device selection path a includes the risk sub-path a and does not include the risk sub-path b. The first device may determine that the value of the element corresponding to the risk sub-path a in the vector corresponding to the alternative path a is 1 and the value of the element corresponding to the risk sub-path b is 0.
The network architecture shown in fig. 1 is still taken as an example. Assuming that the bandwidth occupancy of sub-path 5 "network device 103- > network device 106" is 50%, the bandwidth occupancy of sub-path 6 "network device 104- > network device 107" is 75%, the bandwidth occupancy of sub-path 7 "network device 107- > network device 110" is 60%, and the bandwidth occupancy of the remaining sub-paths are 20%. The bandwidth occupancy of each segment of sub-path is shown in fig. 5.
Then, according to the correspondence between the bandwidth occupancy and the congestion risk level provided in the foregoing embodiment, the congestion risk level of the sub-path 5 is 1, the congestion risk level of the sub-path 6 is 4, the congestion risk level of the sub-path 7 is 2, and the congestion risk levels of the remaining sub-paths are all 0. In this way, the first device may determine that there are three risk sub-paths including sub-path 5, sub-path 6 and sub-path 7 in the network, and determine six paths including path B, path C, path D, path E, path F and path H as alternative paths, where the congestion risk level of path a and path G is less than a threshold value, and belongs to non-alternative paths.
Since there are three risk sub-paths and six alternative paths in the network, the first device may determine that three elements are included in the vector. Assuming that the order of the risk sub-paths is "sub-path 5 sub-path 6 sub-path 7" and the generated vector is a column vector, then the vector corresponding to the path is a column vector having three elements, and the elements of the first row of the column vector correspond to sub-path 5, the elements of the second row correspond to sub-path 6, and the elements of the third row correspond to sub-path 7.
Since path B (network device 101→network device 103→network device 106→network device 109) includes sub-path 5 (network device 103→network device 106), sub-path 6 (network device 104→network device 107) and Sub-path 7 (network device 107→network device 110), the first device may determine that the element of the first row of the column vector corresponding to path B is 1, the element of the second row is 0, and the element of the third row is zero, thereby obtaining column vector b= [ 10 ] corresponding to path B] T
In a similar manner, the first device may determine a column vector c= [0 10 ] corresponding to the path C] T Column vector d= [0 1 ] corresponding to path D] T Column vector e= [0 10 ] corresponding to path E] T Column vector f= [0 10 ] corresponding to path F] T Column vector h= [0 0 0 1 ] corresponding to path H] T
It should be noted that, if the alternative path does not include the risk sub-path, the column vector corresponding to the alternative path is [0 0 0 0 ]] T . Of course, the first device may directly determine the path as a non-target path without calculating the column vector corresponding to the path. In addition, the means of determining the vector as a column vector, and the values 0 and 1 of the elements in the vector are just one specific implementation provided in the embodiments of the present application. In practical application, the types of vectors and the specific values of the elements in the vectors are also adjusted according to the needs. The embodiments of the present application are not limited in this regard.
S402: the first device determines a vector group corresponding to a plurality of alternative paths according to the vector corresponding to each alternative path, and determines a maximum linear independent group of the vector group.
After determining the vectors corresponding to the plurality of alternative paths, the first device may determine the vectors corresponding to the plurality of alternative paths to a vector group corresponding to the plurality of alternative paths. For example, the first device may sequentially arrange column vectors corresponding to each of the multiple alternative paths to obtain a vector group.
The network architecture shown in fig. 1 is still taken as an example. Assuming that the column vectors corresponding to the respective alternative paths are as shown in step S401, the resulting vector group may be expressed as
The first column of the vector group is a column vector B corresponding to a path B, the second column is a column vector C corresponding to a path C, the third column is a column vector D corresponding to a path D, the fourth column is a column vector E corresponding to a path E, the fifth column is a column vector F corresponding to a path F, and the sixth column is a column vector H corresponding to a path H. The element of the first row and the first column of the matrix corresponding to the vector group represents the corresponding relation between the path B and the sub-path 5, and the value of the element is 1 because the path B comprises the sub-path 5; the element of the first row and the second column of the vector group represents the corresponding relation between the path B and the sub-path 6, and the value of the element is 0 because the path B does not comprise the sub-path 6; the element of the second row and the second column of the vector set represents the correspondence of path C with sub-path 6, and since path C includes sub-path 6, the value of the element is 1.
After determining the set of vectors, the first device may solve for the set of vectors' maximum linearity independent groups. The maximum linear independent group includes at least two linear independent column vectors, and any other vector in the vector group is linearly related to the maximum linear independent group. That is, the maximum linearity independent group is a full rank matrix and the rank is the same as the number of risk sub-paths.
The network architecture shown in fig. 1 is still taken as an example. Assuming that the column vectors corresponding to the alternative paths are as shown in step S401, the resulting maximum linearity independent group can be expressed as:
the maximum linearity independent group comprises a column vector B, a column vector C and a column vector H, which respectively correspond to a path B, a path C and a path H, wherein the meaning of each element is consistent with the meaning in the vector group. Obviously, the rank of this extremely linear independent group is 3, consistent with the number of risk sub-paths in the network.
It should be noted that, in practical applications, a vector group often has multiple greatly linear independent groups. For this case, the first device may select any one of the maximum linearity irrelevant groups for subsequent steps, or may determine the maximum linearity irrelevant group according to the complexity of subsequent calculations. The embodiments of the present application are not limited in this regard.
S403: the first device determines an alternative path corresponding to the vector in the extremely linear independent group as a target path.
After determining the maximum linear independent group, the first device may determine an alternative path corresponding to each vector in the maximum linear independent group as a target path, thereby determining a path where quality of service information needs to be acquired.
Since the target path is determined from the maximum linear independent group of full rank, there are no all zero rows (or all zero columns) in the vector group to which the target path corresponds. While each row (or column) of elements represents the correspondence between each path and a risk sub-path, for any one segment of risk sub-path, there is a target path that includes the risk sub-path, i.e., the sub-path included in the target path can cover all risk sub-paths. Therefore, the quality of service information of the target path is acquired, which corresponds to the quality of service information of the risk sub-path, and the function of acquiring the quality of service information of the whole network can be achieved.
The network architecture shown in fig. 1 is still taken as an example. Assuming that the column vectors corresponding to the respective alternative paths are as shown in step S401, the first device may determine that the target path is a path B, a path C, and a path H, thereby acquiring quality of service information of the path B, the path C, and the path H.
In this embodiment of the present application, for quality of service information such as a packet loss rate, the first device may calculate a packet loss rate of a non-target path in the candidate path according to the packet loss rate of the target path. The packet loss rate refers to the proportion of the number of lost data packets to the total number of the transmitted data packets, and is used for measuring the integrity of the path transmission service flow.
Specifically, the first device may first obtain the packet loss rate of the target path. For example, the first device may deploy a network probe at the head node of the target path, and detect the packet loss rate of each target path through the network probe. After determining the packet loss rate of the target path, the first device may analyze the risk sub-paths included in the non-target path and the risk sub-paths included in the target path in the alternative path, determine an overlapping relationship between the non-target path and the target path in the alternative path, and determine the packet loss rate of the non-target path in the alternative path according to the overlapping relationship and the packet loss rate of the target path. Wherein the overlapping relationship of the non-target path and the target path in the alternative path indicates which target paths include risk sub-paths that the non-target path in the alternative path includes are covered by.
As can be seen from the description of the foregoing embodiment, the vector group formed by the vectors corresponding to the target paths is the maximum linear independent group of the vector group formed by the vectors corresponding to the candidate paths, and then the vector group formed by the vectors corresponding to the target paths is linearly related to the vector corresponding to any one of the non-target paths in the candidate paths. Therefore, the vectors corresponding to any one non-target path in the alternative paths can be obtained by combining the vectors corresponding to one or more target paths (the combination mode comprises addition and/or subtraction), that is, the risk sub-paths included in any one non-target path in the alternative paths can be obtained by combining the passes of the risk sub-paths included in one or more target paths.
It is assumed that a path has a plurality of sub-paths, and the passing rate of the path (i.e., the ratio of the number of non-lost data packets to the total number of transmitted data packets, the sum of the passing rate and the packet loss rate is 1) is the product of the passing rate of each sub-path. Can be expressed as:
wherein L is p Indicating packet loss rate of the path, L j And the packet loss rate of the j-th sub-path in the path is represented, and s represents that the path consists of s-section sub-paths.
Thus, the rate of passage of a non-target path in the alternative paths is equal to the product of the rates of passage of one or more target paths that make up the target path. The first device may calculate the passing rate of the target path by the packet loss rate of the target path, and multiply the passing rate of one or more target paths to obtain the passing rate of the non-target path, thereby determining the passing rate of the non-target path. Therefore, the packet loss rate of all the alternative paths can be determined only by the packet loss rate of the target path in the alternative paths. On the basis of ensuring accurate detection results, the number of paths for acquiring the service quality information is further reduced, the monitoring workload is reduced, and the monitoring efficiency is improved.
The network architecture shown in fig. 1 is still taken as an example. Assuming that the packet loss rate corresponding to each segment of sub-path is shown in fig. 5, and the target paths are a path B, a path C and a path H, the packet loss rate of the path B is 1%, the packet loss rate of the path C is 2%, and the packet loss rate of the path H is 3%.
Path D includes risk sub-path 6 and risk sub-path 7, path C includes risk sub-path 6, and path H includes risk sub-path 7. The risk sub-paths included in path D may be added by the risk sub-paths included in path C and path H. Then, packet loss rate L of path D D =1- (1-0.02) × (1-0.03) =4.94%. Also, the packet loss rate L of the path E can be determined E =1- (1-0.02) =2%; determining packet loss rate L of path F F =1-(1-0.02)*(1-0.03)=4.94%。
In some possible implementations, the first device may further determine a packet loss rate of each segment of the risk sub-paths (a combination of the risk sub-paths) according to the packet loss rate of the target path and the risk sub-paths included in the target path, so as to determine a packet loss rate of a non-target path in the alternative paths.
Referring to fig. 6, the embodiment of the present application further provides a path determining apparatus 600, where the path determining apparatus 600 may implement the function of the first device in the embodiment shown in fig. 2. The path determining apparatus 600 includes an acquisition unit 601, a first determining unit 602, and a second determining unit 603. Wherein the obtaining unit 601 is configured to implement step S201 in the embodiment shown in fig. 2, the first determining unit 602 is configured to implement step S202 in the embodiment shown in fig. 2, and the second determining unit 603 is configured to implement step S203 in the embodiment shown in fig. 2.
Specifically, the acquiring unit 601 is configured to acquire traffic information of each of the multiple paths.
The first determining unit 602 is configured to determine a congestion risk level of each path according to the traffic information and a corresponding relationship of the traffic information and the congestion risk level of each path, where the congestion risk level of each path represents a congestion condition of the path.
A second determining unit 603, configured to determine, by the first device, a target path from the multiple paths, where quality of service information needs to be acquired, according to the congestion risk level of each path.
Reference is made to the detailed description of the corresponding steps in the embodiment shown in fig. 2, and details are not repeated here.
It should be noted that, in the embodiment of the present application, the division of the units is schematic, which is merely a logic function division, and other division manners may be implemented in actual practice. Each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. For example, in the above embodiment, the acquisition unit and the processing unit may be the same unit or different units. The integrated units may be implemented in hardware or in software functional units.
Fig. 7 is a schematic structural diagram of an apparatus 700 according to an embodiment of the present application. The path determining apparatus 600 above may be implemented by the first device shown in fig. 7. Referring to fig. 7, the device 700 includes at least one processor 701, a communication bus 702, and at least one network interface 704, and optionally the device 700 may also include memory 703.
The processor 701 may be a general purpose central processing unit (central processing unit, CPU), application Specific Integrated Circuit (ASIC) or one or more integrated circuits (integrated circuit, IC) for controlling the execution of the programs of the present application. The processor may be configured to process the configuration file to implement the path determining method provided in the embodiments of the present application.
For example, when the first device in fig. 2 is implemented by the device shown in fig. 7, the processor may be configured to obtain traffic information of each of the plurality of paths; determining the congestion risk degree of each path according to the flow information of each path and the corresponding relation, wherein the corresponding relation is the corresponding relation between the flow information and the congestion risk degree, and the congestion risk degree of the path reflects the congestion condition of the possibility of congestion of the path; and determining a target path needing to acquire service quality information from the plurality of paths according to the congestion risk degree of each path.
A communication bus 702 is used to transfer information between the processor 701, network interface 704, and memory 703.
The Memory 703 may be, but is not limited to, a read-only Memory (ROM) or other type of static storage device that can store static information and instructions, the Memory 703 may also be a random access Memory (random access Memory, RAM) or other type of dynamic storage device that can store information and instructions, a read-only optical disk (compact disc read-only Memory, CD-ROM) or other optical disk storage, optical disk storage (including compact disk, laser disk, optical disk, digital versatile disk, blu-ray disk, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer. The memory 703 may be separate and may be coupled to the processor 701 via a communication bus 702. Memory 703 may also be integrated with processor 701.
Optionally, the memory 703 is used for storing program codes or instructions for executing the aspects of the present application, and is controlled by the processor 701 for execution. The processor 701 is configured to execute program code or instructions stored in the memory 703. One or more software modules may be included in the program code. Alternatively, the processor 701 may also store program code or instructions for performing the aspects of the present application, in which case the processor 701 does not need to read the program code or instructions into the memory 703.
The network interface 704 may be a device such as a transceiver for communicating with other devices or communication networks, which may be an ethernet, a Radio Access Network (RAN), or a wireless local area network (wireless local area networks, WLAN), etc. In the embodiment of the present application, the network interface 704 may be configured to receive a packet sent by another node in the segment routing network, or may send a packet to another node in the segment routing network. The network interface 704 may be an ethernet interface, a Fast Ethernet (FE) interface, a Gigabit Ethernet (GE) interface, or the like.
In a particular implementation, the device 700 may include multiple processors, such as the processor 701 and the processor 407 shown in FIG. 7, as one embodiment. Each of these processors may be a single-core (single-CPU) processor or may be a multi-core (multi-CPU) processor. A processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (e.g., computer program instructions).
Fig. 8 is a schematic structural diagram of an apparatus 800 according to an embodiment of the present application. The first device of fig. 2 may be implemented by the device shown in fig. 8. Referring to the schematic device architecture shown in fig. 8, a device 800 includes a master control board and one or more interface boards. The main control board is in communication connection with the interface board. The main control board, also called a main processing unit (main processing unit, MPU) or routing processing card (route processor card), comprises a CPU and a memory, and is responsible for controlling and managing the various components in the device 800, including routing computation, device management and maintenance functions. The interface board is also called a line processing unit (line processing unit, LPU) or line card (line card) for receiving and transmitting messages. In some embodiments, communication is via a bus between the master control board and the interface board or between the interface board and the interface board. In some embodiments, the interface boards communicate via a switch fabric, in which case the device 800 also includes a switch fabric communicatively coupled to the master board and the interface boards, the switch fabric configured to forward data between the interface boards, which may also be referred to as a switch fabric unit (switch fabric unit, SFU). The interface board includes a CPU, memory, forwarding engine, and Interface Card (IC), where the interface card may include one or more network interfaces. The network interface may be an Ethernet interface, an FE interface, a GE interface, or the like. The CPU is in communication connection with the memory, the forwarding engine and the interface card respectively. The memory is used for storing a forwarding table. The forwarding engine is configured to forward the received message based on a forwarding table stored in the memory, and if the destination address of the received message is the IP address of the device 800, send the message to the CPU of the main control board or the interface board for processing; if the destination address of the received message is not the IP address of the device 800, the forwarding table is looked up according to the destination, and if the next hop and the egress interface corresponding to the destination address are found from the forwarding table, the message is forwarded to the egress interface corresponding to the destination address. The forwarding engine may be a network processor (network processor, NP). The interface card is also called a sub-card, can be installed on the interface board, and is responsible for converting the photoelectric signal into a data frame, and forwarding the data frame to a forwarding engine for processing or an interface board CPU after performing validity check. In some embodiments, the CPU may also perform the functions of a forwarding engine, such as soft forwarding based on a general purpose CPU, so that no forwarding engine is needed in the interface board. In some embodiments, the forwarding engine may be implemented by an ASIC or field programmable gate array (field programmable gate array, FPGA). In some embodiments, the memory storing the forwarding table may also be integrated into the forwarding engine as part of the forwarding engine.
Alternatively, the processor in the system-on-chip may be one or more. The processor may be implemented in hardware or in software. When implemented in hardware, the processor may be a logic circuit, an integrated circuit, or the like. When implemented in software, the processor may be a general purpose processor, implemented by reading software code stored in a memory. Alternatively, the memory in the system-on-chip may be one or more. The memory may be integral with the processor or separate from the processor, and is not limited in this application. For example, the memory may be a non-transitory processor, such as a ROM, which may be integrated on the same chip as the processor, or may be separately provided on different chips, and the type of memory and the manner of providing the memory and the processor are not specifically limited in this application.
The system-on-chip may be, for example, an FPGA, an ASIC, a system-on-chip (SoC), a CPU, an NP, a digital signal processing circuit (digital signal processor, DSP), a microcontroller (micro controller unit, MCU), a programmable controller (programmable logic device, PLD) or other integrated chips.
It should be understood that the steps in the above-described method embodiments may be accomplished by integrated logic circuitry in hardware in a processor or instructions in the form of software. The steps of a method disclosed in connection with the embodiments of the present application may be embodied directly in a hardware processor or in a combination of hardware and software modules in a processor.
The present application also provides a computer readable storage medium comprising instructions which, when run on a computer, cause the computer to perform the path determination method provided by the method embodiment above, performed by a first device.
The present embodiments also provide a computer program product comprising instructions which, when run on a computer, cause the computer to perform the path determination method provided by the method embodiments above, performed by a first device.
The terms "first," "second," "third," "fourth" and the like in the description and in the claims of this application and in the above-described figures, if any, are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments described herein may be implemented in other sequences than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, and the division of the units, for example, is merely a logic module division, and there may be additional divisions when actually implemented, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be acquired according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each module unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units described above may be implemented either in hardware or in software module units.
The integrated units, if implemented in the form of software module units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Those skilled in the art will appreciate that in one or more of the examples described above, the functions described in the present invention may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, these functions may be stored on or transmitted over as one or more instructions or code on a computer-readable medium. Computer-readable media includes both computer storage media and communication media including any medium that facilitates transfer of a computer program from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
The above embodiments are further described in detail for the purpose, technical solution and advantageous effects of the present invention, and it should be understood that the above description is only an embodiment of the present invention.
The above embodiments are merely for illustrating the technical solution of the present application, and not for limiting the same; although the present application has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the corresponding technical solutions from the scope of the technical solutions of the embodiments of the present application.

Claims (12)

1. A method of path determination, the method comprising:
the method comprises the steps that first equipment obtains flow information of each path in a plurality of paths;
the first device determines the congestion risk degree of each path according to the flow information of each path and the corresponding relation, wherein the corresponding relation is the corresponding relation between the flow information and the congestion risk degree, and the congestion risk degree of the path reflects the congestion condition of the path;
the first device determines a target path needing to acquire service quality information from the paths according to the congestion risk degree of each path;
wherein each path comprises at least one section of sub-path respectively;
the first device determining a target path which needs to acquire service quality information from the paths according to the congestion risk degree of each path comprises:
the first device determines paths including sub-paths of the plurality of paths, the congestion risk level of which is greater than or equal to a threshold value, as alternative paths;
and in response to the number of the alternative paths being greater than 1, the first device determines a target path needing to acquire service quality information from the plurality of alternative paths according to an overlapping relationship between sub-paths, included in the alternative paths, of which the congestion risk degree is greater than or equal to a threshold value.
2. The method of claim 1, wherein the step of determining the position of the substrate comprises,
the first device obtaining traffic information of each path in the plurality of paths includes:
the first device obtains flow information of each sub-path in at least one sub-path of each path;
the first device determining the congestion risk degree of each path according to the traffic information and the corresponding relation of each path comprises:
the first device determines the congestion risk degree of each section of sub-path according to the flow information and the corresponding relation of each section of sub-path;
and the first equipment determines the congestion risk degree of each path according to the congestion risk degree of each section of sub-path.
3. The method of claim 2, wherein the first device determining the congestion risk level for each path based on the congestion risk level for each segment of sub-path comprises:
the first device determines a sum of congestion risk levels of at least one sub-path of each path as the congestion risk level of each path.
4. The method of claim 1, wherein the first device determining a target path from the plurality of alternative paths for which quality of service information needs to be acquired based on sub-paths for which the congestion risk level included in each of the alternative paths is greater than or equal to a threshold value comprises:
The first device determines a path of the alternative path, which has the smallest set of paths and includes all sub-paths of the alternative path having congestion risk levels greater than or equal to a threshold, as a target path.
5. The method of claim 1, wherein the quality of service information comprises a packet loss rate, the method further comprising: the first device obtains the packet loss rate of the target path;
and the first equipment determines the packet loss rate of the non-target path according to the overlapping relation between all sub-paths with congestion risk degrees larger than or equal to a threshold value in the non-target path in the alternative path and all sub-paths with congestion risk degrees larger than or equal to the threshold value in the target path and the packet loss rate of the target path.
6. A path determining apparatus, the apparatus being located in a first device, comprising:
an acquisition unit configured to acquire flow information of each of a plurality of paths;
the first determining unit is used for determining the congestion risk degree of each path according to the flow information of each path and the corresponding relation, wherein the corresponding relation is the corresponding relation between the flow information and the congestion risk degree, and the congestion risk degree of the path reflects the congestion condition of the path;
A second determining unit, configured to determine, by the first device, a target path from the multiple paths according to the congestion risk level of each path, where quality of service information needs to be acquired;
wherein each path comprises at least one section of sub-path respectively;
the second determining unit is configured to determine, as an alternative path, a path including a sub-path, of the multiple paths, the congestion risk level of which is greater than or equal to a threshold value; and in response to the number of the alternative paths being greater than 1, determining a target path needing to acquire service quality information from the plurality of alternative paths according to an overlapping relation between sub-paths, wherein the congestion risk degree included in the alternative paths is greater than or equal to a threshold value.
7. The apparatus of claim 6, wherein the device comprises a plurality of sensors,
the obtaining unit is used for obtaining the flow information of each sub-path in at least one section of sub-path of each path;
the first determining unit is used for determining the congestion risk degree of each section of sub-path according to the flow information and the corresponding relation of each section of sub-path; and determining the congestion risk degree of each path according to the congestion risk degree of each sub-path.
8. The apparatus of claim 7, wherein the device comprises a plurality of sensors,
the first determining unit is configured to determine a sum of congestion risk levels of at least one segment of sub-path of each path as the congestion risk level of each path.
9. The apparatus of claim 8, wherein the device comprises a plurality of sensors,
the second determining unit is configured to determine, as a target path, a path that has a minimum number of groups of paths among the alternative paths and includes all sub-paths having congestion risk degrees greater than or equal to a threshold value among the alternative paths.
10. The apparatus according to claim 6, wherein the quality of service information includes a packet loss rate, the apparatus further comprising a packet loss rate calculation unit;
the calculating unit is used for obtaining the packet loss rate of the target path; and determining the packet loss rate of the non-target path according to the overlapping relation between all sub-paths with congestion risk degrees larger than or equal to a threshold value in the non-target path in the alternative paths and all sub-paths with congestion risk degrees larger than or equal to the threshold value in the target path and the packet loss rate of the target path.
11. A first device, the device comprising: at least one processor coupled with the at least one memory;
The at least one processor configured to execute a computer program or instructions stored in the at least one memory, to cause the first device to perform the path determination method of any of claims 1-5.
12. A computer readable storage medium comprising instructions, a program or code which, when executed on a computer, causes the computer to perform the path determination method of any of claims 1-5.
CN202011164675.1A 2020-10-27 2020-10-27 Path determination method and device Active CN114500357B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011164675.1A CN114500357B (en) 2020-10-27 2020-10-27 Path determination method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011164675.1A CN114500357B (en) 2020-10-27 2020-10-27 Path determination method and device

Publications (2)

Publication Number Publication Date
CN114500357A CN114500357A (en) 2022-05-13
CN114500357B true CN114500357B (en) 2024-02-09

Family

ID=81470502

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011164675.1A Active CN114500357B (en) 2020-10-27 2020-10-27 Path determination method and device

Country Status (1)

Country Link
CN (1) CN114500357B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101938822A (en) * 2009-07-02 2011-01-05 中兴通讯股份有限公司 Reverse power control method and reverse power control device
CN102300264A (en) * 2011-08-22 2011-12-28 中国电信股份有限公司 Flow control method and system thereof for wireless network
CN103298010A (en) * 2013-05-20 2013-09-11 华为技术有限公司 Network link state display method and network link state display device
WO2016079958A1 (en) * 2014-11-18 2016-05-26 日本電気株式会社 Communication system, communication device, communication method, and recording medium
US9473408B1 (en) * 2014-01-14 2016-10-18 Google Inc. Shortest first longer next routing with congestion reduction
CN106911580A (en) * 2017-01-24 2017-06-30 中国科学院声学研究所 A kind of TCP jamming control methods and system
CN107528791A (en) * 2017-10-23 2017-12-29 北京交通大学 A kind of jamming control method and equipment

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101938822A (en) * 2009-07-02 2011-01-05 中兴通讯股份有限公司 Reverse power control method and reverse power control device
CN102300264A (en) * 2011-08-22 2011-12-28 中国电信股份有限公司 Flow control method and system thereof for wireless network
CN103298010A (en) * 2013-05-20 2013-09-11 华为技术有限公司 Network link state display method and network link state display device
US9473408B1 (en) * 2014-01-14 2016-10-18 Google Inc. Shortest first longer next routing with congestion reduction
WO2016079958A1 (en) * 2014-11-18 2016-05-26 日本電気株式会社 Communication system, communication device, communication method, and recording medium
CN106911580A (en) * 2017-01-24 2017-06-30 中国科学院声学研究所 A kind of TCP jamming control methods and system
CN107528791A (en) * 2017-10-23 2017-12-29 北京交通大学 A kind of jamming control method and equipment

Also Published As

Publication number Publication date
CN114500357A (en) 2022-05-13

Similar Documents

Publication Publication Date Title
TWI389475B (en) Dynamic load balancing of fibre channel traffic
US9614786B2 (en) Dragonfly processor interconnect network
JP4796668B2 (en) Bus control device
CN106998302B (en) Service flow distribution method and device
EP3238392B1 (en) Technologies for medium grained adaptive routing in high-performance network fabrics
CN110233798B (en) Data processing method, device and system
JP2015080274A (en) Table-driven routing in dragonfly processor interconnect network
CN104871490B (en) The multipath communication device of energy ecology and its method for distributing business for improving energy ecology can be improved
US20090323540A1 (en) Electronic device, system on chip and method for monitoring data traffic
CN108401490B (en) Network performance measuring method and detection equipment
CN102124670A (en) Method and system for adjusting network interface metrics
CN112825512A (en) Load balancing method and device
Fan et al. Roulette wheel balancing algorithm with dynamic flowlet switching for multipath datacenter networks
CN114500357B (en) Path determination method and device
US8619627B2 (en) Automatic determination of groupings of communications interfaces
CN112910795B (en) Edge load balancing method and system based on many sources
EP3544235A1 (en) A method for resetting a packet processing component to an operational state
CN114157595B (en) Communication system, data processing method and related equipment
CN112332956B (en) Information sharing method and device in redundant network and computer storage medium
CN107592269B (en) Method and network node for transmitting load information of path
Zhang et al. Disaster-aware dynamic routing for sdn-based active-active data center networks
CN116319549B (en) Distributed flow scheduling method and device
CN117478580A (en) Method for sending load information, method and device for sending message
CN114301829B (en) Method, equipment and medium for selecting message sending path
CN109067662B (en) Link interconnection method and system based on job deployment information

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant