CN114826991B - Method and device for detecting congestion link under network slice and electronic equipment - Google Patents
Method and device for detecting congestion link under network slice and electronic equipment Download PDFInfo
- Publication number
- CN114826991B CN114826991B CN202210365371.4A CN202210365371A CN114826991B CN 114826991 B CN114826991 B CN 114826991B CN 202210365371 A CN202210365371 A CN 202210365371A CN 114826991 B CN114826991 B CN 114826991B
- Authority
- CN
- China
- Prior art keywords
- link
- underlying
- congestion
- path
- determining
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 55
- 238000001514 detection method Methods 0.000 claims abstract description 20
- 238000004590 computer program Methods 0.000 claims description 12
- 238000004891 communication Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000010276 construction Methods 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 238000010606 normalization Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- 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
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0882—Utilisation of link capacity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- 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
- H04L43/0823—Errors, e.g. transmission errors
- H04L43/0829—Packet loss
-
- 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
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
-
- 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/50—Testing arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/11—Identifying congestion
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 invention provides a method, a device and electronic equipment for detecting a congestion link under a network slice, and the method, the device and the electronic equipment are used for determining a virtual path with congestion; determining a reference congestion underlying path set based on the virtual paths where congestion occurs; determining a characteristic value of each underlying link contained in the reference congestion underlying path set; determining at least one reference congestion underlying link set based on the characteristic value of each underlying link; a target set of congested links is determined among the at least one reference set of congested links. The method, the device and the electronic equipment for detecting the congestion link under the network slice realize the detection of the congestion link under the network slice.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for detecting a congestion link under a network slice, and an electronic device.
Background
With the construction and application of 5G networks, demand for power communication networks by electric power companies is rapidly increasing. To solve the problem of rapid increase in the resource demand of the communication network, the network slicing technology has become a key network technology used by the electric company. After the network is sliced, the bottom layer network is responsible for providing network resources for the virtual network, and the reliability of the virtual network is an important content of the service quality of the bottom layer network. The quality of service of the underlying network can be evaluated from two dimensions. The first dimension is that the underlying network operator monitors and manages the underlying network from a network management perspective. The second dimension is the view of virtual network developers from traffic management, monitoring and managing the underlying network. To improve the reliability of the virtual network, the underlying network operators need to quickly and accurately locate the underlying links where congestion occurs.
In the prior art, many research results have been achieved in the aspect of congestion link detection of the traditional network. However, under the network slicing, the monitoring capability of the virtual network developer to the underlying network becomes weak, and the relationship between the virtual network and the underlying network is more complex, so that the problem of congestion link detection under the network slicing cannot be solved in the prior art. Therefore, the invention provides a method for detecting the congestion bottom layer link under the network slice.
Disclosure of Invention
Aiming at the problems existing in the prior art, the invention provides a method, a device and electronic equipment for detecting a congestion link under a network slice.
The invention provides a method for detecting a congestion link under a network slice, which comprises the following steps:
determining a virtual path where congestion occurs;
determining a reference congestion underlying path set based on the virtual paths where congestion occurs;
determining a characteristic value of each underlying link contained in the reference congestion underlying path set;
determining at least one reference congestion underlying link set based on the characteristic value of each underlying link;
a target set of congested links is determined among the at least one reference set of congested links.
According to the method for detecting the congestion link under the network slice provided by the invention, the method for determining the reference congestion bottom layer path set based on the virtual path with congestion comprises the following steps:
Determining the reference congestion bottom-layer path set based on a bearer relationship between a virtual link and a bottom-layer link and the virtual path where congestion occurs; the bearing relation between the virtual link and the bottom link is used for indicating whether the virtual link contains the bottom link or not.
According to the method for detecting the congestion link under the network slice, the reference congestion bottom layer path set comprises at least one reference congestion bottom layer path;
the determining the characteristic value of each underlying link included in the reference congestion underlying path set includes:
and determining the historical congestion contribution degree of each bottom link, the average packet loss rate of each bottom link and the relation between each bottom link and the reference congestion bottom path, wherein the historical congestion contribution degree is contained in the reference congestion bottom path set.
According to the method for detecting the congestion link under the network slice provided by the invention, the determining the historical congestion contribution degree of each bottom link, the average packet loss rate of each bottom link and the relation between each bottom link and the reference congestion bottom path contained in the reference congestion bottom path set comprises the following steps:
Determining a relationship of each of the underlying links and the reference congested underlying path based on equation (1);
determining an average packet loss rate of each bottom link based on a formula (2);
determining a historical congestion contribution for each of the underlying links based on equation (3);
wherein,representing the relationship of an underlying link and a reference congested underlying path, alpha representing the inclusion of an underlying link e j Reference number of congested underlying paths, +.>The representation contains the underlying link e j Reference congestion lower layer path +.>The number of bottom links in>Representing the underlying link e j Average packet loss rate of ∈j->The representation contains the underlying link e j Reference congestion underlying path P of (c) r Packet loss rate of->Representing the underlying link e at time t j Is +.>Representing the underlying link e at time t-1 j Is lambda t And a penalty value indicating that the underlying link is congested at the time t.
According to the method for detecting the congestion link under the network slice provided by the invention, the determining at least one reference congestion underlying link set based on the characteristic value of each underlying link comprises the following steps:
constructing a relation model between each bottom link and a bottom path containing the bottom link; the relation model comprises an upper node, a lower node and a connecting line between the upper node and the lower node; the upper node is used for indicating the average packet loss rate of the reference congestion bottom layer path, the lower node is used for indicating the historical congestion contribution degree of each reference congestion bottom layer link, and the connecting line is used for indicating the probability of congestion of the bottom layer path containing the reference congestion bottom layer link;
Calculating the value of the upper node, the value of the lower node and the value of a connecting line between the upper node and the lower node based on the characteristic value of each bottom link;
at least one of the reference congestion underlying link sets is determined based on the value of the underlying node.
According to the method for detecting the congestion link under the network slice provided by the invention, the calculating of the value of the upper node, the value of the lower node and the value of the connecting line between the upper node and the lower node based on the characteristic value of each bottom link comprises the following steps:
determining the value of the upper node based on the average packet loss rate of each of the bottom links;
determining a value of the lower node based on the historical congestion contribution of each lower link;
a value of a connection between the upper node and the lower node is determined based on a relationship of each underlying link and each of the reference congested underlying paths.
According to the method for detecting the congestion link under the network slice provided by the invention, the determining the target congestion bottom layer link set in the at least one reference congestion bottom layer link set comprises the following steps:
determining an interpretation capability for each of the reference congestion underlying link sets based on equation (4);
Determining a target congestion underlying link set based on the interpretation capability of each reference congestion underlying link set;
wherein, abilityness (DB, P O ) Representing the interpretation capability of the reference congestion underlying link set, DB representing the reference congestion underlying link set, P O Representing a reference set of congested underlying paths, p (e i ) Representing the probability of congestion occurring for a reference congested underlying link, P (P r |e i ) Representing the probability of congestion occurring for the underlying path containing the reference congested underlying link.
The invention also provides a device for detecting the congestion link under the network slice, which comprises the following steps:
a first determining unit configured to determine a virtual path in which congestion occurs;
a second determining unit, configured to determine a reference congestion bottom layer path set based on the virtual path where congestion occurs;
a third determining unit, configured to determine a feature value of each underlying link included in the reference congestion underlying path set;
a fourth determining unit, configured to determine at least one reference congestion underlying link set based on a feature value of each underlying link;
and a fifth determining unit, configured to determine a target congestion bottom link set from the at least one reference congestion bottom link set.
The invention also provides an electronic device comprising a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the method for detecting the congestion link under any network slice when executing the program.
The present invention also provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method of congestion link detection under a network slice as described in any one of the above.
The invention also provides a computer program product comprising a computer program which when executed by a processor implements a method of congestion link detection under a network slice as described in any one of the above.
According to the method, the device and the electronic equipment for detecting the congestion link under the network slice, the reference congestion bottom layer path set is determined based on the congestion virtual path, the characteristic value of each bottom layer link in the reference congestion bottom layer path set is further determined, at least one reference congestion bottom layer link set is determined based on the characteristic value of the bottom layer link, and finally the target congestion bottom layer link set is determined in the at least one reference congestion bottom layer link set, so that the congestion link under the network slice is detected.
Drawings
In order to more clearly illustrate the invention or the technical solutions of the prior art, the following description will briefly explain the drawings used in the embodiments or the description of the prior art, and it is obvious that the drawings in the following description are some embodiments of the invention, and other drawings can be obtained according to the drawings without inventive effort for a person skilled in the art.
Fig. 1 is a flow chart of a method for detecting a congestion link under a network slice provided by the invention;
fig. 2 is a schematic structural diagram of a congestion link detection device under a network slice provided by the present invention;
fig. 3 is a schematic structural diagram of an electronic device provided by the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present invention more apparent, the technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The execution subject of the present invention may be an electronic device having a computing function.
The method for detecting a congested link under a network slice according to the present invention is described below with reference to fig. 1.
Fig. 1 is a flow chart of a method for detecting a congestion link under a network slice, as shown in fig. 1, where the method for detecting a congestion link under a network slice includes the following steps:
and 101, determining a virtual path with congestion.
Under the network slicing, a network operator adopts a network virtualization technology to divide basic network resources into a bottom layer network and a virtual network. After the network is modified by adopting the network slicing technology, the bottom network operator can concentrate on the construction and operation work of the bottom network. Virtual network developers may be focused on engaging in rich application development. Thus, the reliability of the underlying network is an important concern for both the underlying network operators and the virtual network developers.
Wherein, under the network slice, the network of the operator is called as an underlying network, the underlying network comprises an underlying node and an underlying link, and the underlying network uses G S (N S ，E S ) Representing, the underlying node uses n i ∈N S Representing the underlying link usage e j ∈E S And (3) representing. To deploy various services, service providers need to lease resources of the underlying network. The slice network carrying the traffic is called virtual network, using G V (N V ，E V ) Representing a virtual network comprising virtual nodes and virtual links, the virtual nodes usingRepresenting virtual link usage->And (3) representing. Use->Representing a virtual path.
Specifically, the invention obtains the packet loss data of each virtual path by using an end-to-end detection technology, and is based on the packet loss number of each virtual path A virtual path is determined where congestion occurs. For example, the number of the cells to be processed,h 3 →h 10 representing a virtual path numbered 5, the detection of which is from host h 3 Send out, destination host is h 10 。
Step 102, determining a reference congestion bottom layer path set based on the virtual path with congestion. Specifically, there is a one-to-one correspondence between virtual nodes and underlying nodes. In order to infer the congestion condition of each virtual path, it is necessary to analyze which underlying links the virtual path involves first, so that based on the bearing relationship between the virtual link and the underlying links, the underlying path traversed by each virtual path is searched, and each underlying path is put into a reference congestion underlying path set to form the reference congestion underlying path set.
Step 103, determining a characteristic value of each underlying link included in the reference congestion underlying path set.
Specifically, the characteristic values of the underlying links include the historical congestion contribution of the underlying links, the average packet loss rate of each underlying link, and the relationship of each underlying link and the reference congested underlying path.
The historical congestion contribution degree of the bottom link is determined based on the congestion contribution degree of the bottom link at the last moment and the penalty value of the bottom link for congestion at the current moment.
The average packet loss rate for each underlying link is determined based on the reference congestion underlying path packet loss rate for the underlying link and the number of reference congestion underlying links for the underlying link.
The relationship of each underlay link and the reference congested underlay path is determined based on the number of reference congested underlay paths containing the underlay link and the number of underlay links in the reference congested underlay path containing the underlay link.
Step 104, determining at least one reference congestion underlying link set based on the characteristic value of each underlying link.
Specifically, a relation model between an underlying link and an underlying path containing the underlying link is built based on Bayesian bipartite graph theory; then calculating the values of parameters in the relation model based on the characteristic values of each bottom link; and finally, determining at least one reference congestion underlying link set based on the values of the parameters in the relational model.
Step 105, determining a target congestion bottom link set in the at least one reference congestion bottom link set.
Specifically, in order to determine the target congestion underlying link set from the reference congestion underlying link set, the present invention adopts a maximum interpretation capability policy for solution. The maximum interpretation capability strategy is to construct multiple reference congestion underlying link sets, calculate the interpretation capability of the multiple reference congestion underlying link sets, and the reference congestion underlying link set with the maximum interpretation capability is the final determined target congestion underlying link set.
The method for detecting the congestion link under the network slice provided by the invention is characterized in that the reference congestion bottom layer path set is determined based on the congested virtual path, the characteristic value of each bottom layer link in the reference congestion bottom layer path set is further determined, at least one reference congestion bottom layer link set is determined based on the characteristic value of the bottom layer link, and finally the target congestion bottom layer link set is determined in at least one reference congestion bottom layer link set, so that the detection of the congestion link under the network slice is realized.
Optionally, the method for detecting a congestion link under a network slice provided by the present invention, where the determining a reference congestion bottom layer path set based on the virtual path with congestion includes:
determining the reference congestion bottom-layer path set based on a bearer relationship between a virtual link and a bottom-layer link and the virtual path where congestion occurs; the bearing relation between the virtual link and the bottom link is used for indicating whether the virtual link contains the bottom link or not.
In particular, use is made ofRepresenting a virtual path. For example, a->Representing slave virtual nodesTo virtual node->A K-th virtual path from end to end; for example, path->IncludedAn end-to-end path is formed, and the passing rate of the path is 0,1 ]Is a numerical value of (2).
In order to detect the underlying links where congestion occurs, it is necessary to first analyze which underlying links the virtual path involves. The bearer relationship between each virtual path and each underlying link can be determined first. The congestion contribution of each underlying link is then determined based on the bearer relationship between each virtual path and each underlying link.
Specifically, the congestion contribution degree of each underlying link is determined based on the formula (5), and after the congestion contribution degree of each underlying link is calculated, the underlying link corresponding to the congestion contribution degree greater than the preset threshold is determined as the reference congestion underlying link. The preset threshold may be determined empirically by a technician, or may be determined according to other methods.
Wherein,representing congestion contribution of the underlying link, α represents the congestion contribution of the current underlying link e j ∈E S Virtual Path->Quantity of->Representing a link comprising a current underlying link e j ∈E S Virtual Path->The number of the bottom links included in the list, r, represents the number of the current bottom links e j ∈E S Is the (r) th virtual path>
When each reference congestion underlying link is determined, an underlying path containing the reference congestion underlying link can be determined, each underlying path containing the reference congestion underlying link is determined to be a reference congestion underlying path, and a set of reference congestion underlying paths is determined based on each determined reference congestion underlying path.
According to the method for detecting the congestion link under the network slice, the reference congestion bottom layer path set is determined based on the bearing relation between the virtual link and the bottom layer link and the congested virtual path, and the reference congestion bottom layer path set which is congested can be directly positioned after the virtual path is congested, so that the detection range of the congested bottom layer link is shortened, and the detection speed is improved.
Optionally, in the method for detecting a congestion link under a network slice provided by the invention, the reference congestion bottom layer path set includes at least one reference congestion bottom layer path;
the determining the characteristic value of each underlying link included in the reference congestion underlying path set includes:
and determining the historical congestion contribution degree of each bottom link, the average packet loss rate of each bottom link and the relation between each bottom link and the reference congestion bottom path, wherein the historical congestion contribution degree is contained in the reference congestion bottom path set.
Optionally, the determining the historical congestion contribution degree of each underlying link, the average packet loss rate of each underlying link, and the relationship between each underlying link and the reference congestion underlying path included in the reference congestion underlying path set includes:
Determining a relationship of each of the underlying links and the reference congested underlying path based on equation (1);
determining an average packet loss rate of each bottom link based on a formula (2);
determining a historical congestion contribution for each of the underlying links based on equation (3);
wherein,representing the relationship of an underlying link and a reference congested underlying path, alpha representing the inclusion of an underlying link e j Reference number of congested underlying paths, +.>The representation contains the underlying link e j Reference congestion lower layer path +.>The number of bottom links in>Representing the underlying link e j Average packet loss rate of ∈j->The representation contains the underlying link e j Reference congestion underlying path P of (c) r Packet loss rate of->Representing the underlying link e at time t j Is +.>Representing the underlying link e at time t-1 j Is lambda t And a penalty value indicating that the underlying link is congested at the time t.
As can be seen from equation (1), when the denominator is fixed, the smaller the numerator is, which indicates that the number of reference congestion underlying paths including the underlying link is smaller, and the number of underlying links included in the reference congestion underlying path is also smaller. So that the number of the parts to be processed,the smaller the value of (a) is, the lower the value of (b) is, the link e is j For link e including the bottom layer j The congestion of the reference congestion underlying path has less impact.
From equation (2), it can be seen that the underlying link e is included j Reference congestion underlying path P of (c) r The larger the packet loss rate of the bottom link e j The larger the average packet loss rate. So that the number of the parts to be processed,the smaller the value of (a) is, the lower the value of (b) is, the link e is j The smaller the probability of congestion.
For the historical congestion contribution degree of the bottom link, because the congestion of the bottom link does not occur only once, the probability of the bottom link congestion again can be deduced according to the historical congestion condition of the bottom link. UsingRepresenting the underlying link e j Is a historical congestion contribution of (a). According to the historical characteristics, periodically counting congestion occurrence processes of the bottom link, and adding 1 to the contribution degree every time no packet loss is found. The underlying links found to be easily congested are referred to as bad nodes, and the underlying links where no congestion occurs are referred to as good nodes. Bottom link e at time t j Is +.>The calculation is performed using formula (3). Underlying link e j K is used for congestion initial value i Expressed as +.>For the initial time of the bottom link e j At the time of the degree of congestion contribution of (a),has a value of k i 。λ t Representing the underlying link e at time t j Penalty value for congestion occurrence. According to the formula (3), the historical congestion contribution of each underlying link increases gradually over time. The link with the greatest historical congestion contribution value has the greatest number of times of congestion.
The method for detecting the congestion link under the network slice can obtain the historical congestion contribution degree of the bottom links, the average packet loss rate of each bottom link and the specific numerical value of the relation between each bottom link and the reference congestion bottom path, further determine the characteristic value of the bottom links and provide data support for the determination of the reference congestion bottom link set.
Optionally, the method for detecting a congestion link under a network slice provided by the present invention determines at least one reference congestion underlying link set based on a feature value of each underlying link, including:
constructing a relation model between each bottom link and a bottom path containing the bottom link; the relation model comprises an upper node, a lower node and a connecting line between the upper node and the lower node; the upper node is used for indicating the average packet loss rate of the reference congestion bottom layer path, the lower node is used for indicating the historical congestion contribution degree of each reference congestion bottom layer link, and the connecting line is used for indicating the probability of congestion of the bottom layer path containing the reference congestion bottom layer link;
calculating the value of the lower node and the value of a connecting line between the upper node and the lower node based on the characteristic value of each lower link;
At least one of the reference congestion underlying link sets is determined based on the value of the underlying node.
Optionally, the method for detecting a congestion link under a network slice according to the present invention calculates a value of the upper node, a value of the lower node, and a value of a connection line between the upper node and the lower node based on a characteristic value of each of the bottom links, including:
determining the value of the upper node based on the average packet loss rate of each of the bottom links;
determining a value of the lower node based on the historical congestion contribution of each lower link;
a value of a connection between the upper node and the lower node is determined based on a relationship of each underlying link and each of the reference congested underlying paths.
Specifically, the invention builds a relationship model of a bottom link and a bottom path containing the bottom link based on Bayesian bipartite graph theory, wherein the relationship model comprises upper nodes, lower nodes and connecting lines between the upper nodes and the lower nodes. The upper node is used for indicating the average packet loss rate of the reference congestion underlying path, the lower node is used for indicating the historical congestion contribution degree of each reference congestion underlying link, and the connecting line is used for indicating the probability of congestion of the underlying path containing the reference congestion underlying link.
The upper node indicates the average packet loss rate of the reference congestion bottom layer path, so when the average packet loss rate of the reference congestion bottom layer path indicated by the upper node is calculated, the average packet loss rate of each bottom layer link included in the reference congestion bottom layer path is used for summation, and the value obtained by summation is calculated by a method of averaging again.
The lower node indicates the historical congestion contribution degree of each reference congestion underlying link, so when calculating the historical congestion contribution degree of each reference congestion underlying link indicated by the lower node, the historical congestion contribution degree of the underlying link at the last moment is used for calculation.
The connection is used for indicating the congestion probability of the bottom layer path containing the reference congestion bottom layer link, so that when the connection value from the lower layer node to the upper layer node is calculated, the value of the relation between each bottom layer link and the reference congestion bottom layer path containing the bottom layer link is used for carrying out assignment.
In order to facilitate calculation of the relation model, a maximum and minimum normalization value strategy is adopted when calculating each parameter value of the relation model, and normalization processing is carried out on the relation model, so that influence of different dimensions on algorithm performance is avoided.
According to the method for detecting the congestion link under the network slice, a relation model based on each bottom link and the bottom path containing the bottom link is constructed, and the values of the upper node, the lower node and the connecting line between the upper node and the lower node which are included in the relation model are calculated based on the characteristic values of the bottom links respectively, so that a bottom link set with congestion can be determined, and the accuracy of the determined congestion bottom link set can be improved.
Optionally, the method for detecting a congestion link under a network slice provided by the present invention determines a target congestion bottom layer link set from the at least one reference congestion bottom layer link set, including:
determining an interpretation capability for each of the reference congestion underlying link sets based on equation (4);
determining a target congestion underlying link set based on the interpretation capability of each reference congestion underlying link set;
wherein, abilityness (DB, P O ) Representing the interpretation capability of the reference congestion underlying link set, DB representing the reference congestion underlying link set, P O Representing a reference set of congested underlying paths, p (e i ) Representing the probability of congestion occurring for a reference congested underlying link, P (P r |e i ) Representing the probability of congestion occurring for the underlying path containing the reference congested underlying link.
Optionally, after calculating the value of the lower node of the model, determining a reference congestion bottom link based on the value of the lower node, specifically, determining a bottom link corresponding to a historical congestion contribution degree greater than a preset threshold as a reference congestion bottom link, that is, a suspected congestion bottom link, and then constructing at least one reference congestion bottom link set based on all the reference congestion bottom links.
To determine a final set of congested underlying links from the set of reference congested underlying links. The invention adopts the maximum interpretation capability strategy to solve. The maximum interpretation capability policy refers to that by constructing multiple reference congestion underlying link sets, and calculating the interpretation capability of the reference congestion underlying link sets according to formula (4), the reference congestion underlying link set with the maximum interpretation capability is the final determined target congestion underlying link set.
It should be noted that, according to the experience of network operation, the number of underlying links where congestion occurs simultaneously is not more than 5. Therefore, when constructing reference congestion underlying link sets, the number of elements in each set does not exceed 5. For example, if the determined reference congestion underlying links include 20 total reference congestion underlying links, when a plurality of reference congestion underlying link sets are constructed, assuming that each constructed reference congestion underlying link set includes 5 reference congestion underlying links, the maximum number of reference congestion underlying link sets that can be constructed isThen the above +.sub.is calculated according to equation (4)>The interpretation capability of the reference congestion underlying link set is the reference congestion underlying link set with the maximum interpretation capability, namely the final determined target congestion underlying link set.
The method for detecting the congestion link under the network slice provided by the invention adopts the maximum interpretation capability strategy to solve the interpretation capability of the constructed multiple reference congestion underlying link sets, determines the reference congestion underlying link set with the maximum interpretation capability as the target congestion underlying link set, does not need to calculate the packet loss rate of each underlying link, not only can reduce the calculated amount, but also can fully consider the congestion condition of the multiple combined reference congestion underlying link sets, and improves the accuracy.
The following describes the device for detecting the network-slice congestion link provided by the invention, and the device for detecting the network-slice congestion link and the method for detecting the network-slice congestion link described above can be referred to correspondingly.
Fig. 2 is a schematic diagram of a congestion link under a network slice according to the present invention, and as shown in fig. 2, the congestion link under a network slice detection apparatus includes a first determining unit 201, a second determining unit 202, a third determining unit 203, a fourth determining unit 204, and a fifth determining unit 205; wherein:
a first determining unit 201, configured to determine a virtual path where congestion occurs;
a second determining unit 202, configured to determine a reference congestion bottom layer path set based on the virtual path where congestion occurs;
A third determining unit 203, configured to determine a feature value of each underlying link included in the reference congestion underlying path set;
a fourth determining unit 204, configured to determine at least one reference congestion underlying link set based on a feature value of each of the underlying links;
a fifth determining unit 205, configured to determine a target congestion bottom link set from the at least one reference congestion bottom link set.
The congestion link detection device under the network slice provided by the invention determines the reference congestion bottom layer path set based on the congested virtual path, further determines the characteristic value of each bottom layer link in the reference congestion bottom layer path set, determines at least one reference congestion bottom layer link set based on the characteristic value of the bottom layer link, and finally determines the target congestion bottom layer link set in at least one reference congestion bottom layer link set, thereby realizing the detection of the congestion link under the network slice.
Based on any of the above embodiments, the second determining unit 202 is specifically configured to:
determining the reference congestion bottom-layer path set based on a bearer relationship between a virtual link and a bottom-layer link and the virtual path where congestion occurs; the bearing relation between the virtual link and the bottom link is used for indicating whether the virtual link contains the bottom link or not.
Based on any of the above embodiments, the reference congestion underlying path set includes at least one reference congestion underlying path; the third determining unit 203 is specifically configured to:
and determining the historical congestion contribution degree of each bottom link, the average packet loss rate of each bottom link and the relation between each bottom link and the reference congestion bottom path, wherein the historical congestion contribution degree is contained in the reference congestion bottom path set.
Based on any of the above embodiments, the third determining unit 203 is specifically configured to:
determining a relationship of each of the underlying links and the reference congested underlying path based on equation (1);
determining an average packet loss rate of each bottom link based on a formula (2);
determining a historical congestion contribution for each of the underlying links based on equation (3);
wherein,representing the relationship of an underlying link and a reference congested underlying path, alpha representing the inclusion of an underlying link e j Reference number of congested underlying paths, +.>The representation contains the underlying link e j Reference congestion lower layer path +.>The number of bottom links in>Representing the underlying link e j Average packet loss rate of ∈j->The representation contains the underlying link e j Reference congestion underlying path P of (c) r Packet loss rate of- >Representing the underlying link e at time t j Is +.>Representing the underlying link e at time t-1 j Is lambda t And a penalty value indicating that the underlying link is congested at the time t.
Based on any of the above embodiments, the fourth determining unit 204 is specifically configured to:
constructing a relation model between each bottom link and a bottom path containing the bottom link; the relation model comprises an upper node, a lower node and a connecting line between the upper node and the lower node; the upper node is used for indicating the average packet loss rate of the reference congestion bottom layer path, the lower node is used for indicating the historical congestion contribution degree of each reference congestion bottom layer link, and the connecting line is used for indicating the probability of congestion of the bottom layer path containing the reference congestion bottom layer link;
calculating the value of the upper node, the value of the lower node and the value of a connecting line between the upper node and the lower node based on the characteristic value of each bottom link;
at least one of the reference congestion underlying link sets is determined based on the value of the underlying node.
Based on any of the above embodiments, the fourth determining unit 204 is specifically configured to:
Determining the value of the upper node based on the average packet loss rate of each of the bottom links;
determining a value of the lower node based on the historical congestion contribution of each lower link;
a value of a connection between the upper node and the lower node is determined based on a relationship of each underlying link and each of the reference congested underlying paths.
Based on any of the above embodiments, the fifth determining unit 205 is specifically configured to:
determining an interpretation capability for each of the reference congestion underlying link sets based on equation (4);
determining a target congestion underlying link set based on the interpretation capability of each reference congestion underlying link set;
wherein, abilityness (DB, P O ) Representing the interpretation capability of the reference congestion underlying link set, DB representing the reference congestion underlying link set, P O Representing a reference set of congested underlying paths, p (e i ) Representing the probability of congestion occurring for a reference congested underlying link，p(P r |e i ) Representing the probability of congestion occurring for the underlying path containing the reference congested underlying link.
Fig. 3 illustrates a physical schematic diagram of an electronic device, as shown in fig. 3, where the electronic device may include: processor 310, communication interface (Communications Interface) 320, memory 330 and communication bus 340, wherein processor 310, communication interface 320, memory 330 accomplish communication with each other through communication bus 340. Processor 310 may invoke logic instructions in memory 330 to perform a method for network sub-slice congestion link detection, the method comprising: determining a virtual path where congestion occurs;
Determining a reference congestion underlying path set based on the virtual paths where congestion occurs;
determining a characteristic value of each underlying link contained in the reference congestion underlying path set;
determining at least one reference congestion underlying link set based on the characteristic value of each underlying link;
a target set of congested links is determined among the at least one reference set of congested links.
Further, the logic instructions in the memory 330 described above may be implemented in the form of software functional units and may be stored in a computer-readable storage medium when sold or used as a stand-alone product. Based on this understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention. 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.
In another aspect, the present invention also provides a computer program product, where the computer program product includes a computer program, where the computer program can be stored on a non-transitory computer readable storage medium, where the computer program when executed by a processor can perform a method for detecting a congestion link under a network slice provided by the above methods, and the method includes: determining a virtual path where congestion occurs;
determining a reference congestion underlying path set based on the virtual paths where congestion occurs;
determining a characteristic value of each underlying link contained in the reference congestion underlying path set;
determining at least one reference congestion underlying link set based on the characteristic value of each underlying link;
a target set of congested links is determined among the at least one reference set of congested links.
In yet another aspect, the present invention further provides a non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, is implemented to perform a method for detecting a congestion link under a network slice provided by the above methods, the method comprising: determining a virtual path where congestion occurs;
determining a reference congestion underlying path set based on the virtual paths where congestion occurs;
Determining a characteristic value of each underlying link contained in the reference congestion underlying path set;
determining at least one reference congestion underlying link set based on the characteristic value of each underlying link;
a target set of congested links is determined among the at least one reference set of congested links.
The apparatus embodiments described above are merely illustrative, wherein the elements illustrated as separate elements may or may not be physically separate, and the elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on this understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the method described in the respective embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and are not limiting; although the invention has been described in detail with reference to the foregoing embodiments, it will 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 and scope of the technical solutions of the embodiments of the present invention.
Claims (8)
1. A method for detecting a congested link under a network slice, comprising:
determining a virtual path where congestion occurs;
determining a reference congestion underlying path set based on the virtual paths where congestion occurs; the reference congestion bottom layer path set comprises at least one reference congestion bottom layer path;
determining a characteristic value of each underlying link contained in the reference congestion underlying path set;
determining at least one reference congestion underlying link set based on the characteristic value of each underlying link;
determining a target congestion underlying link set in the at least one reference congestion underlying link set;
the determining the characteristic value of each underlying link included in the reference congestion underlying path set includes:
Determining a historical congestion contribution degree of each bottom link, an average packet loss rate of each bottom link and a relation between each bottom link and the reference congestion bottom path, wherein the historical congestion contribution degree is contained in the reference congestion bottom path set;
the determining the historical congestion contribution degree of each underlying link, the average packet loss rate of each underlying link and the relation between each underlying link and the reference congestion underlying path, which are contained in the reference congestion underlying path set, includes:
determining a relationship of each of the underlying links and the reference congested underlying path based on equation (1);
determining an average packet loss rate of each bottom link based on a formula (2);
determining a historical congestion contribution for each of the underlying links based on equation (3);
wherein,representing the relationship of an underlying link and a reference congested underlying path, alpha representing the inclusion of an underlying link e j Reference number of congested underlying paths, +.>The representation contains the underlying link e j Reference congestion lower layer path +.>The number of bottom links in>Representing the underlying link e j Average packet loss rate of ∈j->The representation contains the underlying link e j Reference congestion underlying path P of (c) r Packet loss rate of->Representing the underlying link e at time t j Is +.>Representing the underlying link e at time t-1 j Is lambda t And a penalty value indicating that the underlying link is congested at the time t.
2. The method of network sub-slice congestion link detection according to claim 1, wherein said determining a reference set of congested underlying paths based on said virtual paths where congestion occurs comprises:
determining the reference congestion bottom-layer path set based on a bearer relationship between a virtual link and a bottom-layer link and the virtual path where congestion occurs; the bearing relation between the virtual link and the bottom link is used for indicating whether the virtual link contains the bottom link or not.
3. The method for detecting a congested link under a network slice of claim 1, wherein said determining at least one reference set of congested links based on a characteristic value of each of said links includes:
constructing a relation model between each bottom link and a bottom path containing the bottom link; the relation model comprises an upper node, a lower node and a connecting line between the upper node and the lower node; the upper node is used for indicating the average packet loss rate of the reference congestion bottom layer path, the lower node is used for indicating the historical congestion contribution degree of each reference congestion bottom layer link, and the connecting line is used for indicating the probability of congestion of the bottom layer path containing the reference congestion bottom layer link;
Calculating the value of the upper node, the value of the lower node and the value of a connecting line between the upper node and the lower node based on the characteristic value of each bottom link;
at least one of the reference congestion underlying link sets is determined based on the value of the underlying node.
4. The method for detecting a congestion link under a network slice according to claim 3, wherein calculating the value of the upper node, the value of the lower node, and the value of the connection line between the upper node and the lower node based on the characteristic value of each of the lower links comprises:
determining the value of the upper node based on the average packet loss rate of each of the bottom links;
determining a value of the lower node based on the historical congestion contribution of each lower link;
a value of a connection between the upper node and the lower node is determined based on a relationship of each underlying link and each of the reference congested underlying paths.
5. A method of network sub-slice congestion link detection according to claim 3, wherein said determining a target set of congested underlying links in said at least one reference set of congested underlying links comprises:
Determining an interpretation capability for each of the reference congestion underlying link sets based on equation (4);
determining a target congestion underlying link set based on the interpretation capability of each reference congestion underlying link set;
wherein, abilityness (DB, P O ) Representing the interpretation capability of the reference congestion underlying link set, DB representing the reference congestion underlying link set, P O Representing a reference set of congested underlying paths, p (e i ) Representing the probability of congestion occurring for a reference congested underlying link, P (P r |e i ) Representing the probability of congestion occurring for the underlying path containing the reference congested underlying link.
6. A network sub-slice congestion link detection apparatus, comprising:
a first determining unit configured to determine a virtual path in which congestion occurs;
a second determining unit, configured to determine a reference congestion bottom layer path set based on the virtual path where congestion occurs; the reference congestion bottom layer path set comprises at least one reference congestion bottom layer path;
a third determining unit, configured to determine a feature value of each underlying link included in the reference congestion underlying path set;
a fourth determining unit, configured to determine at least one reference congestion underlying link set based on a feature value of each underlying link;
A fifth determining unit, configured to determine a target congestion bottom link set from the at least one reference congestion bottom link set;
the third determining unit is specifically configured to determine a historical congestion contribution degree of each underlying link included in the reference congestion underlying path set, an average packet loss rate of each underlying link, and a relationship between each underlying link and the reference congestion underlying path;
the third determining unit is specifically configured to:
determining a relationship of each of the underlying links and the reference congested underlying path based on equation (1);
determining an average packet loss rate of each bottom link based on a formula (2);
determining a historical congestion contribution for each of the underlying links based on equation (3);
wherein,representing the relationship of an underlying link and a reference congested underlying path, alpha representing the inclusion of an underlying link e j Reference number of congested underlying paths, +.>The representation contains the underlying link e j Reference congestion lower layer path +.>The number of bottom links in>Representing the underlying link e j Average packet loss rate of ∈j->The representation contains the underlying link e j Reference congestion underlying path P of (c) r Packet loss rate of->Representing the underlying link e at time t j Is +.>Representing the underlying link e at time t-1 j Is lambda t And a penalty value indicating that the underlying link is congested at the time t.
7. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method for network sub-slice congestion link detection according to any one of claims 1 to 5 when executing the program.
8. A non-transitory computer readable storage medium having stored thereon a computer program, which when executed by a processor implements a method of network sub-slice congestion link detection according to any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210365371.4A CN114826991B (en) | 2022-04-07 | 2022-04-07 | Method and device for detecting congestion link under network slice and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210365371.4A CN114826991B (en) | 2022-04-07 | 2022-04-07 | Method and device for detecting congestion link under network slice and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114826991A CN114826991A (en) | 2022-07-29 |
| CN114826991B true CN114826991B (en) | 2023-12-01 |
Family
ID=82534525
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210365371.4A Active CN114826991B (en) | 2022-04-07 | 2022-04-07 | Method and device for detecting congestion link under network slice and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114826991B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546286A (en) * | 2011-09-26 | 2012-07-04 | 中国人民解放军理工大学 | Method for on-line detection of shared network congestion paths |
| CN106357547A (en) * | 2016-09-08 | 2017-01-25 | 重庆邮电大学 | Software-defined network congestion control algorithm based on stream segmentation |
| WO2020063661A1 (en) * | 2018-09-30 | 2020-04-02 | 中兴通讯股份有限公司 | Flow congestion monitoring method and device |
| CN111434143A (en) * | 2017-10-13 | 2020-07-17 | 三星电子株式会社 | User Equipment (UE) and core network for managing network slice congestion in a wireless communication system |
| CN111542089A (en) * | 2020-05-14 | 2020-08-14 | 海南大学 | Multipath congestion control method and device based on time delay and window jitter |
| CN111865681A (en) * | 2020-07-14 | 2020-10-30 | 中国电力科学研究院有限公司 | Core network slice end-to-end time delay optimization method, system and storage medium |
| WO2021120796A1 (en) * | 2019-12-16 | 2021-06-24 | 中兴通讯股份有限公司 | Traffic control method, electronic device, and storage medium |
| CN113315679A (en) * | 2021-05-26 | 2021-08-27 | 广东电网有限责任公司 | Link packet loss rate inference method and system based on network resource characteristics |
-
2022
- 2022-04-07 CN CN202210365371.4A patent/CN114826991B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102546286A (en) * | 2011-09-26 | 2012-07-04 | 中国人民解放军理工大学 | Method for on-line detection of shared network congestion paths |
| CN106357547A (en) * | 2016-09-08 | 2017-01-25 | 重庆邮电大学 | Software-defined network congestion control algorithm based on stream segmentation |
| CN111434143A (en) * | 2017-10-13 | 2020-07-17 | 三星电子株式会社 | User Equipment (UE) and core network for managing network slice congestion in a wireless communication system |
| WO2020063661A1 (en) * | 2018-09-30 | 2020-04-02 | 中兴通讯股份有限公司 | Flow congestion monitoring method and device |
| WO2021120796A1 (en) * | 2019-12-16 | 2021-06-24 | 中兴通讯股份有限公司 | Traffic control method, electronic device, and storage medium |
| CN111542089A (en) * | 2020-05-14 | 2020-08-14 | 海南大学 | Multipath congestion control method and device based on time delay and window jitter |
| CN111865681A (en) * | 2020-07-14 | 2020-10-30 | 中国电力科学研究院有限公司 | Core network slice end-to-end time delay optimization method, system and storage medium |
| CN113315679A (en) * | 2021-05-26 | 2021-08-27 | 广东电网有限责任公司 | Link packet loss rate inference method and system based on network resource characteristics |
Non-Patent Citations (1)
| Title |
|---|
| Sliceable Congestion Control for Latency-Aware Bandwidth Allocation in Network Slicing;Takamitsu lwai etc;《IEEE》;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114826991A (en) | 2022-07-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8392760B2 (en) | Diagnosing abnormalities without application-specific knowledge | |
| US20170337086A1 (en) | Method, Apparatus, and System for Adjusting Deployment Location of Virtual Machine | |
| EP3907617A1 (en) | Container management based on application performance indicators | |
| US9229778B2 (en) | Method and system for dynamic scaling in a cloud environment | |
| JP6811776B2 (en) | Early alert decision methods, nodes, and subsystems | |
| US10447561B2 (en) | BFD method and apparatus | |
| US11038953B1 (en) | Dynamic egress traffic steering for large scale cloud network | |
| US10884805B2 (en) | Dynamically configurable operation information collection | |
| CN112261120B (en) | Cloud-side cooperative task unloading method and device for power distribution internet of things | |
| CN116089213A (en) | Cloud platform resource monitoring method and device, electronic equipment and readable storage medium | |
| EP3232620B1 (en) | Data center based fault analysis method and device | |
| CN110336590A (en) | A kind of Fault Locating Method of power telecom network, device and equipment | |
| CN116248532A (en) | Network abnormality detection method, network abnormality detection device and electronic equipment | |
| CN114826991B (en) | Method and device for detecting congestion link under network slice and electronic equipment | |
| CN112202627B (en) | Health degree evaluation method and device of network center | |
| CN117336228A (en) | IGP simulation recommendation method, device and medium based on machine learning | |
| KR102647054B1 (en) | Method and Apparatus for predicting application service response time in communication system | |
| CN104702667B (en) | A kind of method and device of application service system extension | |
| CN116933121A (en) | Data anomaly detection method and device | |
| CN111917589B (en) | Power communication network resource backup method and related device | |
| CN114745750B (en) | Method and device for detecting congestion link under network slice and electronic equipment | |
| CN116155766A (en) | Method and equipment for evaluating quality of park network | |
| US11765042B2 (en) | Traffic application amount calculation apparatus, method and program | |
| CN113626283A (en) | Distributed system node resource assessment method and device | |
| US8427950B2 (en) | Method, system, and computer program product for identifying common factors associated with network threshold violations |
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 |