CN114500357A - Path determination method and device - Google Patents

Path determination method and device Download PDF

Info

Publication number
CN114500357A
CN114500357A CN202011164675.1A CN202011164675A CN114500357A CN 114500357 A CN114500357 A CN 114500357A CN 202011164675 A CN202011164675 A CN 202011164675A CN 114500357 A CN114500357 A CN 114500357A
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.)
Granted
Application number
CN202011164675.1A
Other languages
Chinese (zh)
Other versions
CN114500357B (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

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/12—Shortest path evaluation
    • H04L45/123—Evaluation of link metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00—Routing or path finding of packets in data switching networks
    • H04L45/38—Flow 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 determination 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 equipment determines the congestion risk degree of each path according to the traffic information and the corresponding relation of each path, wherein the corresponding relation is the corresponding relation of the traffic information and the congestion risk degree, and the congestion risk degree of each path reflects the congestion condition of each path; and the first equipment determines a target path needing to acquire the service quality information from the multiple paths according to the congestion risk degree of each path.

Description

Path determination method and device
Technical Field
The present application relates to the field of communications, and in particular, to a method and an apparatus for determining a path.
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 flow, the working condition of the network needs to be monitored. The acquisition of the service quality information is an important item in network monitoring. The service quality information includes network parameters such as packet loss rate and delay value, and can reflect 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 obtain the qos 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 to be deployed increases. Thus, the conventional monitoring method needs to deploy a large number of monitoring tools, and the workload of obtaining the service quality information is increased.
Disclosure of Invention
The embodiment of the application provides a path determining method and device, which reduce the number of paths needing to acquire service quality information and improve 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 the plurality of paths, which may include actual traffic for the path. According to the correspondence between the traffic information and the congestion risk degree, the first device may determine the congestion risk degree of each path according to the traffic information of each path of the plurality of paths. The congestion risk degree 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 of 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 of the plurality of paths. These target paths are the paths for which quality of service information needs to be obtained. In this way, the first device may select a target path from the plurality of paths according to the actual situation of the path, and the number of the target paths is not greater than the number of all paths. Compared with the prior art, the monitoring of the service quality information of the whole network can be realized only by acquiring the service quality information of a small number of target paths, the number of the paths needing to acquire the service quality information is reduced, and the monitoring efficiency is improved.
In one possible implementation, each path includes at least one segment of sub-path, that is, each path is composed of at least one segment of sub-path. When acquiring traffic information of each of a plurality of paths, the first device may acquire traffic information of each of at least one segment of sub-paths constituting the path. When determining the congestion risk degree of each path according to the traffic information and the corresponding relationship of each path, the first device may determine the congestion risk degree of each sub-path according to the traffic information and the corresponding relationship of each sub-path in at least one sub-path constituting the path; and determining the congestion risk degree of each path according to the congestion risk degree of each section of sub-path. Therefore, the path is divided into at least one section of sub-path, and the monitoring efficiency can be further improved.
In one possible implementation, when determining the congestion risk level of each of the plurality of paths, the first device may sum the congestion risk levels of each of at least one segment of sub-paths constituting the path, and use the sum as the congestion risk level of the whole path.
In one possible implementation, after determining the congestion risk degree of each of the plurality of paths, the first device may select a path with the congestion risk degree greater than or equal to a threshold from the plurality of paths to determine as the target path, thereby obtaining the quality of service information of the target path.
In a possible implementation, the first device may further select a path with a congestion risk degree greater than or equal to a threshold value from the multiple paths, and determine the path with the higher congestion risk degree as the alternative path. 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, the first device may determine, according to an overlapping relationship between sub-paths included in the alternative paths, where the congestion risk degree is greater than or equal to the threshold, a target path for which the service quality information needs to be obtained, from the multiple alternative paths. The overlapping relationship is a relationship of mutual coverage among sub-paths with congestion risk degrees larger than or equal to a threshold value, wherein the sub-paths comprise multiple alternative paths. Therefore, the alternative paths are screened out from the multiple paths, the target paths are screened out from the alternative paths, the number of the target paths is further reduced through twice screening, and the monitoring efficiency is improved.
In one possible implementation, when selecting the target path from the multiple candidate paths, the first device may select, as the target path, a group of paths that is the least number of paths and includes all sub-paths with congestion risk degrees greater than or equal to a threshold value from the candidate paths. Therefore, on the premise of ensuring 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 a 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 an overlapping relationship between all sub-paths with congestion risk degrees greater than or equal to a threshold in the non-target path in the alternative paths and all sub-paths with congestion risk degrees greater than or equal to the threshold in the target path, and the packet loss rate of the target path. Thus, the packet loss rates of all paths in the alternative paths can be determined according to the packet loss rates of part of paths (i.e., the target path) in the alternative paths.
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 the apparatus includes an obtaining unit, configured to obtain traffic information of each of a plurality of paths; a first determining unit, configured to determine a congestion risk degree of each path according to traffic information of each path and a corresponding relationship, where the corresponding relationship is a corresponding relationship between the traffic information and the congestion risk degree, and the congestion risk degree of each path represents a congestion status of each path; and a second determining unit, configured to determine, by the first device, a target path that needs to acquire quality of service information from the multiple paths according to the congestion risk level of each path.
In one possible implementation, each path includes at least one segment of sub-path; the acquiring unit is configured to acquire traffic information of each segment of sub-path in at least one segment of sub-path of each path; the first determining unit is configured to determine a congestion risk degree of each segment of sub-path according to the traffic information and the corresponding relationship of each segment of sub-path; and determining the congestion risk degree of each path according to the congestion risk degree of each section of sub-path.
In a possible implementation, the first determining unit is configured to determine a sum of congestion risk degrees of at least one segment of sub-paths of each path as the congestion risk degree 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 obtained, a path of the plurality of paths for which the congestion risk degree is greater than or equal to a threshold.
In a possible implementation, the second determining unit is configured to determine, as an alternative path, a path including a sub-path of the plurality of paths whose congestion risk degree is greater than or equal to a threshold; 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 multiple alternative paths according to an overlapping relation between sub-paths included in the alternative paths and having the congestion risk degree 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 set of paths that is the fewest number of the alternative paths and includes all sub-paths with congestion risk degrees greater than or equal to a threshold in the alternative paths.
In a possible implementation, the service quality information includes a packet loss ratio, and the apparatus further includes a packet loss ratio calculation unit; the calculating unit is configured to obtain a 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 the congestion risk degrees larger than or equal to the threshold value in the non-target path in the alternative paths and all sub-paths with the 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, an embodiment of the present application provides a first device, where the first device includes: at least one processor coupled with at least one memory; the at least one processor is configured to execute the computer program or the instructions stored in the at least one memory, so that the first device performs the path determination method according to the first aspect.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium including instructions, a program, or code which, when executed on a computer, causes the computer to perform the method for determining a file by a path 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 method diagram of a path determination 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 method diagram of a target path determining method 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 disclosure;
fig. 8 is a schematic structural diagram of an apparatus 800 according to an embodiment of the present disclosure.
Detailed Description
The following describes a method and an apparatus for determining a path according to the conventional technology and embodiments of the present application with reference to the 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. The network device 101 is connected to the network device 103 and the network device 104, the network device 102 is connected to the network device 104 and the network device 105, the network device 106 is connected to the network device 103 and the network device 109, the network device 107 is connected to the network device 104, the network device 109 and the network device 110, the network device 108 is connected to the network device 105 and the network device 110, and the first device 111 is connected to all the 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) are 8 paths.
Then in the conventional monitoring method, the first device needs to acquire quality of service information for each of the 8 paths. As one of possible implementations, the first device may deploy a monitoring tool on the path. For example, the first device may deploy one or more network probes on a 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 transmitted along a path to the tail node. By analyzing the data packet received by the tail node, the relevant information of the path can be obtained.
Therefore, the conventional technology needs to deploy more monitoring tools for monitoring all paths. As the number of node devices in the network architecture increases, the number of paths to be monitored increases, and the number of network probes (or other monitoring tools) to be deployed by the first device also increases, which greatly increases the workload for acquiring network monitoring.
In order to solve the above problem, an embodiment of the present application provides a path determining method, which determines a possibility that a path is congested based on traffic information of the path, and selects a path with a high possibility that congestion occurs from multiple paths for monitoring, so as to obtain quality of service information of the path that may be congested 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 present application can be applied to the network architecture shown in fig. 1.
The first device 111 is a device such as a controller (e.g., a 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. 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, and network device 110 may be network devices, such as entity devices supporting a routing function, such as a router (router), a switch (switch), and the like, or servers deploying virtual routers or virtual switches, and are used for transmitting traffic flows.
Referring to fig. 2, which is a schematic diagram of a method for determining a path according to an embodiment of the present application, the method for determining a path according to the embodiment of the present application includes the following steps:
s201: the first device acquires traffic information of each of the plurality of paths.
In this embodiment of the present application, the first device may first obtain traffic information of each of a plurality of paths in the network topology. The path is a path for transmitting a traffic flow, and may be any one of the 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 also determine multiple paths according to an object to be monitored, and when the first path needs to monitor a specific area of the network architecture, the first device may obtain traffic information of all paths used for transmitting the service flow in the area. The specific area may be, for example, an Autonomous System (AS) in a network architecture. When the first device needs to monitor the AS1 in the network architecture, the first device may obtain traffic information of all paths in the AS 1.
In this embodiment, the traffic information of the path may include an actual traffic of the path, that is, an amount of data actually transmitted by the path per unit time. The actual traffic of a path may be in units of kilobit per second (Mbps), megabit per second (Mbps), etc. used to represent network bandwidth, representing the actual load of the path. In addition, the traffic information of the path may further include a theoretical traffic of the path, that is, a maximum data amount that can be transmitted by the path per unit time, which indicates a maximum load of the path. The units of theoretical flow of a path may coincide with the units of actual flow of a path.
In a practical application scenario, a path may be composed of at least one sub-path, that is, the path includes at least one sub-path. The sub-paths may be obtained by dividing the paths by the first device according to the network topology structure, or may be obtained by dividing the paths by a technician. In some possible implementations, a sub-path is a path connecting two adjacent network devices. For example, if network device 101 → network device 104 are taken as one sub-path segment and network device 104 → network device 102 are taken as another sub-path segment in fig. 1, then path a includes two sub-paths.
When the traffic information of the path is obtained, the first device may obtain the traffic information of each segment of sub-path, so as to obtain the traffic information of the entire path. Considering that most of the network devices are connected through the network interface, it is assumed that the network device at the head end of the sub-path transmits data to the network device of the next hop in the sub-path through the network interface a, and the network device at the tail end of the sub-path receives data transmitted by the network device of the previous hop in the sub-path through the network interface B. Then the data flowing out of network interface a corresponds to the data flowing into the sub-path and the data flowing into network interface B corresponds to the data flowing out of the sub-path. Therefore, the first device may obtain traffic information of the 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 first determine the network device at the head end of the sub-path and the network device at the tail end of the sub-path according to the topology of the network. After determining the network device at the head end of the sub-path, the first device may obtain traffic information of a network interface corresponding to the sub-path in the network device at the tail end of the sub-path and traffic information of a network interface corresponding to the sub-path in the network device at the head 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 example that the sub-path traffic information includes actual traffic and theoretical traffic of the sub-path, 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. The theoretical flow of the sub-path represents the maximum data volume which can be transmitted by the sub-path in unit time.
By analogy, when the path comprises a plurality of sections of sub-paths, the first device respectively obtains the flow information of each section of sub-path by adopting the method to obtain the flow information of the whole path.
Taking fig. 1 as an example for explanation, it is assumed that the network device 101 is connected to the network device 104 through the network interface a, and the network device 104 is connected to the network device 101 through the network interface B, the network device 102 through the network interface C, and the network device 107 through the network interface D. The specific connection manner can be seen in a partial schematic diagram of the network architecture shown in fig. 3.
When the first device 111 needs to obtain the traffic information of the path a, the first device 111 first determines that the path a includes two sub-paths, namely "network device 101 → network device 104" (hereinafter referred to as sub-path 1) and "network device 104 → 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 obtain traffic information of a network interface a of the network device 101 connected to the network device 104 as traffic information of the sub-path 1, and obtain traffic information of a network interface C as traffic information of the sub-path 2, that is, obtain traffic information of the path a.
Correspondingly, the first device 111 may also obtain traffic information of other paths by a similar method, so as to obtain traffic information of the whole path.
S202: and the first equipment determines the congestion risk degree of each path according to the flow 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 corresponding relationship. The corresponding relation is the corresponding relation between the flow information and the congestion risk degree, and the congestion risk degree represents the congestion state of the path. The congestion state may represent Quality of Service (QoS), where a poor congestion state represents poor QoS, and the path has a high packet loss rate and a long delay. Thus, for any path, the first device can determine the congestion risk degree of the path according to the corresponding relationship by only determining the traffic 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 a ratio of an actually used bandwidth of a path to a theoretical bandwidth, and may be, for example, a ratio of an actual traffic of the path to the theoretical traffic. If the bandwidth occupancy of the path is high, it indicates that the idle bandwidth of the path is low, and the possibility of congestion of the path is high, and the first device may determine that the congestion risk degree of the path is a high risk degree; if the bandwidth utilization of the path is low, it indicates that the idle bandwidth of the path is more, and the possibility of congestion of the path is low, and the first device may determine that the congestion risk level of the path is a low risk level. Then, the first device may first calculate the bandwidth occupancy of the path, and then determine the congestion risk degree of the path according to the bandwidth utilization. Therefore, the congestion risk degree is determined according to the bandwidth occupancy rate of the path, which is equivalent to predicting the risk of congestion according to the actual working condition of the path, and the obtained congestion risk degree has high accuracy and higher reference value.
In some possible implementations, the first device may numerically represent the congestion risk level of the path. For example, when the bandwidth occupancy of a path is lower than 40%, the probability of congestion occurring on the path 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 low, and the first device may 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 may determine that the congestion risk degree of the path is 2; when the bandwidth occupancy of the path is not lower than 75% and lower 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 the path is not lower than 85%, the probability that the path is congested is extremely high, and the first device may determine that the congestion risk degree of the path is 8. In this way, the size of the number directly represents the size of the probability of congestion occurring in the path.
In this embodiment, when a path is composed of at least one segment of sub-path, the first device may determine a congestion risk level of each segment of sub-path, thereby determining a congestion risk level of the entire path. Specifically, after obtaining the traffic information of each segment of sub-path, the first device may determine the congestion risk level of the sub-path one by one according to the traffic information of the sub-path and the corresponding relationship. For example, the first device may calculate a bandwidth occupancy rate of a certain segment of sub-path, and determine a congestion risk degree of the sub-path according to a correspondence between the bandwidth occupancy rate and the congestion risk degree.
Still taking fig. 1 as an example, it is assumed that the actual traffic of the sub-path 1 (i.e., "network device 101 → network device 104") is 5Mbps, and the theoretical traffic is 10 Mbps; the actual traffic for sub-path 2 (i.e., "network device 104 → network device 102") is 3Mbps, and the theoretical traffic is 10 Mbps. Then, the first device 111 may determine that the bandwidth occupancy of the sub-path 1 is 50%, and determine that the congestion risk degree 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 degree of the sub-path 2 is 0 according to the correspondence.
After determining the congestion risk degree of each segment of sub-path in the path, the first device may sum the congestion risk degrees of each segment of sub-path, and use the result obtained by the summation as the congestion risk degree of the path. Still taking fig. 1 as an example, assuming that the congestion risk level of sub-path 1 is 1 and the congestion risk level of sub-path 2 is 0, the congestion risk level of path a is 1+0 — 1.
S203: and the first equipment determines a target path needing to acquire the service quality information from the multiple paths according to the congestion risk degree of each path.
After determining the congestion risk degree of the path, the first device may select a target path according to the congestion risk degree of each path. The target path is a path with a high possibility of congestion, that is, a path with a high congestion risk level. 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 probability of congestion occurring on the non-target path is lower than the probability of congestion occurring on the target path, when congestion does not occur on the target path, the probability of congestion occurring on the non-target path is extremely low. 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 tool needs to be deployed on the target path, the monitoring tool does not need to be deployed on the non-target path, the number of paths needing to acquire the service quality information is reduced, namely the number of paths needing to be deployed with the monitoring tool 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, as the target path, one or more paths of the plurality of paths having the highest degree of risk of congestion. For example, the first device arranges the plurality of paths in order of the congestion risk degrees from high to low, and determines two paths having the highest congestion risk degrees as target paths.
In some possible implementations, a threshold of congestion risk level may be stored in the first device. The threshold value represents a critical value of the probability that the path is congested. The first device may compare the magnitude relationship between the congestion risk degree of the path and the threshold, and if the first device determines that the congestion risk degree of the path is greater than or equal to the threshold, it indicates that the path has a high possibility of sending congestion and the value of the quality of service information of the path is relatively high; if the first device determines that the congestion risk degree of the congested path of the path is less than the threshold value, the possibility that the path sends congestion is low, and the value of the service quality information of the path is relatively low. In this way, the first device can take the path with relatively high service quality information value as the target path and acquire the service quality information of the target path. That is, the first device may determine, as the target path, a path whose congestion risk degree is greater than or equal to the threshold value.
The description is given by way of example with reference to fig. 1. Assume that the congestion risk level of path a is 1, the congestion risk level of path B is 4, and the threshold for the congestion risk level is 3. Then, since the congestion risk level of the path a is smaller than the threshold, the possibility that the path a is congested is low, 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, the probability that the path B is congested is high, and the first device 111 may determine that the path B is the target path.
In some possible implementations, the threshold of the congestion risk level may be adjusted according to the nature of the network being monitored. If the requirement of the monitored network on congestion is strict, the threshold value of the congestion risk degree can be reduced; if the monitored network's requirements for congestion are not strict, the threshold for the congestion risk level may be raised appropriately.
In some possible implementations, the first device may obtain the qos information of the target path by sending a detection instruction. Specifically, the first device sends a detection instruction to a head node of the target path, wherein the detection instruction is used for instructing the head node to detect the service quality information of the target path. After receiving the detection instruction, the head node may obtain the qos information of the target path.
The description will be given by taking the example that the service quality information includes packet loss rate and time delay. 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 related to the path a. According to the detection instruction, the network device 101 may periodically transmit 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 is generated may be included in the data packet. The network device 102 may receive the data packet and provide the time at which the data packet was received to the first device 111. In this way, by analyzing whether the number of packets received by the network device 102 is consistent with the number of packets generated by the network device 101, the first device 111 may determine the packet loss rate of the path a; by analyzing the time that network device 102 receives the data packet and the time that network device 101 generates the data packet, first device 111 may determine the latency of path a.
In order to further improve monitoring efficiency, in this embodiment of the application, the first device may determine an alternative path from the multiple paths. If the number of the alternative paths is larger than 1, the first device may determine the target path 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 a magnitude relationship between the congestion risk degree of each path and a threshold, and determine, as the alternative path, a path with a congestion risk degree greater than or equal to the threshold among the multiple paths.
In some other implementations, the first device may first determine whether each 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 having a congestion risk degree 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 then determine a target path from the alternative path. Specifically, the first device may compare the congestion risk degree of each segment of sub-path of each path with the magnitude relationship of the threshold value, respectively. If the congestion risk degree of a certain sub-path is greater than or equal to the threshold, it indicates that the probability of congestion of the sub-path is high, and the value of the quality of service information of the risk sub-path is relatively high and belongs to a risk sub-path. The first device determines the path determined to include the sub-path as the alternate path. If a certain path does not include a risk sub-path, it means that the value of the qos information of each sub-path segment of the path is relatively low, and the value of the qos information of the entire path is also relatively low. The first device may determine the segment of the path as a non-alternative path.
Still taking fig. 1 as an example for explanation, it is assumed that the threshold value of the congestion risk degree is 2, the congestion risk degree of the sub-path 1 "network device 101 → network device 104" is 1, the congestion risk degree of the sub-path 2 "network device 104 → network device 105" is 1, the congestion risk degree of the sub-path 3 "network device 109 → network device 107" is 2, and the congestion risk degree of the sub-path 4 "network device 107 → network device 110" is 0.
Since the path a includes the sub-path 1 and the sub-path 2, and the congestion risk degrees of both the sub-path 1 and the sub-path 2 are less than the threshold, the first device 111 determines that the path a does not include a risk sub-path whose congestion risk degree is greater than or equal to the threshold, thereby determining the path a as a non-target path. Since path H includes sub-path 3 and sub-path 4, and the congestion risk degree of sub-path 3 is equal to the threshold, the first device 111 determines that sub-path 3 is a risk sub-path and path B is an included risk sub-path, thereby determining 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 select a path having a congestion risk degree greater than or equal to a threshold value from the plurality of paths, and then select a path including a risk sub-path from the paths as an alternative path. The embodiment of the present application does not limit this.
After determining the alternate paths, the first device may determine whether the number of alternate paths is greater than 1. If the number of alternative paths is equal to 1, the first device may determine the alternative paths as target paths. If the number of the alternative paths is greater than 1, the first device may determine the target path according to an overlapping relationship between sub-paths included in the alternative paths, where a congestion risk degree of the sub-paths is greater than or equal to a threshold. The overlap relationship represents the degree of coincidence of the risk sub-path between any two of the multiple candidate paths. For example, it may be whether a risk sub-path included in a certain alternative path is completely covered by a risk sub-path included in 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 some other alternative path. If the risk sub-path included in a certain alternative path is completely covered by the risk sub-path included in another alternative path, the service quality information indicating 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 taking fig. 1 as an example, if the path a includes the risk sub-path 1 "network device 101 → network device 102", and the path B includes the risk sub-path 1 and the risk sub-path 2 "network device 107 → network device 109". The first device may determine that the risk sub-path included by path a is completely covered by the risk sub-path included by 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 this embodiment of the application, the first device may select a set of paths that has the smallest number and includes all risk sub-paths from the multiple candidate paths, and determine the set of candidate paths as the target paths. In this way, the target path includes all sub-paths having a congestion risk level greater than or equal to the threshold and has a relatively small number, i.e., the number of paths for which quality of service information needs to be obtained is small. Therefore, on the premise of ensuring the accuracy of the monitoring result, the workload of acquiring the service quality information is reduced.
In some possible implementations, the first device may determine the target path from the alternative paths by solving a set of vectors. As a specific method, the target path determination method shown in fig. 4 may be used, and the method includes:
s401: and the first equipment generates a vector corresponding to each alternative path.
In this embodiment of the application, the first device may generate a vector corresponding to each candidate path in the multiple candidate paths according to the correspondence between the candidate 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 rank all risk sub-paths to determine the risk sub-path corresponding to each element in the vector. Then, the first device may determine, according to the correspondence between the candidate path and the risk sub-path, values of elements corresponding to the risk sub-paths in the vector, and obtain a vector corresponding to the candidate path. For example, assume that alternate path A includes risk sub-path a and does not include risk sub-path b. The first device may determine that the value of the element corresponding to risk sub-path a in the vector corresponding to alternative path a is 1 and the value of the element corresponding to risk sub-path b is 0.
The network architecture shown in fig. 1 is still used as an example for explanation. Assume 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 is 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 degree provided in the foregoing embodiment, the congestion risk degree of the sub-path 5 is 1, the congestion risk degree of the sub-path 6 is 4, the congestion risk degree of the sub-path 7 is 2, and the congestion risk degrees of the remaining sub-paths are all 0. In this way, the first device may determine that three risk sub-paths including sub-path 5, sub-path 6, and sub-path 7 exist in the network, and determine that six paths including path B, path C, path D, path E, path F, and path H are alternative paths, and the congestion risk degrees of path a and path G are less than a threshold and belong to non-alternative paths.
Since there are three segments of 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, the path corresponds to 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 the path B (network device 101 → network device 103 → network device 106 → network device 109) includes the sub-path 5 (network device 103 → network device 106) and does not include the sub-path 6 (network device 104 → network device 107) and the sub-path 7 (network device 107 → network device 110), the first device may determine that the column vector corresponding to the path B has an element in the first row of 1, an element in the second row of 0, and an element in the third row of zero, so as to obtain that the column vector B corresponding to the path B is [ 100 ═ B]T。
In a similar way, the first device may determine that the column vector C corresponding to the path C is [ 010 ═]TThe column vector D corresponding to the path D is [ 011 ]]TThe column vector E corresponding to the path E is [ 010 ═ c]TThe column vector F corresponding to the path F is [ 010 ═ c]TThe column vector H corresponding to the path H is [ 001 ═ c]T。
It should be noted that, if the candidate path does not include the risk sub-path, the column vector corresponding to the candidate path is [ 000 ]]T. Of course, the first device may also determine the path as the non-target path without calculating the column vector corresponding to the path. In addition, the vector is determined as a column vector, and means such as values 0 and 1 of elements in the vector are only one specific implementation manner provided by the embodiment of the application. In practical application, the types of the vectors and the specific values of the elements in the vectors are adjusted according to requirements. The embodiments of the present application do not limit this.
S402: and the first equipment determines a vector group corresponding to a plurality of candidate paths according to the vector corresponding to each candidate path and determines a maximum linear irrelevant group of the vector group.
After determining vectors corresponding to the multiple candidate paths, the first device may determine, from the vectors corresponding to the multiple candidate paths, a vector group corresponding to the multiple candidate paths. For example, the first device may arrange column vectors corresponding to each of the multiple candidate paths in order to obtain a vector group.
The network architecture shown in fig. 1 is still used as an example for explanation. Assuming that the column vectors corresponding to each alternative path are as shown in step S401, the obtained vector set can be represented as
Figure BDA0002745406540000101
The first column of the vector group is a column vector B corresponding to the path B, the second column is a column vector C corresponding to the path C, the third column is a column vector D corresponding to the path D, the fourth column is a column vector E corresponding to the path E, the fifth column is a column vector F corresponding to the path F, and the sixth column is a column vector H corresponding to the path H. The element of the first row and the first column of the matrix corresponding to the vector group represents the corresponding relationship between the path B and the sub-path 5, and the element has a value of 1 because the path B includes the sub-path 5; the element in the first row and the second column of the vector group represents the corresponding relationship between the path B and the sub-path 6, and the value of the element is 0 because the path B does not include the sub-path 6; the element in the second row and the second column of the vector group represents the correspondence of path C to 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 a largely linearly independent set of the set of vectors. The maximum linearly independent set includes at least two linearly independent column vectors, and any other one of the set of vectors is linearly dependent on the maximum linearly independent set. That is, the largely linearly independent set 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 used as an example for explanation. Assuming that the column vectors corresponding to the candidate paths are as shown in step S401, the obtained maximum linear independence group can be expressed as:
Figure BDA0002745406540000102
the maximum linear irrelevant 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 the largely linearly independent set is 3, consistent with the number of risk sub-paths in the network.
It should be noted that in practical applications, the vector set often has a plurality of extremely large linearly independent sets. For this case, the first device may select any one of the maximum linear independent groups for the subsequent steps, or may determine the maximum linear independent group according to the complexity of the subsequent calculation. The embodiments of the present application do not limit this.
S403: and the first equipment determines the alternative paths corresponding to the vectors in the maximum linear independence group as target paths.
After the maximum linear irrelevance group is determined, the first device may determine the alternative paths corresponding to each vector in the maximum linear irrelevance group as target paths, so as to determine a path for which service quality information needs to be acquired.
Since the target path is determined according to the maximum linearly independent set of full rank, there are no all-zero rows (or all-zero columns) in the vector set corresponding to the target path. And each row (or each column) element represents the corresponding situation of each path and risk sub-path, so that for any section of risk sub-path, the target path includes the risk sub-path, that is, the sub-path included by the target path can cover all the risk sub-paths. Therefore, acquiring the qos information of the target path is equivalent to acquiring the qos information of the risk sub-path, and can function to acquire the qos information of the entire network.
The network architecture shown in fig. 1 is still used as an example for explanation. Assuming that column vectors corresponding to the candidate paths are as shown in step S401, the first device may determine that the target paths are path B, path C, and path H, thereby obtaining quality of service information of path B, path C, and 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 alternative paths according to the packet loss rate of the target path. The packet loss rate is a ratio of the number of lost packets to the total number of transmitted packets, and is used to measure the integrity of the path transmission service flow.
Specifically, the first device may first obtain a packet loss rate of the target path. For example, the first device may deploy a network probe at a head node of the target path, and detect, by using the network probe, a packet loss rate of each entry label path. After determining the packet loss rate of the target path, the first device may analyze the risk sub-path included in the non-target path in the alternative paths and the risk sub-path included in the target path, determine an overlapping relationship between the non-target path and the target path in the alternative paths, and then determine the packet loss rate of the non-target path in the alternative paths according to the overlapping relationship and the packet loss rate of the target path. And the overlapping relation between the non-target path and the target path in the alternative paths indicates that the risk sub-paths included by the non-target path in the alternative paths are covered by the risk sub-paths included by the target paths.
According to the foregoing description of the embodiment, it can be seen that the vector group formed by the vectors corresponding to the target path is a maximum linearly 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 path is linearly related to the vector corresponding to any one non-target path in the candidate paths. Therefore, the vector corresponding to any one of the alternative paths that is not the target path may be obtained by combining the vectors corresponding to one or more target paths (the combination manner includes addition and/or subtraction), that is, the risk sub-path included in any one of the alternative paths that is not the target path may be obtained by combining the risk sub-paths included in one or more target paths.
Assuming that a path is composed of multiple sub-paths, the throughput rate of the path (i.e. the ratio of the number of packets that are not lost to the total number of packets sent, and the sum of the throughput rate and the packet loss rate is 1) is the product of the throughput rates of each sub-path. Can be formulated as:
Figure BDA0002745406540000111
wherein L ispIndicates the packet loss rate, L, of the pathjAnd (3) representing the packet loss rate of the jth sub-path in the path, wherein s represents that the path consists of s sub-paths.
Therefore, the passing rate of some non-target path in the alternative paths is equal to the product of the passing rates of one or more target paths constituting the target path. Then, the first device may calculate a passing rate of the target path according to the packet loss rate of the target path, and multiply the passing rates of one or more target paths to obtain a passing rate of the non-target path, so as to determine the passing rate of the non-target path. Therefore, the packet loss rates 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 the accuracy of the detection result, 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 used as an example for explanation. Assume that packet loss rates corresponding to sub-paths are as shown in fig. 5, and the target path is path B, path C, and path H, where the packet loss rate of path B is 1%, the packet loss rate of path C is 2%, and the packet loss rate of 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-path included in path D may be obtained by adding the risk sub-paths included in path C and path H. Then, the packet loss rate L of the path DD1- (1-0.02) × (1-0.03) ═ 4.94%. Also, the packet loss rate L of the path E can be determinedE1- (1-0.02) ═ 2%; determining packet loss rate L of path FF＝1-(1-0.02)*(1-0.03)＝4.94％。
In some possible implementation manners, the first device may further determine, according to the packet loss rate of the target path and the risk sub-paths included in the target path, the packet loss rate of each risk sub-path (combination of the risk sub-paths), so as to determine the packet loss rate of the non-target path in the alternative path.
Referring to fig. 6, an 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 determination apparatus 600 includes an acquisition unit 601, a first determination unit 602, and a second determination unit 603. 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 obtaining unit 601 is configured to obtain traffic information of each of the plurality of paths.
A first determining unit 602, configured to determine a congestion risk level of each path according to traffic information of each path and a corresponding relationship, where the corresponding relationship is a corresponding relationship between the traffic information and the congestion risk level, and the congestion risk level of each path represents a congestion status of each path.
A second determining unit 603, configured to determine, by the first device, a target path that needs to obtain quality of service information from the multiple paths according to the congestion risk level of each path.
For a specific execution process, reference is made to the detailed description of the corresponding steps in the embodiment shown in fig. 2, which is not repeated here.
It should be noted that the division of the unit in the embodiment of the present application is schematic, and is only a logic function division, and there may be another division manner in actual implementation. Each functional unit in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. For example, in the above embodiments, the acquiring unit and the processing unit may be the same unit or different units. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
Fig. 7 is a schematic structural diagram of an apparatus 700 according to an embodiment of the present disclosure. The path determining apparatus 600 in the foregoing may be implemented by the first device shown in fig. 7. Referring to fig. 7, the device 700 comprises at least one processor 701, a communication bus 702 and at least one network interface 704, optionally the device 700 may further comprise a memory 703.
The processor 701 may be a general processing unit (CPU), an application-specific integrated circuit (ASIC), or one or more Integrated Circuits (ICs) for controlling the execution of programs according to the present disclosure. The processor may be configured to process the configuration file to implement the path determination method provided in the embodiment 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 traffic information and the corresponding relation of each path, wherein the corresponding relation is the corresponding relation of the traffic information and the congestion risk degree, and the congestion risk degree of each path reflects the congestion condition of the possibility of congestion of each path; and determining a target path needing to acquire the service quality information from the plurality of paths according to the congestion risk degree of each path.
The communication bus 702 is used to transfer information between the processor 701, the network interface 704, and the 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 may store static information and instructions, the Memory 703 may also be a Random Access Memory (RAM) or other type of dynamic storage device that may store information and instructions, a compact disk 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.), a magnetic disk storage medium or other magnetic storage device, 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 coupled to the processor 701 via a communication bus 702. The memory 703 may also be integrated with the processor 701.
Optionally, the memory 703 is used for storing program codes or instructions for executing the present application, and is controlled by the processor 701 to execute. The processor 701 is used 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 present solution, in which case the processor 701 need not read the program code or instructions into the memory 703.
The network interface 704 may be a transceiver or the like for communicating with other devices or a communication network, such as an ethernet, a Radio Access Network (RAN), a Wireless Local Area Network (WLAN), or the like. In this embodiment, the network interface 704 may be configured to receive messages sent by other nodes in the segment routing network, and may also send messages to other nodes in the segment routing network. The network interface 704 may be an ethernet (ethernet) interface, a Fast Ethernet (FE) interface, or a Gigabit Ethernet (GE) interface.
In particular implementations, device 700 may include multiple processors, such as processor 701 and processor 407 shown in FIG. 7, for one embodiment. Each of these processors may be a single-core (single-CPU) processor or 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 disclosure. The first device in fig. 2 may be implemented by the device shown in fig. 8. Referring to the device architecture diagram shown in fig. 8, a device 800 includes a main 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 referred to as a Main Processing Unit (MPU) or a route processor card (route processor card), includes a CPU and a memory, and is responsible for controlling and managing various components in the device 800, including routing computation, device management, and maintenance functions. An interface board is also called a Line Processing Unit (LPU) or a line card (line card) and is used for receiving and transmitting messages. In some embodiments, the master control board communicates with the interface board or the interface board communicates with the interface board through a bus. In some embodiments, the interface boards communicate with each other through a switch board, in which case the device 800 also includes a switch board, the switch board is communicatively connected to the main control board and the interface boards, the switch board is used for forwarding data between the interface boards, and the switch board may also be referred to as a Switch Fabric Unit (SFU). The interface board includes a CPU, memory, a forwarding engine, and Interface Cards (ICs), which may include one or more network interfaces. The network interface can be an Ethernet interface, an FE interface or a GE interface. 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 packet based on a forwarding table stored in the memory, and if a destination address of the received packet is the IP address of the device 800, send the packet to a 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 searched according to the destination, and if the next hop and the outbound interface corresponding to the destination address are found from the forwarding table, the message is forwarded to the outbound interface corresponding to the destination address. The forwarding engine may be a Network Processor (NP). The interface card is also called a daughter card and can be installed on an interface board and is responsible for converting photoelectric signals into data frames, and forwarding the data frames to a forwarding engine for processing or an interface board CPU after validity check is carried out on the data frames. In some embodiments, the CPU may also perform the functions of a forwarding engine, such as implementing 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 a 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.
Optionally, the system on a chip may have one or more processors. The processor may be implemented by hardware or by 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. Optionally, the memory in the system-on-chip may also be one or more. The memory may be integrated with the processor or may be separate from the processor, which is not limited in this application. For example, the memory may be a non-transitory processor, such as a read only memory ROM, which may be integrated with the processor on the same chip or separately disposed on different chips, and the type of the memory and the arrangement of the memory and the processor are not particularly 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 (DSP), a Micro Controller Unit (MCU), a Programmable Logic Device (PLD) or other integrated chips.
It will be appreciated that the steps of the above described method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor.
Embodiments of the present application further provide a computer-readable storage medium, which includes instructions that, when executed on a computer, cause the computer to perform the path determination method performed by the first device, provided by the above method embodiments.
Embodiments of the present application also provide a computer program product containing instructions, which when run on a computer, cause the computer to perform the path determination method performed by the first device, provided by the above method embodiments.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims of the present application and in the drawings described above, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or 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 is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one type of logical module division, and other division manners may be available in actual implementation, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed 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 can be obtained according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, each module unit in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a hardware form, and can also be realized in a software module unit form.
The integrated unit, if implemented as a software module unit and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to 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), a magnetic disk or an optical disk, and other various media capable of storing program codes.
Those skilled in the art will recognize that, in one or more of the examples described above, the functions described in this invention may be implemented in hardware, software, firmware, or any combination thereof. When implemented in software, the 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-described embodiments are intended to explain the objects, aspects and advantages of the present invention in further detail, and it should be understood that the above-described embodiments are merely exemplary embodiments of the present invention.
The above embodiments are only used for illustrating the technical solutions 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 solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present application.

