Optical network fault analysis method and device
By disconnecting the link in the optical network to establish a faulty network and generating objective functions and constraint functions, the problem of resources in the existing technology cannot be uniformly included is solved, and the optimal optical network failure recovery path is achieved, reducing the waste of relay resources and calculation volume improves fault recovery efficiency.
Patent Information
- Application Number
- CN202210726327.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-06-24
- Publication Date
- 2024-11-15
- Estimated Expiration
- 2042-06-24
AI Technical Summary
The existing optical network fault analysis methods cannot take into account the resources of different faulty networks, resulting in huge waste of relay resources and huge calculations, and the optimal optical network fault recovery path cannot be obtained.
By establishing multiple faulty networks based on each link disconnection in the network topology, the objective function and constraint function are generated, and combined with the mathematical model with the smallest number of relays and the largest number of recovered services, the optimal solution is obtained. Optical network failure recovery path.
It realizes that the number of relays is added when the service is restored after the link is disconnected, reduces network resource consumption, avoids waste of relay resources, and improves the efficiency of optical network failure recovery.
Smart Images

Figure CN115103245B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of communication technology, and in particular to an optical network fault analysis method and device. Background Art
[0002] During the operation of the optical network, network failures often occur, such as node power failures and link interruptions. These failures can basically be converted into link failures. For example, after a node loses power, all links connected to the node are also unavailable. Therefore, a node failure can be converted into a failure of all links connected to the node. In a link failure, the probability of multiple links failing at the same time is relatively small, and the probability of another link failure occurring immediately after a failure occurs is also relatively small. Generally, there is enough time to repair a single link failure, so the entire network only needs to analyze the path resource recovery problem of the service after a single link failure. The problem of analyzing the secondary failure of the entire network link is that only one link is broken in the entire network at a time, and it is calculated whether the network path resources can be successfully allocated after the fiber is broken.
[0003] The conventional approach to link fault analysis for the entire network is to generate a fault network each time a link is disconnected. The fiber-broken link resources under the fault network are unavailable, and the service resources passing through the link are cleared and the service resources of the fault network are recalculated. The calculation process of the fault analysis corresponding to each link disconnection is independent of each other, that is, the number of links in the network topology is the number of fault analysis calculations required. There are two problems with this calculation method: First, since different fault networks do not appear at the same time, the newly added relay resources are not affected by each other, and the relays generated in a certain fault network can be used by other fault networks. However, the existing calculation method cannot take the resources of different fault networks into account uniformly due to its independent calculation process, thereby greatly increasing the generated relay resources and causing a waste of pre-allocated relay resources for the entire network. Second, when the relays generated by the previous fault network are used as shared resources for subsequent fault networks, the sequential nature of the network fiber breakage needs to be taken into account. For a more complex topology network, the number of links contained in it is huge, and the permutations and combinations of the relay fiber sequence are astronomical, resulting in a huge amount of calculation for fault analysis. The existing calculation system alone cannot obtain the optimal optical network fault recovery path.
[0004] In view of this, overcoming the defects of the prior art is an urgent problem to be solved in the field of this technology. Summary of the invention
[0005] The technical problem to be solved by the present invention is that the existing optical network fault analysis method cannot uniformly take into account the resources of different fault networks, which results in the need to generate a large number of relay resources, resulting in a waste of pre-allocated relay resources in the entire network.
[0006] The present invention adopts the following technical solution:
[0007] In a first aspect, the present invention provides an optical network fault analysis method, comprising:
[0008] Multiple fault networks are established based on disconnecting each link in the network topology separately;
[0009] Generate an objective function based on the established fault network and the services that need to be restored in the fault network, and generate one or more constraint functions for each fault network;
[0010] Combining the objective function and the constraint function, a mathematical model is established with the goal of minimizing the total number of relays and maximizing the total number of services restored;
[0011] Solve the mathematical model to obtain the optimal optical network fault recovery path.
[0012] Preferably, the objective function is specifically:
[0013] When the node is located in different fault networks, the maximum number of relays added to the node is used as the number of node relays, and the number of node relays of each node in each fault network is added to obtain the total number of relays;
[0014] Adding the number of services successfully restored in each faulty network to obtain the total number of services restored;
[0015] The objective function is a weighted difference between the total number of restored services and the total number of relays.
[0016] Preferably, solving the mathematical model to obtain the optimal optical network fault recovery path specifically includes:
[0017] If the value of the objective function obtained by solving is a negative value, the weight corresponding to the total number of restored services will be reduced successively within a preset range and the corresponding value of the objective function will be calculated until the value of the objective function obtained by solving is a positive value. When the objective function is positive, the corresponding optical network fault recovery path is the optimal optical network fault recovery path.
[0018] Preferably, the one or more constraint functions specifically include:
[0019] One or more of a source-destination node constraint function, a path connectivity constraint function, a loss constraint function, a link wavelength constraint function, and a relay quantity constraint function on a node.
[0020] Preferably, the source and sink node constraint functions are specifically:
[0021] For each service k that needs to be restored in the faulty network e, find the link (s, j) from the source node s of service k and the link (i, d) to the sink node d of service k among all the links used by service k;
[0022] When service k is successfully restored, there is only one link (s, j) corresponding to service k, and there is only one link (i, d) corresponding to service k;
[0023] When service k is not restored, there is no corresponding link (s, j) and link (i, d) for the service k.
[0024] Preferably, the path connectivity constraint function is specifically:
[0025] For each non-relay node n under each service k that needs to be restored in the faulty network e, the number of links (i, n) entering node n under service k is the same as the number of links (n, j) departing from node n under service k;
[0026] For each relay node m under each service k, the number of links (i, m) entering the node m under service k is the same as the number of links (m, j) departing from the node m under service k.
[0027] Preferably, the loss constraint function is specifically:
[0028] For each sub-path h under each service k that needs to be restored in the faulty network e, add the loss of each link (i, j) under the sub-path h to obtain the total loss of the sub-path h;
[0029] The total loss of each sub-path h is less than or equal to the corresponding preset loss threshold.
[0030] Preferably, the link wavelength constraint function is specifically:
[0031] For each link (i, j) under the faulty network e, the sum of the number of services k1 occupying the channel in the forward direction and the number of services k2 occupying the channel in the reverse direction on the link (i, j) is less than or equal to the preset channel number threshold corresponding to the link (i, j).
[0032] Preferably, the relay quantity constraint function on the node is specifically:
[0033] For each node n in the faulty network e, find the service k in the faulty network e with the node n as a relay node, and the number of services k corresponding to the node n is less than or equal to the preset maximum relay number corresponding to the node n.
[0034] In a second aspect, the present invention further provides an optical network fault analysis device, which is used to implement the optical network fault analysis method described in the first aspect, and the device comprises:
[0035] At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the processor to execute the optical network fault analysis method described in the first aspect.
[0036] In a third aspect, the present invention further provides a non-volatile computer storage medium, wherein the computer storage medium stores computer executable instructions, and the computer executable instructions are executed by one or more processors to complete the optical network fault analysis method described in the first aspect.
[0037] The present invention establishes a fault network in the case of a single link disconnection, establishes a mathematical model according to all fault networks in the network topology, incorporates relay resources in different fault networks into the calculation process, enables resources in different fault networks to be reused, solves the mathematical model to obtain the optimal optical network fault recovery path, thereby ensuring that the number of added relays is minimized when restoring services after the link is disconnected, thereby reducing network resource consumption. BRIEF DESCRIPTION OF THE DRAWINGS
[0038] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the following briefly introduces the drawings required for use in the embodiments of the present invention. Obviously, the drawings described below are only some embodiments of the present invention, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.
[0039] Figure 1 is a flow chart of an optical network fault analysis method provided by an embodiment of the present invention;
[0040] Figure 2 is a flow chart of an optical network fault analysis method provided by an embodiment of the present invention;
[0041] Figure 3 This is a schematic diagram of an optical network topology provided by an embodiment of the present invention;
[0042] Figure 4 is a schematic diagram of a service path under an optical network topology provided by an embodiment of the present invention;
[0043] Figure 5 is a flow chart of an optical network fault analysis method provided by an embodiment of the present invention;
[0044] Figure 6This is a schematic diagram of an optical network topology provided by an embodiment of the present invention;
[0045] Figure 7 It is a schematic diagram of the architecture of an optical network fault analysis device provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0046] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.
[0047] In the description of the present invention, the terms "inside", "outside", "longitudinal", "lateral", "upper", "lower", "top", "bottom" and the like indicate orientations or positional relationships based on the orientations or positional relationships shown in the accompanying drawings. They are only for the convenience of describing the present invention and do not require that the present invention must be constructed and operated in a specific orientation. Therefore, they should not be understood as limitations on the present invention.
[0048] In addition, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.
[0049] Embodiment 1:
[0050] Embodiment 1 of the present invention provides an optical network fault analysis method, such as Figure 1 As shown, specifically including:
[0051] In step 201, multiple fault networks are established based on disconnection of each link in the network topology.
[0052] In step 202, an objective function is generated according to the established faulty network and the services that need to be restored in the faulty network, and one or more constraint functions are generated for each faulty network.
[0053] In step 203, the objective function and the constraint function are combined to establish a mathematical model with the goal of minimizing the total number of relays and maximizing the total number of restored services.
[0054] In step 204, the mathematical model is solved to obtain the optimal optical network fault recovery path.
[0055] Among them, the establishment of multiple fault networks based on the disconnection of each link in the network topology specifically includes: assuming that a link in the network topology is disconnected separately, finding the business that needs to be restored when the link is disconnected, and establishing a fault network based on the topological network after the link is disconnected and the business that needs to be restored after the link is disconnected, and each link corresponds to a fault network.
[0056] The embodiment of the present invention establishes a fault network in the case of a single link disconnection, establishes a mathematical model according to all fault networks in the network topology, incorporates relay resources in different fault networks into the calculation process, enables resources in different fault networks to be reused, solves the mathematical model to obtain the optimal optical network fault recovery path, and ensures that the number of added relays is minimized when restoring services after the link is disconnected, thereby reducing network resource consumption.
[0057] In the above embodiment, since the total number of relays is required to be the minimum and the total number of services restored is the maximum, the implementation method that can usually be associated is: the difference between the total number of services restored and the total number of relays is used as the objective function, and when the value of the objective function is the maximum or minimum, it is the optimal optical network solution. However, in actual situations, since there is a certain mutual exclusion relationship between the minimum number of relays added and the maximum number of services restored during the service recovery process, in order to maintain a balance between the two goals, there are the following preferred embodiments:
[0058] The objective function is Figure 2 As shown, specifically:
[0059] In step 301, the maximum number of relays added to a node when the node is located in different fault networks is used as the node relay number, and the node relay number of each node in each fault network is added together to obtain the total relay number.
[0060] In step 302, the number of services successfully restored in each faulty network is added together to obtain the total number of services restored.
[0061] In step 303, the objective function is a weighted difference between the total number of restored services and the total number of relays.
[0062] The weight of the total number of relays and the weight of the total number of restored services are obtained by technicians in this field based on analysis of the network scale.
[0063] The objective function is expressed in the form of a mathematical formula:
[0064]
[0065] It should be noted that in the description of the embodiments of the present invention, unless otherwise specified, the symbols in the upper right and lower right corners of the parameters in all formulas should not be understood as powers of the parameters, but as limited descriptions of the parameters, and different positions of the symbols represent different limitations (all symbols in the same position have the same meaning).
[0066] In order to better describe the above objective function, the basic forms of two decision variables are provided here, and the two decision variables are explained. The first decision variable is specifically:
[0067]
[0068] The variables k and e are used to limit or indicate t.
[0069] The variable e refers to the faulty network.
[0070] The variable k refers to the service that needs to be restored in the faulty network, k∈T e , T e It is a collection of services that need to be restored in a faulty network.
[0071] Decision variables Represents the recovery status of service k that needs to be restored under faulty network e. If service k is successfully restored, then The value of is 1, otherwise, The value of is 0.
[0072] The second decision variable is:
[0073]
[0074] Among them, variables k, h, a, b, i and j are all used to limit or indicate x.
[0075] The variables i and j refer to the source node and the destination node of the link respectively, that is, specify a link (i, j), where i∈V, j∈V, V is the set of all nodes in the network topology under the corresponding fault network e, and the link (i, j)∈E, E is the set of all unidirectional links in the fault network.
[0076] The variable k refers to the service and is used to indicate whether the link (i, j) is used by service k, k∈T e , T e It is a collection of services that need to be restored in a faulty network.
[0077] The variable h refers to the subpath, and is used to indicate whether the link (i, j) is a link under the hth subpath under the service k. h is greater than or equal to 0 and less than or equal to H, where H is the maximum number of subpaths allowed in a service.
[0078] The variable a refers to the first link and is used to indicate whether the link (i, j) is the first link under the hth subpath under the service k. The value of a is 0 or 1.
[0079] The variable b represents the last link and is used to indicate whether the link (i, j) is the last link under the hth subpath under the service k. The value of b is 0 or 1.
[0080] In the actual use of the objective function or constraint function, the values defined in the decision variables are different, and the meanings indicated by the decision variables are different. When the indicated meanings are established, The value of is 1, otherwise, The value is 0. In each function, a detailed explanation will be given.
[0081] The embodiment of the present invention also provides a corresponding network topology schematic diagram for illustrating the relationship between network elements such as services, source nodes, sink nodes, sub-paths, and relay nodes.
[0082] As Figure 3 Taking the network topology containing 11 nodes shown as an example, assuming that there is no interruption in the network topology, service k has been established from node 1 to node 6 and the path of service k is: the service passes through source node 1, node 7, node 4, node 5 in sequence and finally reaches node 6.
[0083] When any link on the path of service k is disconnected, service k is also interrupted. In order to restore service k, it is necessary to re-plan the path for service k. The method provided in the embodiment of the present invention can, when no link interruption has occurred in the network topology, assume a single link failure of any link, and pre-analyze and derive a recovery path for the faulty service when a link failure actually occurs, thereby ensuring rapid recovery of the service when a link failure actually occurs.
[0084] For example, when the link (7, 4) in service k is disconnected, service k has the following three possible fault recovery paths:
[0085] The service goes from source node 1 to sink node 6 through node 2, node 3, node 4, node 5 in sequence.
[0086] The service goes from source node 1 to sink node 6 via nodes 7 and 8 in sequence.
[0087] The service goes from source node 1 to destination node 6 through node 2, node 9, node 10, and node 11 in sequence.
[0088] Take the path where the service goes from source node 1 through node 2, node 3, node 4, node 5 to destination node 6 as an example. Assume that there are 3 local groups in each node. In this path, node 3 and node 4 are relay nodes. Then, this path includes 3 sub-paths, namely, sub-path 1 between source node 1 and node 3, sub-path 2 between node 3 and node 4, and sub-path 3 between node 4 and destination node 6. That is, the source node, relay node, and destination node are the demarcation points of the sub-paths under the service. When there is no relay node in the path where the service is located, the service only has one sub-path from the source node to the destination node.
[0089] by Figure 3 and Figure 4 For example, for decision variables To illustrate, if h is limited to 1 and a is limited to 1, the decision variable obtained is It represents whether link (i, j) is the first link of the first sub-path under service k. When link (i, j) is the first link of the first sub-path under service k, The value of is 1, such as Figure 4 The link (1, 2) in satisfies this condition, namely The value is 1; otherwise, Figure 4 Although the link (2, 3) in belongs to the first subpath under service k, it is not the first link. The value of is 0. For link (3, 4), since nodes 3 and 4 are adjacent and both are relay nodes, the formed sub-path 2 only contains link (3, 4). Therefore, link (3, 4) is both the first link and the last link of sub-path 2. and The value of is 1.
[0090] In the objective function, the total number of relays is:
[0091]
[0092] Among them, the decision variables The variables k, b, i, and j in are accumulated, and the value range of each variable is its default range during the accumulation, and the value of variable a is assigned to 1. In this case, Indicates whether link (i, j) is the first link under the h-th subpath of service k. When link (i, j) is the first link under the h-th subpath of service k, The value of is 1, otherwise, The value of is 0.
[0093] Since the variable h starts to accumulate from 2, when When the value of is 1, link (n, j) must be the first link under the second or subsequent subpaths under service k, so the meaning in the brackets of the total number of relays is: to determine whether link (n, j) is the first link on a subpath other than the first subpath in service k. Since node n is the source node of link (n, j), it is actually determined whether node n is a relay node in service k. Since k is cumulatively traversed, and when node n is a relay node in service k, The value of is 1, so what is actually found is the number of services with node n as the relay node in the faulty network e, that is, the number of relays added to node n.
[0094] Max e () indicates that the maximum value is taken from the number of relays of node n corresponding to all faulty networks e in the network topology, that is, the number of node relays is obtained; in actual situations, the probability of multiple links in the network failing at the same time is small, that is, a single link failure usually occurs, that is, there is usually only one faulty network in the network at the same time. When multiple faulty networks all contain the same node n, for example, three faulty networks e1, e2 and e3 are generated for three links respectively, and node n is included in e1, e2 and e3. When service recovery is performed in e1, if five services need to be restored, each service needs to set a relay on node n. In the faulty network e1, five relays are set on node n, and in the faulty network e2, four relays are set on node n, and in the faulty network e3, six relays are set on node n. Since there is usually only one faulty network in the network at the same time, the relays set on node n can be reused, that is, there are at most six relays on node n, which is the number of node relays. Then, by traversing and accumulating the node n, the sum of the relay numbers of all nodes in all faulty networks is obtained, that is, the total relay number is obtained.
[0095] In the objective function, the number of services restored is:
[0096]
[0097] When business k is calculated, t k The value of is 1, otherwise, t k The value of is 0. The number of services restored is obtained by adding the number of services successfully restored under all faulty networks e.
[0098] Among them, M and N are the weight of the total number of restored services and the weight of the total number of relays, respectively. Both M and N are fixed values obtained by technical personnel in this field based on the analysis of network topology and user needs.
[0099] This embodiment controls the proportions of the two objectives by performing weighted difference between the minimum number of relays and the total number of restored services, thereby maintaining a relative balance of the objectives according to the topology network or user requirements.
[0100] In actual situations, network fault analysis usually takes the maximum total number of services restored as the first goal and the minimum total number of relays as the second goal. In this regard, in combination with the above preferred embodiments, there is also the following preferred implementation method, that is, limiting the values of weights M and N, specifically including:
[0101] The value of M must be greater than the product of N and the maximum total number of relays.
[0102] This preferred implementation limits the ratio of M to N so that the weight of the total number of restored services is much greater than the weight of the total number of relays, thereby ensuring that the total number of restored services is at most the first goal and the total number of relays is at least the second goal.
[0103] In actual situations, when seeking the minimum value, the minimum positive value is usually required. For this situation, there is the following preferred implementation method, in which the mathematical model is solved to obtain the optimal optical network fault recovery path, such as Figure 5 As shown, specifically including:
[0104] In step 401, if the value of the objective function is negative, the weight corresponding to the total number of restored services is successively reduced within a preset range and the corresponding value of the objective function is calculated until the value of the objective function is positive.
[0105] In step 402, when the objective function is a positive value, the corresponding optical network fault recovery path is the optimal optical network fault recovery path.
[0106] This preferred implementation adjusts the weight of the number of restored services so that the calculated objective function becomes a positive value for ease of calculation.
[0107] The one or more constraint functions specifically include:
[0108] One or more of a source-destination node constraint function, a path connectivity constraint function, a loss constraint function, a link wavelength constraint function, and a relay quantity constraint function on a node.
[0109] The source-destination node constraint function is used to constrain that the transmission direction of the service between the source node and the destination node of the successfully restored service is unique.
[0110] The path connectivity constraint function is used to constrain each link on the path of successfully restored service transmission to be usable by the service, so that the service can reach the sink node from the source node along the corresponding path.
[0111] The loss constraint function is used to constrain the loss of each sub-path to not exceed the corresponding loss allowable range.
[0112] The link wavelength constraint function is used to constrain the number of channels occupied on the link to not exceed the number of channels allowed by the link.
[0113] The relay quantity constraint function on the node is used to constrain the number of relays added to a node to not exceed the range of the corresponding number of relays allowed to be added.
[0114] The types, number and form of the constraint functions used above are not completely fixed, but one or more of them can be selected for corresponding constraints according to the network fault recovery requirements of the topological network. Among them, the source-destination node constraint function and the path connectivity constraint function can constrain the uniqueness and integrity of the service path, and the loss constraint function, the link wavelength constraint function and the number of relays on the node constraint function can constrain the number of channels used on the link and the loss when reaching the relay node, thereby ensuring the normal arrival of the service. Based on the constraint function, the objective function is used to obtain the optimal optical network fault recovery path.
[0115] The source and sink node constraint functions are specifically:
[0116] For each service k that needs to be restored in the faulty network e, find the link (s, j) starting from the source node s of service k and the link (i, d) reaching the destination node d of service k among all the links used by service k.
[0117] When service k is successfully restored, there is only one link (s, j) corresponding to service k, and there is only one link (i, d) corresponding to service k.
[0118] When service k is not restored, there is no corresponding link (s, j) and link (i, d) for the service k.
[0119] The source-destination node constraint function is expressed in the form of mathematical formulas as the following formulas 1 and 2, where formula 1 is:
[0120] in
[0121] Formula 2 is:
[0122] in
[0123] s is the source node of service k, d is the sink node of service k, when service k is calculated, t k The value of is 1, otherwise, t k The value of is 0, It means that any service that needs to be restored in the faulty network e should satisfy the corresponding formula.
[0124] In formula 1, the decision variable The value of h in is limited to 1, the value of a is limited to 1, and the value of i is limited to s. In this case, Indicates whether link (s, j) is the first link under the first subpath of service k. When link (s, j) is the first link under the first subpath of service k, The value of is 1, otherwise, The value of is 0; wherein, the value of i is limited to s, or the values of h and a are limited to 1. Both of these methods can indicate whether the corresponding link is the first link under the first sub-path of service k. Either one can be used. Here, the two methods are combined to reduce the amount of calculation.
[0125] That is When the value of is 1, link (s, j) must be the first link under the first subpath of service k. Therefore, the meaning of Formula 1 is: for any service k that needs to be restored in the faulty network e, the following conditions must be met: when service k is successfully restored, there is only one link used by service k starting from the source node s of service k, that is, the direction of service k starting from the source node s is unique; when k is not restored, service k does not use any link after starting from the source node s.
[0126] In formula 2, the decision variable The value of b is limited to 1 and the value of j is limited to d. In this case, Indicates whether link (i, d) is the last link under the h-th subpath of service k. When link (i, d) is the last link under the h-th subpath of service k, The value of is 1, otherwise, The value of is 0.
[0127] That is When the value of is 1, link (i, d) must be the last link under the hth subpath of service k and reach the sink node d of the service. Therefore, the meaning of formula 1 is: for any service k in the network topology, the following conditions should be met:
[0128] When service k is calculated, service k uses only one link to reach the destination node d of service k, that is, the direction for service k to enter the destination node d is unique; when k is not calculated, service k does not use any link to enter the source node d.
[0129] The source-destination node constraint function jointly constrains the services that need to be restored in the faulty network e through Formula 1 and Formula 2, so that the departure direction and arrival direction of the services are unique, thereby ensuring that the transmission direction of the services is unique.
[0130] The path connectivity constraint function is specifically:
[0131] For each non-relay node n under each service k that needs to be restored in the faulty network e, the number of links (i, n) entering the node n under service k is the same as the number of links (n, j) departing from the node n under service k.
[0132] For each relay node m under each service k, the number of links (i, m) entering the node m under service k is the same as the number of links (m, j) departing from the node m under service k.
[0133] The path connectivity constraint function is expressed in the form of mathematical formulas as Formula 3 and Formula 4, where Formula 3 is:
[0134]
[0135] in n∈V and n≠s and n≠d;
[0136] Formula 4 is:
[0137]
[0138] in n∈V and n≠s and n≠d
[0139] n∈V and n≠s and n≠d means that under any service in the fault network e, any node except the source node s and the sink node d of the service should satisfy the corresponding formula.
[0140] On the left side of the equal sign in Formula 3, the decision variable The value of b is limited to 0, in which case, Indicates whether link (i, n) is the last link under the h-th path of service k. When link (i, n) is the last link under the h-th subpath of service k, The value of is 0. Otherwise, when link (i, n) is the link under the h-th subpath of service k, and link (i, n) is not the last link under the h-th subpath of service k, The value of is 1.
[0141] On the right side of the equal sign in Formula 3, the decision variable The value of a is limited to 0, in which case, Indicates whether link (n, j) is the first link under the h-th subpath of service k. When link (n, j) is the first link under the h-th subpath of service k, The value of is 0. Otherwise, when link (n, j) is the link under the h-th subpath of service k, and link (n, j) is not the first link under the h-th subpath of service k, The value of is 1;
[0142] Among them, link (i, n) and link (n, j) are links with node n as the sink node and node n as the source node respectively.
[0143] When node n is a relay node for service k, link (i, n) must be the last link of a subpath under service k, that is, is equal to 0, and link (n, j) must be the first link of a subpath under service k, that is, is equal to 0, so for the relay nodes in service k, formula 3 always holds true.
[0144] When n is a non-relay node of service k, the meaning of the left side of the equal sign of the above formula 3 is: among the links of service k, the number of links occupied by service k and whose sink node is non-relay node n; the meaning of the right side of the equal sign of the above formula 3 is: among the links of service k, the number of links occupied by service k and whose source node is non-relay node n. That is, the meaning represented by formula 3 is: for any service k that needs to be restored in the faulty network e, among all the links entering and exiting node n under service k, the number of links (i, n) entering node n is the same as the number of links (n, j) departing from node n.
[0145] On the left side of the equal sign in Formula 4, the decision variable The value of b is limited to 1, in which case, Indicates whether link (i, n) is the last link under the h-th subpath of service k. When link (i, n) is the last link under the h-th path of service k, The value of is 1, otherwise, The value of is 0.
[0146] On the right side of the equal sign in Formula 4, the decision variable The value of b is limited to 1, in which case, Indicates whether link (n, j) is the last link under the h+1th subpath of service k. When link (n, j) is the last link under the h+1th path of service k, The value of is 1, otherwise, The value of is 0.
[0147] When node n is a non-relay node for service k, link (i, n) must not be the last link under the hth subpath of service k, that is, is equal to 0, link (n, j) must not be the first link under the h+1th subpath of service k, that is, is equal to 0, so for non-relay nodes in service k, formula 4 is always valid.
[0148] When node n is a relay node for service k, the left side of the equal sign of formula 4 represents the number of links with node n as the destination node used by service k, and the right side of the equal sign represents the number of links with node n as the source node used by service k; that is, formula 4 means that for any relay node n of service k that needs to be restored under the faulty network e, the following conditions must be met: the number of links entering relay node n in service k is the same as the number of links departing from relay node n in service k.
[0149] The loss constraint function is specifically:
[0150] For each sub-path h under each service k that needs to be restored in the faulty network e, the loss of each link (i, j) under the sub-path h is added together to obtain the total loss of the sub-path h.
[0151] The total loss of each sub-path h is less than or equal to the corresponding preset loss threshold.
[0152] The loss constraint function is expressed in the form of a mathematical formula:
[0153] in
[0154] lf ij represents the loss of link (i, j), Th represents the preset loss threshold, and the preset loss threshold and are set by those skilled in the art according to the OSNR requirements of the user or network topology. The same preset loss threshold can be set for all links, or a corresponding preset loss threshold can be preset for each link. It means that for any sub-path of any service that needs to be restored in the faulty network e, the corresponding formula should be satisfied.
[0155] The above formula means that for any sub-path h under any service that needs to be restored in the faulty network e, the loss of each link under the sub-path h is added to obtain the total loss of the sub-path, and the loss of the obtained sub-path should be less than or equal to the corresponding preset loss threshold.
[0156] The link wavelength constraint function is specifically:
[0157] For each link (i, j) under the faulty network e, the sum of the number of services k1 occupying the channel in the forward direction and the number of services k2 occupying the channel in the reverse direction on the link (i, j) is less than or equal to the preset channel number threshold corresponding to the link (i, j).
[0158] The link wavelength constraint function is expressed in the form of a mathematical formula:
[0159]
[0160] in
[0161] |W ij | represents the maximum number of channels that can be supported on the link, that is, the preset channel number threshold, where W ij Represents the set of channels that can be supported on the link, |W ij | is the number of elements in the set. The preset channel number threshold is set by those skilled in the art based on the analysis of the topological network requirements. It means that for any link in the faulty network e, the corresponding formula should be satisfied.
[0162] On the left side of the above formula, the decision variable represents whether service k is using link (i, j) in the forward direction. Since a service must occupy a channel when using a link, the decision variable It can represent whether service k is occupying the channel on link (i, j). When service k is occupying the channel on link (i, j), The value of is 1, otherwise, The value of is 0.
[0163] Decision variables represents whether service k uses link (i, j) in the reverse direction. Since services must occupy a channel when using a link, the decision variable It can represent whether service k occupies the channel in the reverse direction on link (i, j). When service k occupies the channel in the reverse direction on link (i, j), The value of is 1, otherwise, The value of is 0.
[0164] That is, the left side of the above formula means: the number of all services occupying the channel in the forward direction on the link (i, j) plus the number of all services occupying the channel in the reverse direction on the link (i, j). The overall meaning of the above formula is: the number of channels occupied in the forward direction and the number of channels occupied in the reverse direction on the link (i, j) do not exceed the preset channel number threshold.
[0165] The relay quantity constraint function on the node is specifically:
[0166] For each node n in the faulty network e, find the service k in the faulty network e with the node n as a relay node, and the number of services k corresponding to the node n is less than or equal to the preset maximum relay number corresponding to the node n.
[0167] The relay quantity constraint function on the node is expressed in the form of a mathematical formula:
[0168] in
[0169] |R n | represents the maximum number of relays that can be set on node n, that is, the preset maximum number of relays, where R n is the set of relays that can be set on node n, |R n | is the number of elements in the set, and the preset maximum number of relays is set by those skilled in the art based on the analysis of path planning requirements in the topological network. It means that for any node n in the fault network e, the corresponding formula should be satisfied.
[0170] On the left side of the above formula, the decision variable In the example, a is limited to 1, and the cumulative range of h starts from 2. Used to indicate whether link (n, j) is the first link in any subpath of service k except the first subpath. When link (n, j) is the first link in any subpath of service k except the first subpath, The value of is 1, otherwise, The value of is 0.
[0171] The meaning of the left side of the above formula is similar to the total number of relays in the objective function. The meaning of the above formula is: the number of relays set on node n. The overall meaning of the above formula is: for each fault network e, the number of relays set on node n is less than or equal to the preset maximum number of relays |R n |.
[0172] In the actual calculation process, since there is a nonlinear operation of taking the maximum value in the objective function, that is, Max in the corresponding formula e (), so its objective function itself is nonlinear, and the established mathematical model is also nonlinear. In the solution process, the calculation process of the nonlinear mathematical model is usually more complicated than that of the linear mathematical model, and its calculation amount is also larger than that of the linear mathematical model. In order to reduce the calculation amount of solving the mathematical model and shorten the time of optical network fault analysis, there are the following preferred embodiments, which specifically include:
[0173] The objective function is transformed into a linear objective function and the corresponding constraint function, specifically: Introduce a new decision variable x n , which is used to represent the number of relays of each node n, and replaces the corresponding position in the objective function with this decision variable, and introduces the second constraint function of the number of relays on the node, which is used to constrain the number of relays on node n to be greater than or equal to the number of relays added when node n is located in any fault network.
[0174] The obtained new objective function is expressed in the form of a mathematical formula:
[0175]
[0176] Among them, the decision variable x n Represents the number of relays for node n.
[0177] The second constraint function of the number of relays on the newly introduced node is expressed in the form of a mathematical formula:
[0178]
[0179] in
[0180] The meaning of the second relay quantity constraint function is: for any node n, it should satisfy: the number of relays added to node n is greater than or equal to the number of relays added to node n in any fault network.
[0181] Based on the above objective function and constraint function, a specific implementation method of solving the mathematical model includes:
[0182] For each faulty network, one or more constraint functions are selected as a basis from one or more constraint functions to obtain an optical network fault recovery path planning situation that satisfies the selected constraint functions. Unselected constraint functions are then used to limit all possible optical network fault recovery path planning situations to narrow the range of optional optical network paths. Finally, the objective function is substituted to calculate the value of the objective function corresponding to the various optical network path planning situations after limitation. If the value of the objective function is positive, the optical network fault recovery path corresponding to the objective function is selected as the optimal optical network fault recovery path.
[0183] If the value of the objective function is negative, the weight corresponding to the total number of restored services is adjusted in a descending manner, and the value of the objective function is calculated again until the objective function is positive. The optical network fault recovery path corresponding to the positive objective function is used as the optimal optical network fault recovery path.
[0184] Another specific implementation method is to solve it by integer programming, and the algorithms that can be used include branch and bound method, cutting plane method, etc. In practical applications, since the scale of the topological network in practical applications is usually large, integer programming solvers are often used for solving, such as Cplex, Gurobi, etc.
[0185] Under the planned optical network corresponding to the optimal integer solution obtained by solving the data model, the total number of relays can be minimized and the total number of restored services can be maximized under the premise of satisfying the constraint function.
[0186] Embodiment 2:
[0187] The present invention is based on the method described in Example 1, combined with specific application scenarios, and uses technical descriptions in related scenarios to illustrate the implementation process of the present invention in characteristic scenarios.
[0188] like Figure 6 The figure shows an optical transmission network, in which there are 7 nodes A, B, C, D, E, F and G. The network topology composed of these 7 nodes has 9 links, namely (A, B), (A, C), (B, D), (B, E), (C, D), (C, F), (D, E), (E, G) and (F, G). The 1-80 channels corresponding to the 1-80 wavelengths on each link can be used, that is, the preset channel number threshold corresponding to each link is 80. When there is no link interruption in the network topology, each planned service and the corresponding paths and channels used are as follows:
[0189] There are 20 100G services from source node A to sink node E. The services pass through nodes A, B, and E in sequence, occupying wavelengths 1-20. The 20 services are recorded as s1-s 20 ;
[0190] There are 10 100G services from source node D to sink node G. The services pass through nodes D, E, and G in sequence, occupying wavelengths 1 to 10. The 10 services are denoted as s 21 -s 30 ;
[0191] There are 10 100G services from source node B to sink node G. The services pass through node B, node E and node G in sequence, occupying wavelengths 21-30. The 10 services are denoted as s 31 -s 40 ;
[0192] There are 10 100G services from source node F to sink node B. The services pass through nodes F, C, D, and B in sequence, occupying wavelengths 1 to 10. The 10 services are denoted as s 41 -s 50 .
[0193] The weight N corresponding to the total number of relays is set to 1. The weight M corresponding to the total number of services restored must be greater than the product of N and the maximum total number of relays. According to the scale of the topological network, the number of nodes in the network is obtained, and the possible number of relays on the nodes is calculated to set the weight M. Here, the value of M is set to 11520. The maximum number of sub-paths allowed in a service is set to 3.
[0194] Based on the interruption of each of the nine links, a corresponding fault network is established. For example, when link (A, B) is interrupted, services s1-s2 passing through link (A, B) are 20 The service T that needs to be repaired in the corresponding faulty network is interrupted. AB The set is s1-s 20 ; Similarly, when the link (B, E) is disconnected, the corresponding T BE The set is s1-s 20 and 31 -s 40 ; The set of fault networks consisting of 9 disconnected links is {e AB , e AC , e BD , e BE , e CD , e CF , e DE , e EG , e FG}.
[0195] For all fault networks in the topological network, an objective function is constructed; for each fault network, one or more constraint functions are constructed.
[0196] By solving the objective function and constraint function, the optimal optical network fault recovery path is obtained.
[0197] During the solving process, if the obtained value of the objective function is a positive value, the optical network fault recovery path corresponding to the minimum value of the objective function is selected as the optimal optical network fault recovery path.
[0198] If the value of the objective function is negative, the adjustable range and adjustment gradient of the weight M are formulated according to the scale of the topological network. In this embodiment, the adjustable range of the weight M is [6000, 11520], the adjustment gradient is 500, and the weight M is reduced by 500 from 11520 in sequence. The value of the objective function is recalculated each time it is reduced until the value of the objective function is positive. The optical network fault recovery path corresponding to the positive value of the objective function is used as the optimal optical network fault recovery path.
[0199] Embodiment 3:
[0200] like Figure 7 , which is a schematic diagram of the architecture of an optical network fault analysis device according to an embodiment of the present invention. The optical network fault analysis device according to this embodiment includes one or more processors 21 and a memory 22. Figure 7 A processor 21 is taken as an example.
[0201] The processor 21 and the memory 22 may be connected via a bus or other means. Figure 7 The example of connecting through bus is taken in the following.
[0202] The memory 22 is a non-volatile computer-readable storage medium that can be used to store non-volatile software programs and non-volatile computer executable programs, such as the optical network fault analysis method in Example 1. The processor 21 executes the optical network fault analysis method by running the non-volatile software programs and instructions stored in the memory 22.
[0203] The memory 22 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage devices. In some embodiments, the memory 22 may optionally include a memory remotely arranged relative to the processor 21, and these remote memories may be connected to the processor 21 via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0204] The program instructions / modules are stored in the memory 22, and when executed by the one or more processors 21, the optical network fault analysis method in the above-mentioned embodiment 1 and embodiment 2 is executed, for example, the above-described Figure 1 , Figure 2 and Figure 5 The steps shown.
[0205] It is worth noting that the information interaction, execution process, etc. between the modules and units within the above-mentioned devices and systems are based on the same concept as the processing method embodiment of the present invention. The specific contents can be found in the description of the method embodiment of the present invention and will not be repeated here.
[0206] A person skilled in the art may understand that all or part of the steps in the various methods of the embodiments may be completed by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, and the storage medium may include: a read-only memory (ROM), a random access memory (RAM), a disk or an optical disk, etc.
[0207] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the present invention.
Claims
1. A method for analyzing optical network faults, characterized in that: include: Multiple fault networks are established based on disconnecting each link in the network topology separately; Generate an objective function according to the established fault network and the services that need to be restored in the fault network, and generate one or more constraint functions for each fault network; the objective function is specifically: when the node is located in different fault networks, the maximum number of relays added to the node is used as the number of node relays, and the number of node relays of each node in each fault network is added to obtain the total number of relays; Adding the number of services successfully restored in each faulty network to obtain the total number of services restored; The objective function is the weighted difference between the total number of services restored and the total number of relays; the one or more constraint functions specifically include: one or more of a source-destination node constraint function, a path connectivity constraint function, a loss constraint function, a link wavelength constraint function, and a relay number constraint function on a node; Combining the objective function and the constraint function, a mathematical model is established with the goal of minimizing the total number of relays and maximizing the total number of services restored; Solve the mathematical model to obtain the optimal optical network fault recovery path; if the value of the objective function obtained by solving is a negative value, then the weight corresponding to the total number of restored services is successively reduced within a preset range and the corresponding objective function value is calculated until the value of the objective function is solved to be a positive value. When the objective function is a positive value, the corresponding optical network fault recovery path is the optimal optical network fault recovery path.
2. The optical network fault analysis method according to claim 1, characterized in that: The source and sink node constraint functions are specifically: For each service k that needs to be restored in the faulty network e, find the link (s, j) from the source node s of service k and the link (i, d) to the sink node d of service k among all the links used by service k; When service k is successfully restored, there is only one link (s, j) corresponding to service k, and there is only one link (i, d) corresponding to service k; When service k is not restored, there is no corresponding link (s, j) and link (i, d) for the service k.
3. The optical network fault analysis method according to claim 1, characterized in that: The path connectivity constraint function is specifically: For each non-relay node n under each service k that needs to be restored in the faulty network e, the number of links (i, n) entering node n under service k is the same as the number of links (n, j) departing from node n under service k; For each relay node m under each service k, the number of links (i, m) entering the node m under service k is the same as the number of links (m, j) departing from the node m under service k.
4. The optical network fault analysis method according to claim 1, characterized in that: The loss constraint function is specifically: For each sub-path h under each service k that needs to be restored in the faulty network e, add the loss of each link (i, j) under the sub-path h to obtain the total loss of the sub-path h; The total loss of each sub-path h is less than or equal to the corresponding preset loss threshold.
5. The optical network fault analysis method according to claim 1, characterized in that: The link wavelength constraint function is specifically: For each link (i, j) under the faulty network e, the sum of the number of services k1 occupying the channel in the forward direction and the number of services k2 occupying the channel in the reverse direction on the link (i, j) is less than or equal to the preset channel number threshold corresponding to the link (i, j).
6. The optical network fault analysis method according to claim 1, characterized in that: The relay quantity constraint function on the node is specifically: For each node n in the faulty network e, find the service k in the faulty network e with the node n as a relay node, and the number of services k corresponding to the node n is less than or equal to the preset maximum relay number corresponding to the node n.
7. An optical network fault analysis device, characterized in that: The device comprises: At least one processor; and a memory in communication with the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the processor to execute the optical network fault analysis method described in any one of claims 1-6.