Claims (16)

1. A method for 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 equipment determines the congestion risk degree of each path according to the traffic information and the corresponding relation of each path, wherein the corresponding relation is the corresponding relation of the traffic information and the congestion risk degree, and the congestion risk degree of each path reflects the congestion condition of each path;
and the first equipment determines a target path needing to acquire the service quality information from the multiple paths according to the congestion risk degree of each path.
2. The method according to claim 1, wherein each path comprises at least one sub-path;
the acquiring, by the first device, traffic information of each of the plurality of paths includes:
the first equipment acquires the flow information of each section of sub-path in at least one section of sub-path of each path;
the determining, by the first device, the congestion risk degree of each path according to the traffic information and the corresponding relationship of each path includes:
the first equipment 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 sub-path.
3. The method of claim 2, wherein the determining, by the first device, the congestion risk level of each path according to the congestion risk level of each sub-path comprises:
and the first equipment determines the sum of the congestion risk degrees of at least one section of sub-path of each path as the congestion risk degree of each path.
4. The method according to any one of claims 1 to 3, wherein the determining, by the first device, a target path from the plurality of paths for which quality of service information needs to be obtained according to the congestion risk level of each path includes:
and the first equipment determines the path of which the congestion risk degree is greater than or equal to a threshold value in the plurality of paths as a target path needing to acquire the service quality information.
5. The method according to claim 2 or 3, wherein the determining, by the first device, a target path for which quality of service information needs to be obtained from the plurality of paths according to the congestion risk level of each path includes:
the first equipment determines paths including sub-paths with the congestion risk degree larger than or equal to a threshold value in the paths as alternative paths;
and in response to that the number of the alternative paths is greater than 1, the first device determines a target path needing to acquire service quality information from the multiple alternative paths according to an overlapping relationship between sub-paths included in the alternative paths and having the congestion risk degree greater than or equal to a threshold value.
6. The method according to claim 5, wherein the determining, by the first device, a target path that needs to obtain quality of service information from the multiple alternative paths according to the sub-path included in each of the alternative paths and having the congestion risk level greater than or equal to a threshold includes:
and the first equipment determines a group of paths with the least number in the alternative paths and including all sub-paths with congestion risk degrees larger than or equal to a threshold value in the alternative paths as target paths.
7. The method according to claim 5 or 6, wherein the quality of service information comprises a packet loss rate, and the method further comprises: the first equipment acquires the packet loss rate of the target path;
the first device determines the packet loss rate of the non-target path according to the overlapping relationship 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.
8. A path determination apparatus, the apparatus at a first device, comprising:
an obtaining unit, configured to obtain traffic information of each of a plurality of paths;
a first determining unit, configured to determine a congestion risk degree of each path according to traffic information of each path and a corresponding relationship, where the corresponding relationship is a corresponding relationship between the traffic information and the congestion risk degree, and the congestion risk degree of each path represents a congestion status of each path;
and a second determining unit, configured to determine, by the first device, a target path that needs to acquire quality of service information from the multiple paths according to the congestion risk level of each path.
9. The apparatus according to claim 8, wherein each of the paths respectively comprises at least one sub-path;
the acquiring unit is configured to acquire traffic information of each segment of sub-path in at least one segment of sub-path of each path;
the first determining unit is configured to determine a congestion risk degree of each segment of sub-path according to the traffic information and the corresponding relationship of each segment of sub-path; and determining the congestion risk degree of each path according to the congestion risk degree of each section of sub-path.
10. The apparatus of claim 9,
the first determining unit is configured to determine a sum of congestion risk degrees of at least one segment of sub-paths of each path as the congestion risk degree of each path.
11. The apparatus according to any one of claims 8 to 10,
the second determining unit is configured to determine, as a target path for which quality of service information needs to be acquired, a path of the multiple paths for which the congestion risk degree is greater than or equal to a threshold.
12. The apparatus of claim 9 or 10,
the second determining unit is configured to determine, as an alternative path, a path including a sub-path of the plurality of paths whose congestion risk degree is greater than or equal to a threshold; 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 multiple alternative paths according to an overlapping relation between sub-paths included in the alternative paths and having the congestion risk degree greater than or equal to a threshold value.
13. The apparatus of claim 12,
the second determining unit is configured to determine, as the target path, a group of paths that has the least number of alternative paths and includes all sub-paths with congestion risk degrees greater than or equal to a threshold in the alternative paths.
14. The apparatus according to claim 12 or 13, wherein the service quality information comprises a packet loss ratio, and the apparatus further comprises a packet loss ratio calculating unit;
the calculating unit is configured to obtain a 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 the congestion risk degrees larger than or equal to the threshold value in the non-target path in the alternative paths and all sub-paths with the congestion risk degrees larger than or equal to the threshold value in the target path and the packet loss rate of the target path.
15. A first device, characterized in that the device comprises: at least one processor coupled with 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-7.
16. A computer-readable storage medium comprising instructions, programs, or code which, when executed on a computer, cause the computer to perform the path determination method of any of claims 1-7.
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 true CN114500357A (en) 2022-05-13
CN114500357B 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 (8)

* 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
US20170332391A1 (en) * 2014-11-18 2017-11-16 Nec Corporation 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
CN114500357B (en) 2024-02-09

Similar Documents

Publication Publication Date Title
US8937881B2 (en) Electronic device, system on chip and method for monitoring a data flow
JP4796668B2 (en) Bus control device
TWI389475B (en) Dynamic load balancing of fibre channel traffic
CN110233798B (en) Data processing method, device and system
EP3238392B1 (en) Technologies for medium grained adaptive routing in high-performance network fabrics
US9904566B2 (en) Selecting virtual machine placement by computing network link utilization and link variance
US20090323540A1 (en) Electronic device, system on chip and method for monitoring data traffic
JP6191833B2 (en) Communication device, router having communication device, bus system, and circuit board of semiconductor circuit having bus system
CN108401490B (en) Network performance measuring method and detection equipment
CN113206789A (en) Path detection method, path detection device and computer storage medium
CN110971445A (en) Network OAM method and device
JP2014168283A (en) Communication system, network monitoring device, and network monitoring method
CN102404170A (en) Detection method, device and system of message loss
CN114500357B (en) Path determination method and device
CN112332956B (en) Information sharing method and device in redundant network and computer storage medium
CN115277504A (en) Network traffic monitoring method, device and system
CN113660677B (en) Maximum error independent path calculation method of weighted time-varying network under consumption limit
CN107592269B (en) Method and network node for transmitting load information of path
JP2015037198A (en) Bus recovery control device
CN117478580A (en) Method for sending load information, method and device for sending message
US20230171180A1 (en) Data processing method, packet sending method, and apparatus
Trois et al. Softening up the network for scientific applications
CN109005078B (en) Routing strategy generation method and device and computer readable storage medium
CN108075939B (en) Network quality detection system and method
CN114124753A (en) Message sending method and equipment

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