CN116094935A

CN116094935A - Flexible Ethernet technology-based power communication service protection method and related equipment

Info

Publication number: CN116094935A
Application number: CN202211551894.4A
Authority: CN
Inventors: 欧清海; 韦磊; 蔡昊; 张宁池; 王艳茹; 汪大洋; 江凇; 赵子岩; 张洁; 刘卉; 马文洁; 侯悦; 石慧; 石梦倩; 束一; 陈智雨; 李芳�; 赵俊峰; 孔祥余
Original assignee: State Grid Corp of China SGCC; State Grid Information and Telecommunication Co Ltd; China Academy of Information and Communications Technology CAICT; Information and Telecommunication Branch of State Grid Jiangsu Electric Power Co Ltd; Beijing Zhongdian Feihua Communication Co Ltd
Current assignee: State Grid Corp of China SGCC; State Grid Information and Telecommunication Co Ltd; China Academy of Information and Communications Technology CAICT; Information and Telecommunication Branch of State Grid Jiangsu Electric Power Co Ltd; Beijing Zhongdian Feihua Communication Co Ltd
Priority date: 2022-12-05
Filing date: 2022-12-05
Publication date: 2023-05-09

Abstract

The application provides a power communication service protection method and related equipment based on a flexible Ethernet technology, wherein physical nodes and physical links in a power communication network based on flexible Ethernet equipment are determined; iterating by utilizing an ant colony optimization algorithm and an pheromone matrix, and selecting the physical nodes and the physical links in each iteration to obtain an iterative output path; determining a global output path according to the iterative output path; updating the pheromone matrix according to all iteration output paths and global output paths obtained in each iteration process, and applying the pheromone matrix to the next iteration process; and outputting a final global output path obtained in the last iteration process in response to the iteration times, and obtaining a working channel and a protection channel of the power communication service. According to the method, the proper working channel and the protection channel are planned for the service in the network topology in advance, so that the resource utilization rate is improved while the service requirement and the rapid protection switching are ensured.

Description

Flexible Ethernet technology-based power communication service protection method and related equipment

Technical Field

The invention relates to a power communication service protection method based on a flexible Ethernet technology, in particular to a power communication service protection method which adapts to the characteristics of power communication service and improves an ant colony optimization algorithm to a certain extent.

Background

In order to understand the existing protection switching method, the existing papers and patents are searched, compared and analyzed, and the following papers with higher correlation degree with the invention are screened out:

literature scheme 1: the Dual Routing Equalization Algorithm for Power Communication Network Based on Improved KSP proposes an improved KSP-based power communication network dual-route balancing algorithm taking service transmission delay, service reliability, shared risk group and disjoint dual-route as constraint conditions and taking minimum standard deviation of link occupancy rate as an optimization target. The algorithm has short running time, can improve the balance degree of service load and reduce the service rejection rate. However, 2 paths are selected from k shortest paths, and too small k tends to result in high similarity of each path, and too large k tends to result in too long calculation time.

Literature scheme 2: a maximum disjoint double-route algorithm (the maximally disjoint routing algorithm under the most reliable loop strategy, MRMLS) under the most reliable loop strategy is proposed by a maximum disjoint double-route configuration method of an electric power communication network. The algorithm can allocate a set of double routes with the least common elements for the service, and the double routes meet the most reliable loop condition, which can further improve the reliability of the double routes. MRMLS has less time overhead and can ensure that the resulting dual route has higher reliability. However, the maximum disjoint double-route pair is obtained by a node splitting method in the algorithm solving process, the reliability of double-route is enhanced, but the design of the routing algorithm focuses on network connectivity, and the defects of insufficient use of network resources and service characteristics are overcome.

Literature scheme 3: the on Service Security-based Dual-route Allocation Algorithm for Power Communication Networks proposes an optimal Dual routing algorithm ODR (Optimal Double Route) based on traffic security, and two node separation paths with highest security are configured for each traffic. Compared with the simplest dual-route algorithm RF (Remove-Find), the service capacity of the ORD algorithm is improved by 9.07%, the service path security is improved by 20.4%, and the ORD algorithm has a certain guiding value for service deployment and network planning in actual engineering. However, the method has the defect that the sum of the safety of the two paths is the minimum, the node and the link are configured for each service through an improved Bhandair algorithm to be completely separated, so that the configuration of the main and standby routes based on the service safety is realized, other indexes of the service are not considered in the configuration, and the consideration of the whole network service cannot be integrated.

Disclosure of Invention

In view of the foregoing, it is an object of the present application to provide a method, an apparatus, an electronic device and a storage medium for protecting an electric power communication service based on a flexible ethernet technology, so as to solve or partially solve the above-mentioned ending problem.

Based on the above object, a first aspect of the present application provides a power communication service protection method based on flexible ethernet technology, the method comprising:

Acquiring a power communication network based on flexible Ethernet equipment;

determining physical nodes and physical links in a network according to the power communication network;

setting iteration times of an ant colony optimization algorithm and an pheromone matrix;

iterating by utilizing an ant colony optimization algorithm and a pheromone matrix, selecting the physical node and the physical link in each iteration, and connecting the selected physical node and the physical link to obtain an iteration output path;

determining a global output path according to the iterative output path;

updating the pheromone matrix according to all iteration output paths and global output paths obtained in each iteration process, and carrying out the next iteration process by utilizing the updated pheromone matrix;

outputting a final global output path obtained in the last iteration process in response to reaching the iteration times;

according to the final global output path, a working channel and a protection channel of the power communication service are obtained

A second aspect of the present application proposes a flexible ethernet technology based power communication service protection device, the device comprising:

an information determining module configured to acquire a flexible ethernet device-based power communication network; determining physical nodes and physical links in a network according to the power communication network;

The iteration output path determining module is configured to set the iteration times of the ant colony optimization algorithm and the pheromone matrix; iterating by utilizing an ant colony optimization algorithm and a pheromone matrix, selecting the physical node and the physical link in each iteration, and connecting the selected physical node and the physical link to obtain an iteration output path;

a global output path determination module configured to determine a global output path from the iterative output paths;

the pheromone matrix updating module is configured to update the pheromone matrix according to all iteration output paths and global output paths obtained in each iteration process, and the next iteration process is carried out by utilizing the updated pheromone matrix;

the channel determining module is configured to output a final global output path obtained in the last iteration process in response to reaching the iteration times; and according to the final global output path, a working channel and a protection channel of the power communication service are obtained.

A third aspect of the present application proposes an electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, said processor implementing the method of the first aspect when executing said program.

A fourth aspect of the present application proposes a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of the first aspect.

From the above, it can be seen that, according to the power communication service protection method, device, electronic equipment and storage medium based on the flexible ethernet technology provided in the embodiments of the present application, on the basis of the power communication service, through the ant colony optimization algorithm, a suitable working channel and protection channel are planned for the service in the network topology in advance, so that the service requirement and the rapid protection switching are ensured, the resource utilization rate is improved, and the method and the device have good adaptability in the case of a multilink fault.

Drawings

In order to more clearly illustrate the technical solutions of the present application or related art, the drawings that are required to be used in the description of the embodiments or related art will be briefly described below, and it is apparent that the drawings in the following description are only embodiments of the present application, and other drawings may be obtained according to these drawings without inventive effort to those of ordinary skill in the art.

Fig. 1 is a schematic flow chart of a flexible ethernet technology-based power communication service protection method according to an embodiment of the present application;

fig. 2 is a schematic structural diagram of a power communication service protection device based on a flexible ethernet technology according to an embodiment of the present application;

fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.

Detailed Description

For the purposes of making the objects, technical solutions and advantages of the present application more apparent, the present application will be further described in detail below with reference to the accompanying drawings.

It should be noted that unless otherwise defined, technical or scientific terms used in the embodiments of the present application should be given the ordinary meaning as understood by one of ordinary skill in the art to which the present application belongs. The terms "first," "second," and the like, as used in embodiments of the present application, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", etc. are used merely to indicate relative positional relationships, which may also be changed when the absolute position of the object to be described is changed.

In recent years, with the diversification of services and application scenarios, network development puts higher demands on the bandwidth of a bearer network, and meanwhile, users wish to carry various different services through a unified network, and these demands put higher demands on network interfaces. The link rate of the bottom optical transmission network is fixed, the interfaces and the modules are fixed, and if the bottom transmission modules are adjusted to meet various transmission requirements, the cost is high and the bottom optical transmission network cannot adapt to the requirements. The flexible Ethernet (Flexible Ethernet, abbreviated as FlexE) technology is a technology developed on the basis of the Ethernet technology to meet the requirements of high-speed transmission, flexible bandwidth configuration, and the like.

FlexE is a communication protocol established by the international standards organization optical internet forum (Optical Internetworking Forum, OIF for short) based on IEEE 802.3/1. FlexE technology aims to decouple the traffic rate from the physical channel rate, and multiple clients can share the total rate of the physical channels in the FlexE group. This core function is achieved by inserting an extra logical layer FlexE shimm layer in between the physical coding sub-layer (Physical Coding Sublayer, abbreviated PCS) and the medium access control layer (Media Access Control, abbreviated MAC) of the port physical layer (Port Physical Layer, abbreviated PHY) of the conventional ethernet architecture and by means of a slot distribution mechanism. The Shim layer separates the service logic layer from the physical layer, and in the FlexE 1.0 standard, each 100GE PHY in the FlexE group can be divided into data-carrying channels of 20 slots, and the bandwidth corresponding to each slot in the group of slots corresponding to each PHY is 5Gbps. According to the mapping relation between the client and the FlexE group, the FlexE can provide three application modes of link binding, subrate and channelization.

To ensure stability of the power communication service, protection of the power communication service needs to be implemented based on FlexE technology. The related scheme of the current FlexE protection mainly comprises link protection schemes such as linear protection, ring network protection and the like, and has the advantages of high protection switching speed and high recovery efficiency. But this protection mode has low resource utilization, lacks flexibility, and generally only considers single link failure. In order to solve the problem, the embodiment of the application designs a dual-channel communication power service protection method based on an ant colony optimization algorithm, which adapts the ant colony algorithm to the power communication service characteristics and improves the characteristics to a certain extent, so that the purpose of quickly planning a working channel and a protection channel for the power communication service is achieved, the proper working channel and protection channel are planned for the service in network topology in advance, the service requirement and the quick protection switching are ensured, the resource utilization rate is improved, and the method has good adaptability in the case of multi-link faults.

Based on the above description, referring to fig. 1, a flow chart of a photovoltaic power station wiring method according to a real-time example of the present application is shown.

As shown in fig. 1, the method for protecting power communication service based on flexible ethernet technology according to this embodiment includes:

Step 101, acquiring a power communication network based on flexible Ethernet equipment; and determining physical nodes and physical links in the network according to the power communication network.

In a specific implementation, a power communication Network G (N, E) based on a flexible ethernet device is obtained, where N is a set of physical nodes, each physical node can sense FlexE, where E is a set of physical links, and each physical node has a certain number of interfaces, and the two types of Network-Network interfaces (Network-Network Interface, NNI) and User-Network interfaces (User-Network Interface, UNI) are respectively classified. The NNI interfaces are used for transmitting and receiving power grid services. And one physical link contains slots of the same size. In addition, a FlexE interface group consists of interfaces on some same nodes, and each NNI interface necessarily belongs to a FlexE interface group; a FlexE group consists of physical links between several identical node pairs, and each physical link necessarily belongs to a FlexE group; each FlexE group corresponds to two FlexE interface groups. And determining the positions of each physical node and each physical link and the relation between the physical nodes and the physical links according to the acquired information of the power communication network, and determining the FlexE interface group and the FlexE group of each physical node and each physical link. The physical nodes further comprise source nodes and destination nodes, wherein the source nodes are physical nodes serving as information sources for sending original data packets; the sink node refers to a physical node that serves as a sink to accept packets.

In the above scheme, various information of the power communication network is acquired, a foundation is laid for planning service channels of the power communication network subsequently, and in the power communication network, two channels are required to be planned for each power communication service, one is a working channel and the other is a protection channel.

102, setting iteration times of an ant colony optimization algorithm and a pheromone matrix; and iterating by utilizing an ant colony optimization algorithm and a pheromone matrix, selecting the physical nodes and the physical links in each iteration, and connecting the selected physical nodes and the physical links to obtain an iteration output path.

In specific implementation, an ant colony optimization algorithm is utilized to acquire an iteration output path, firstly, iteration times and an pheromone matrix are initially set, and are continuously updated in subsequent debugging, so that the most suitable iteration times and initial pheromone matrix are found; when the ant colony optimization algorithm is used for acquiring the iterative output path, firstly, setting a proper path for how many ants select, namely setting a proper path for how many initial paths, and further, selecting the next-hop physical node and the physical link according to the known physical node and physical link pair, and connecting the selected physical node and the physical link to acquire the iterative output path.

In the scheme, the iteration times and the pheromone matrix are initially set, and the process of continuously updating in the subsequent debugging is that in order to find the optimal solution, the iteration times and the initial pheromone matrix which can obtain the best path are determined through continuous debugging; in the setting of ant number, that is, setting of how many initial paths, the number of the ant number is obtained through multiple times of debugging, and an optimal iterative output path is obtained according to the selection process of a plurality of next-hop nodes and physical links.

Step 103, determining a global output path according to the iterative output path.

In the specific implementation, according to the iteration output path obtained in each iteration, a global output path is obtained, and the global output path is updated through a certain comparison process.

Each iteration obtains an iteration output path, the iteration output path of each iteration is compared with the global output path, if the current iteration output path is better than the current global output path, the current global output path is updated to be the current iteration output path, otherwise, the global output path is kept unchanged.

Step 104, updating the pheromone matrix according to all iteration output paths and global output paths obtained in each iteration process, and carrying out the next iteration process by utilizing the updated pheromone matrix.

In the specific implementation, according to all iteration output paths and all global output paths obtained in each iteration process, the pheromone matrix is updated by utilizing the difference of physical links in the two paths, and after the pheromone is updated, the iteration output paths are obtained in the next iteration process.

In the above scheme, the update of the pheromone matrix is to increase the exploration of different physical links, and because in the selection of the physical links, the connection of different physical links may obtain different paths, the selection of the physical links and the pheromone thereof have a great relationship, and the higher the pheromone is, the higher the probability that the physical link is selected, and by continuously updating the pheromone matrix, each physical link can be explored, thereby avoiding the situation of obtaining a local optimal solution.

Step 105, outputting a final global output path obtained in the last iteration process in response to reaching the iteration times; and according to the final global output path, a working channel and a protection channel of the power communication service are obtained.

In the implementation, if the preset iteration times are reached, the iteration is ended, and the obtained global output path, namely the optimal solution obtained in the multiple iterations, is output to obtain the working channel and the protection channel of the power communication service.

In the scheme, the iteration times are the final optimal iteration times obtained through multiple experiments, so that the global output path obtained after the global output path is continuously updated is the optimal global output path, and the global output path is taken as the final solution, so that the resource utilization rate is improved while the service requirement and the rapid protection switching are effectively ensured.

In some embodiments, step 102 specifically includes:

step 1021, presetting a plurality of initial paths by using an ant colony optimization algorithm in each iteration;

step 1022, responding to the next hop node and physical link for determining the current position of the starting path for any one of the starting paths;

step 1023, connecting the initial path with a plurality of next hop nodes and physical links to obtain a first iterative output path;

step 1024, determining a plurality of first iteration output paths obtained by the plurality of initial paths;

step 1025, calculating the objective function of each first iteration output path by using an objective function calculation method; comparing the objective functions of the plurality of first iteration output paths, and taking the first iteration output path with the minimum objective function value as the iteration output path corresponding to the iteration process.

In the specific implementation, in each iteration, the ant colony optimization algorithm is utilized to calculate the iteration output paths, and the number of the initial paths, namely the number of ants, needs to be preset at the beginning. In selecting a path, multiple next hop node and physical link selections are required. Connecting an ant, namely a plurality of next hop nodes of a starting path, with the starting path, and obtaining a first iteration output path after reaching the end point. Since there are multiple starting paths, multiple first iteration output paths can be obtained. Comparing the obtained first iteration output paths, and taking the path with the smallest objective function as the iteration output path corresponding to the iteration process.

In the above-described scheme, by setting a plurality of ants, that is, a plurality of start paths, a plurality of first iterative output paths can be obtained. The number of the initial paths is also determined after multiple times of debugging. And the iterative output paths obtained by comparing the plurality of first iterative output paths are optimal first iterative output paths, so that the optimality of the iterative output paths obtained by each iteration is ensured from the first aspect.

In some embodiments, step 1022 specifically includes:

step 10221, obtaining an identification number list isAllowed of all next-hop nodes which can be reached by the current position according to the physical nodes and the physical links in the network;

step 10222, confirming a physical link meeting the time delay and bandwidth requirements from the identification number list isAllowed;

step 10223, in response to any one of the next-hop nodes not having the physical link, determining to delete the next-hop node having no physical link in the identifier list, and then re-selecting the next-hop node;

step 10224, in response to the existence of the physical link of any one of the next-hop nodes, determining specific information of the next-hop nodes and the physical link:

calculating a probability that the physical link is selected:

wherein, probability [ k ]]For the probability that a physical link is selected, k is any number, where nodeIdA and nodeIdB represent the node identification numbers at both ends OF the selected physical link, OF _k Said objective function representing the current path, phenomenone [ nodeIdA ]][nodeIdB]Representing pheromones on the selected physical link, θ+β=1, θ and β being parameters for adjusting weights;

Performing the selected probability calculation on all next hop nodes in the identification number list isAllowed to obtain a probability array;

summing all values in the probability array to obtain a sum of probabilities sum;

let all k e isAllowed,

so that all from the probability ₁ [k]The obtained probability ₁ The sum of the probabilities of the arrays is 1;

generating a random number between 0 and 1, and sequentially accumulating probability ₁ [k]When the accumulated value is larger than the random number, taking the next hop node corresponding to the current k value and the physical link as a result;

determining that the selection is successful in response to that a physical link connected with a next-hop node corresponding to the current k value meets the time delay and bandwidth requirements, and recording information of the next-hop node and the physical link corresponding to the current k value;

and responding to the fact that the identification number list isAllowed is empty, determining that the selection fails, and carrying out the next hop node selection again after initializing.

In the implementation, according to the information of the communication node set and the physical link information, all next hop nodes and physical links which can be reached by the current node can be collected into an identification number list isAllowed containing all the reachable next hop nodes, and whether a FlexE group id list and a physical link id list with enough time slot bandwidth exist for the next hop nodes in the identification number list is calculated. Randomly selecting from said list a physical link (which may be a plurality but must be in the same FlexE group) where there is a next hop node that meets latency and bandwidth requirements: three situations can occur in the process, firstly, if a physical link id list and a FlexE group id list do not exist, the fact that a physical link meeting the requirements does not exist is indicated, the ids of corresponding nodes are deleted from an identification number list isAllowed, and next node selection is directly carried out; secondly, if a physical link id list exists, randomly selecting an id in the physical link id list as a path; and finally, if the physical link id list does not exist, but the FlexE group id list exists, namely, a plurality of physical links under the same FlexE group are needed to meet the bandwidth delay requirement, one id is randomly selected in the FlexE group id list, and the physical links are sequentially selected in the corresponding FlexE group until the bandwidth (a plurality of physical links can be met). And then calculating the specific physical link and the next hop node according to the last two cases. In the probability calculation of the physical link being selected, if the array corresponding subscript does not exist, that is, if the physical link between the representative nodeIdA and nodeIdB does not exist in the identification number list isAllowed, the probability value is represented by 0. Furthermore, when the calculation is followed but the selection is unsuccessful, the identification number list isAllowed being empty includes two cases: one is that there may not be a next hop to reach, and one is that to reach, but is deleted because there is no suitable physical link.

In the above scheme, the FlexE group id list means that in one FlexE group, multiple physical links together can meet the requirements of delay and bandwidth; the physical link id list refers to the fact that a single physical link exists to meet latency and bandwidth requirements. The physical link obtained by the method can meet the time delay and bandwidth requirements. If the next hop node and the physical link exist, the selection process of the next hop node is entered until the destination is reached; the selection procedure of the next-hop node and the physical link at the current position is re-entered if the next-hop node and the physical link do not exist.

In some embodiments, prior to step 1025, further comprising:

step 10250, the objective function includes: an objective function of the working channel and an objective function of the protection channel;

in response to calculating the path of the working channel, determining an objective function using the working channel as:

min{αT ^ω +(1-α)CSE ^w }

wherein, service _num ^w (e _a,b,c ) Representing the physical link e in the network _a,b,c The number of working channels to be carried,

and->

Maximum and minimum representing the number of physical link working channels in the network, weight ^w (e _a,b,c ) Representative service _num ^w (e _a,b,c ) Normalized value, CSE ^w Representing the service balance of the working channel in the network,/- >

Representing weight ^w (e _a,b,c ) Is the average value of (E) is the number of physical links, T ^w Channel delay representing the current service working channel, +.>

Representing working channel->

Is represented by the light velocity, alpha is the weight parameter, min { alpha T ] ^ω +(1-)CSE ^w -is the final objective function calculation;

in response to calculating the path of the protection channel, determining an objective function using the protection channel as:

/>

min{[αT ^p +(1-α)CSE ^p ]×e ^cI }

wherein, service _num ^P (e _a,b,c ) Representing the physical link e in the network _a,b,c The number of protection channels to be carried,

and->

Weight representing the maximum and minimum number of physical link protection channels in a network ^p (e _a,b,c ) Representative service _num ^p (e _a,b,c ) Normalized value, CSE ^p Representing the protection channel traffic balance in the network, < > and->

Representing weight ^w (e _a,b,c ) Is the average value of (E) is the number of physical links, T ^p Channel delay representing the current traffic protection channel, +.>

Representing a protection channel->

Is the light velocity, CI ⁿ Representative service s _i Node intersection of working channel and protection channel, CI ^l Representative service s _i Link-level channel intersection of working channel and protection channel, CI representing traffic s _i The channel intersection of the working channel and the protection channel,

representing the number of nodes used by the working channel and the protection channel, < > which are the same >

Representing the number of working channels>

Representing the number of protection channels>

Representing the number of identical physical links used by the working channel and the protection channel, S representing the service S _i Set of->

And (3) calculating a formula for a final objective function, wherein alpha is a weight parameter.

In the implementation, there are two kinds of objective functions, namely, an objective function of a working channel and an objective function of a protection channel. When calculating the working channel, an objective function calculation formula of the working channel is used, and when calculating the protection channel, an objective function calculation formula of the protection channel is used. The objective function calculation formula of the two channels consists of channel average time delay, main and standby channel intersection degree and service equilibrium degree. In addition, in CI ⁿ And CI (CI) ^l In the solving formula of (c),

representing all physical links traversing the working channel and the protection channel; n is n ^s (c _i,a )＝ ^s (c _i,b ) And selecting two physical links (one in a working channel and one in a protection channel), satisfying that physical nodes at one end are identical (such as nodes near one end of a source node) to count the same number of nodes except for a destination node, multiplying 2 by 2 in a formula to exclude the source node, and finally calculating the same node duty ratio.

In the above scheme, the communication power service has higher time delay requirement, the first part of the objective function represents the requirement of low time delay, the time delay generated by each section of physical link is calculated through the length and the light speed of the physical link, and the time delay of the whole path is obtained by calculating the sum of the time delays. In order to ensure that the probability that the link faults affect two channels simultaneously is as small as possible, the working channel and the protection channel are prevented from using the same physical link or node as much as possible, the second part of the objective function represents the requirement that the channels are approximately disjoint, the intersection degree of the working channel and the protection channel is measured by the intersection degree of the working channel and the protection channel, the intersection degree of the working channel and the protection channel is the average value of the intersection degree of the nodes and the intersection degree of the channels, the node intersection degree can be obtained by calculating the duty ratio of the same nodes except the source and destination nodes used by the two channels, and the channel intersection degree can be obtained by calculating the duty ratio of the same physical link used by the two channels. On the basis of the first two points, the distribution degree of the service on each physical link is considered, the situations that part of physical link bearing service is too concentrated and part of physical link bearing service is too little are avoided, the third part of the objective function represents the equilibrium degree of the communication power service, and the average square error measurement of the service quantity borne by each physical link after normalization processing is used. The above three key indexes are comprehensively considered, so that the objective function matched with the requirement is set.

In some embodiments, step 103 specifically includes:

step 1031, using the iteration output path obtained by the first iteration as a global output path;

step 1032, comparing the obtained objective function of the iterative output path with the objective function of the global output path, and updating the path with the minimum objective function to the global output path.

In specific implementation, the iteration output path obtained in the first iteration is used as a global output path, but in each iteration, the objective function of each new iteration output path is compared with the objective function of the current global output path, the objective function is small to be used as a better path, if the current iteration output path is better than the current global output path, the current global output path is updated to be the current iteration output path, otherwise, the global output path is kept unchanged.

According to the steps, the global output path is updated once through the comparison process, and the global output path with the minimum objective function, namely the optimal global output path, is obtained.

In some embodiments, step 104 specifically includes:

step 1041, obtaining optimal path change information through a difference set between a physical link set of the iterative output path obtained in each iterative process and a physical link set of the global output path of the current iteration;

Step 1042, updating the pheromone matrix according to the best path change information.

In the specific implementation, the optimal path change information is obtained through the difference set of the physical link set of the iterative output path obtained in each iterative process and the physical link set of the global output path of the current iteration. The best path change information refers to a set of physical links that includes the physical link set ioslotion of all previous iterative output paths and does not include the physical link set bioslotion of the current global output path. And updating the pheromone matrix by using the physical link set of the optimal path change information after the optimal path change information is obtained.

In the above scheme, the main purpose of the obtained optimal path change information is to make the updated pheromone in the pheromone matrix better when updating the pheromone matrix, and in the iterative output path, some physical links which are not utilized by the global output path have higher exploration possibility. So that the selection of the next hop node and the physical link is more comprehensive.

In some embodiments, step 1042 specifically comprises:

step 10421, calculating a value of pheomone [ a ] [ b ] '=pheomone [ a ] [ b ] [ ρ ] for all values of the pheromone matrix, wherein the pheomone [ a ] [ b ] refers to each pheromone in the pheromone matrix, pheomone [ a ] [ b ]' is an updated value of the corresponding pheomone [ a ] [ b ], a and b are arbitrary values, and ρ is a proportion of the pheromone left after each iteration;

Step 10422, for all physical links e included in the best path change information _c,d,e ∈E _c,d Calculation of pheomone [ c ]][d]′＝pheromone[c][d]+1/OF (iteratorOptimalPath), where E _c,d Representing a set of all physical links connected between physical node c and physical node d, e _c,d,e Represents E _c,d E represents the physical link sequence number in the set, OF (iteratorOptimalPath) is the objective function of the iterative output path, pheomone [ c ]][d]Refers to pheromone corresponding to each physical path contained in the optimal path change information in the pheromone matrix, and the pheromone [ c ]][d]' is the corresponding pheomone [ c ]][d]C and d are arbitrary values;

step 10423, for all physical links e contained in the global output path _f,g,e ∈E _f,g Calculation of pheomone [ f ]][g]′＝pheromone[f][g]+1/OF (globalOptimalPath), where E _f,g Representing a set of all physical links connected between physical node f and physical node g, e _f,g,e Represents E _f,g E represents the physical link sequence number in the set, OF (globalOptimalPath) is the objective function of the global output path, phersone [ f ]][g]Refers to pheromone corresponding to each physical path contained in a global output path in an pheromone matrix][g]' is the corresponding pheomone [ f ] ][g]F and g are arbitrary values;

step 10424, resetting the element which is smaller than minPheromone and is not 0 in the pheromone matrix to minPheromone, wherein minPheromone is the lower bound of the element value of the pheromone matrix;

step 10425, resetting the element larger than maxpherenone in the pheromone matrix to maxpherenone, wherein maxpherenone is the upper bound of the element value of the pheromone matrix;

step 10426, obtaining an updated pheromone matrix.

In the specific implementation, 1. The pheromone is volatilized, the pheromone left by ants in nature volatilizes along with the time, ρ is the proportion of the former pheromone left after each iteration, so that the pheomone [ a ] is calculated for all values of the pheromone matrix][b]′＝pheromone[a][b]* ρ is such that each pheromone phiomone [ a ] in the pheromone matrix][b]All multiply ρ to get updated pheromone pheomone [ a ]][b]'A'; 2. the new explored path is additionally enhanced by pheromone and the increment is stored in the pheromone matrix, so that the diversity of the solution can be increased, and all physical links e contained in the optimal path change information Vinformation are correspondingly processed _c,d,e ∈E _c,d Calculation of pheomone [ c ]][d]′＝pheromone[c][d]+1/OF (iteratorOptimalPath) such that the pheromone phiomone [ c ] corresponding to each physical link contained in the optimal path change information ][d]Are added with 1/OF (iteratorOptimalPath) to obtain the pheromone of physical link in the updated optimal path change information][d]'A'; 3. updating pheromone on the solution of the global output path, increasing the probability of exploring the vicinity of the solution of the global output path, so as to update all physical links e contained in the solution of the global output path _f,g,e ∈E _f,g Calculation of pheomone [ f ]][g]′＝pheromone[f][g]+1/OF (globalOptimalPath) such that the pheromone phiomone [ f ] corresponding to each physical link contained in the global output path][g]Are added with 1/OF (globalOptimalPath) to obtain the updated global output path which contains the pheromone pheomone [ f ] corresponding to the physical link][g]'A'; 4. resetting elements which are smaller than minPheromone and are not 0 in the pheromone matrix to the minPheromone in order to limit the element size of the pheromone matrix; resetting elements larger than maxPhereome in the pheromone matrix to maxPhereome; 5. the maxpheresone is set as an estimate of the asymptotic maximum of the pheromone matrix element, and thus the maxpheresone is updated,

6. and obtaining the updated pheromone matrix.

In the scheme, the pheromone matrix is updated by utilizing the volatilization mechanism of the pheromone in the ant optimization algorithm, the pheromone of the physical link which is not explored so far is enhanced during updating, the pheromone with higher numerical value in the prior pheromone matrix is reduced, the size of elements in the pheromone matrix is limited, the updating of one pheromone matrix is completed, the explored physical link is more comprehensive in one iteration process, and the situation of local optimal solution is avoided.

In some embodiments, step 104 further comprises, after:

judging whether the updated pheromone matrix falls into stagnation or not, comprising:

acquiring a solution set matrix A obtained after the last iteration and a solution set matrix B obtained after the current iteration, wherein when elements in the solution set matrix A and the solution set matrix B are physical links contained in the first iteration output path, the elements are represented by a character x; when an element in the matrix a and the matrix B is not a physical link included in the first iterative output path, the element is denoted by a character y;

adding the solution set matrix A and the solution set matrix B to obtain a matrix C formed by a plurality of elements of x, y and z, wherein z is a value obtained by adding two characters x;

calculating the duty ratio of the element with the value z in the matrix C in the sum of the number of the elements with the values x and z;

determining that the updated pheromone matrix falls into stagnation according to the fact that the duty ratio is larger than or equal to a first value;

determining that the pheromone matrix does not fall into stagnation according to the fact that the duty ratio is smaller than a first value;

in response to trapping the stall, determining to use a smoothing mechanism on the pheromone matrix, comprising:

changing the pheromone [ h ] [ l ] at the position corresponding to the element position in the pheromone matrix according to the element position with the value z in the matrix C, changing the pheromone at the corresponding position into the pheromone [ h ] [ l ] = rho (maxPahereome-pheomone [ h ] [ l ]), resetting the value of each obtained pheromone [ h ] [ l ] smaller than the value of minPheomone to be minPheomone, and after the value larger than maxPahereome is reset to maxPahereome, entering the next iteration;

Wherein h and l are element subscripts of the corresponding positions in the matrix C and the pheromone matrix, and h and l are arbitrary values;

in response to not falling into a stall, it is determined to enter the next iteration.

In the implementation, a judgment is needed to be carried out on the updated pheromone matrix, a solution set matrix A obtained after the previous iteration and a solution set matrix B obtained after the current iteration are obtained, the two solution set matrices are composed of two elements of a character x and a character y, when the elements in the solution set matrix A and the solution set matrix B are physical links contained in the first iteration output path, the elements are represented by the character x, namely, when the elements in the solution set matrix A are physical links contained in the first iteration output path obtained after the previous iteration, the elements in the solution set matrix B are represented by the x, and when the elements in the solution set matrix B are physical links contained in the first iteration output path obtained after the current iteration, the elements are not represented by the character y; the matrix C consisting of elements of x, y and z, obtained by adding the solution set matrices a and B, may be 1, y may be 0, and z may be 2. Wherein z is a value obtained by adding two x, and the first value may be 90% when judging whether the pheromone matrix is stuck according to the duty ratio.

In the above scheme, the process of judging whether the pheromone matrix falls into the stagnation by using the solution set matrix A and the solution set matrix B is to judge the similarity of the two solutions, if the similarity is too high, it can judge that the stagnation is fallen into, a smoothing mechanism is used, and if the similarity is not high, it can enter the next iteration.

In some embodiments, step 105 specifically includes:

step 1051, after the first iteration is finished, the obtained final global output path is a working channel;

at step 1052, after the second iteration is completed, the obtained final global output path is a protection channel.

In the specific implementation, when all processes run once, namely the first round of iteration is finished, the obtained global output path is a working channel; and when all the processes run for the second time, namely the second round of iteration is finished, the obtained global output path is taken as a protection channel.

In the above scheme, in the power communication service, the working channel and the protection channel are pre-planned, so that the resource utilization rate can be improved while the service requirement and the rapid switching are ensured.

Based on the same inventive concept, the embodiments of the present application may also be described as follows, as with any of the embodiments methods described above:

Given a power communication network G (N, E). N is a physical node set, and each node can sense FlexE; e is a collection of physical links, each representing a 100G PHY.

Each physical node has a certain number of interfaces, which are divided into NNI (Network-Network Interface ) and UNI (User-Network Interface, user-Network interface). The NNI interface is connected with the physical node and a physical link; the UNI interface is used to send and receive grid services.

Represents the NNI set on the ith physical node,/->

Representative and interface->

A connected physical link.

Representing the UNI set on physical node i.

E _i,j ＝{e _i,j,1 ,e _i,j,2 ,…,e _i,j,k … represents a set of physical links connecting the ith physical node interface and the jth physical node interface. L (e) _i,j,k ) Representing the physical link e _i,j,k Length of b (e) _i,j,k ) Representing the physical link e _i,j,k Bandwidth capacity of b ^u (e _i,j,k ) Representing the physical link e _i,j,k Used bandwidth of (i.e. sum of actual used bandwidths in occupied time slots), b ^o (e _i,j,k ) Representing the physical link e _i,j,k P ^a (e _i,j,k ) Representing the physical link e with the ith physical node _i,j,k Connected interface, p ^z (e _i,j,k ) Representing the physical link e with the j-th physical node _i,j,k And a connected interface.

One physical link contains four different sized time slots: 5G slots, 1G slots, 100M slots, and 10M slots.

Representing the physical link e _i,j,k In a set of 5G slots. Other types of time slots are represented in a similar manner, with superscripts being used to distinguish between different types of time slots.

An interface group consists of interfaces on some same physical node, and each NNI interface necessarily belongs to a certain interface group.

Representing a FlexE interface group set on the ith physical node,

representing the kth FlexE interface group on the physical node, a, b, c representing any natural number.

A FlexE group consists of physical links between several identical pairs of physical nodes, and each physical link must belong to a FlexE group. G ^e Representing all FlexEA set of groups (FlexE groups),

representing a FlexE group set connecting an ith physical node and a jth physical node,/->

Represents FlexE group->

The set of physical links contained in the system, a, b and c represent any natural number.

Each FlexE group corresponds to two FlexE interface groups.

Represents the FlexE interface group->

Corresponding FlexE group,/->

Represents FlexE group->

FlexE interface group on corresponding physical node i,/->

Represents FlexE group->

A FlexE interface group on the corresponding physical node j.

S＝{s ₁ ,s ₂ ,…,s _i … represents a collection of power communication traffic in a network topology that requires configuration of working and protection paths. N (N) ^s (s _i ) Representing the source point, p, of the ith service ^s (s _i ) Source port representing the ith service, n ^d (s _i ) Sink point representing ith service, p ^d (s _i ) Represents the ith industrySink ports of traffic.

Each power communication service needs to plan two channels (channels), one is a working Channel and the other is a protection Channel. C (C) _i ＝{c _i,1 ,c _i,2 ,…,c _i,j … represents traffic s _i Each channel is made up of multiple segments of point-to-point group link connections (Group Link Connection). The addition of superscripts can be used to distinguish working channels from protection channels, i.e

And->

C represents all the channels planned in the network.

c _i,j ＝{c _i,j,1 ,c _i,j,2 ,…,c _i,j,k … represents channel C _i Each group of Link connections is made up of a plurality of Link connections (Link connections) associated with a FlexE group to which the physical links associated with the Link connections belong. G% _i,j ) Representative group link connection c _i,j Associated FlexE group, n ^s (c _i,j ) Representative group link connection c _i,j N of the source node of (2) ^d (c _i,j ) Representative group link connection c _i,j Is a sink node of (a).

c _i,j,k Representative group link connection c _i,j In a record service s _i In group link connection c _i,j And binding physical links and time slots. E% _i,j,k ) Representing link connection c _i,j,k Corresponding physical link, p ^s (c _i,j,k ) Representative group link connection c _i,j,k Source port, p ^d (c _i,j,k ) Representative group link connection c _i,j,k Is a sink port of (1).

c _i,j,k ＝{c _i,j,k,a ,c _i,j,k,b ,…,c _i,j,k,c … represents link connection c _i,j,k A set of all types of slots corresponding on the physical link, |c _i,j,k I represents link connection c _i,j,k Is a number of slots of all types. A superscript 5G, 1G, 100M, or 10M may be added, representing a set of 5G, 1G, 100M, or 10M slots of a link connection.

The scheme aims at comprehensively optimizing the communication power service, so that an objective function consists of 1) channel average time delay, 2) main and standby channel intersection and 3) service balance. The communication power service has higher time delay requirement, the first part of the objective function represents the requirement of low time delay, the time delay generated by each section of physical link is calculated through the length and the speed of light of the physical link, and the time delay of the whole path is obtained by calculating the sum of the time delays. In order to ensure that the probability that the link faults affect two channels of the main channel and the standby channel simultaneously is as small as possible, the situation that the main channel and the standby channel use the same physical link or node is avoided as much as possible, the second part of the objective function represents the requirement that the channels are approximately disjoint, the intersection degree of the main channel and the standby channel is measured by the intersection degree of the main channel and the standby channel, the intersection degree of the main channel and the standby channel is the average value of the intersection degree of the nodes and the intersection degree of the channels, the node intersection degree can be obtained by calculating the proportion of the same nodes except the source node and the standby node used by the main channel, and the channel intersection degree can be obtained by calculating the proportion of the same physical link used by the main channel and the standby channel. On the basis of the first two points, the distribution degree of the service on each physical link is considered, the situations that part of physical link bearing service is too concentrated and part of physical link bearing service is too little are avoided, the third part of the objective function represents the equilibrium degree of the communication power service, and the average square error measurement of the service quantity borne by each physical link after normalization processing is used. Aiming at the requirements of communication power service, the embodiment of the application comprehensively considers the three key indexes, so as to set an objective function matched with the requirements. The main and standby channels refer to a working channel and a protection channel.

Working channel objective function:

min{αT ^w +(1-)CSE ^w }

and->

Maximum and minimum representing the number of physical link working channels in the network, weight ^w (e _a,b,c ) Representing service _num ^w (e _a,b,c ) Normalized value, CSE ^w Representing the service balance of the working channel in the network,/->

Representing weight ^w (e _a,b,c ) Average value of T ^w Channel delay representing the current service working channel, +.>

Representing working channel->

Is represented by the light velocity.

Protection channel objective function:

/>

min{[αT ^p +(1-α)CSE ^p ]×e ^CI }

wherein, service _num ^p (e _abc ) Representing the physical link e in the network _abc The number of protection channels to be carried,

and->

Weight representing the maximum and minimum number of physical link protection channels in a network ^p (e _a,,c ) Representative service _num ^p (e _a,,c ) Normalized value, CSE ^p Representing the protection channel traffic balance in the network, < > and->

Representing weight ^w (e _a,,c ) Average value of T ^p Representing the channel delay of the current traffic protection channel,

representing a protection channel->

Is the light velocity, CI ⁿ Representative service s _i Node intersection degree of main and standby channels, CI ^l Representative service s _i Channel intersection at link level of primary and backup channels, CI representing traffic s _i Main and standby channel intersection degree.

First, for an ant colony optimization algorithm, a related concept is defined:

alpha: the pheromone importance level is used for calculating the probability that the physical link is selected.

beta: heuristic factor importance is used to calculate the probability that a physical link is selected.

ρ: the evaporation coefficient of the pheromone, and the volatilization proportion of the pheromone in each iteration is 1-rho.

maxphererone: the upper bound of the element values of the pheromone matrix is updated with the pheromone matrix.

minpheromine: the lower bound of the element values of the pheromone matrix defaults to 1.

Global output path: the optimal solution in all paths is calculated.

Iterative output path: and (3) calculating optimal solutions of all paths in the iteration.

Ioslossion: all previous iterations output a set of physical links of path solutions.

BIOSlocking: the physical link set of the current global output path solution.

Vinformation: the change information of the best path, i.e. the difference set of ioslotion and bioslotion.

After the related concepts are defined, a two-channel communication power service protection method based on a Max-Min ant system algorithm in an ant colony optimization algorithm can be designed. The protection method comprises the following steps:

the method first initializes the relevant parameters. If the iteration number does not reach the specified iteration number, the iteration is continued for the next round. In each iteration, a suitable path is selected for antNum ants, i.e. a number of starting paths are preset. When selecting a path, if the jth ant does not reach the end point, continuing to select a next-hop node and a physical link to be passed for the ant, namely determining the next-hop node and the physical link to be passed for any initial path:

A list of reachable next-hop node ids is first computed for ants (starting path), and physical links (which may be multiple but must be in the same FlexE group) that meet latency and bandwidth requirements are randomly selected for each optional next-hop node: calculating a FlexE group id list and a physical link id list with sufficient slot bandwidth for the next hop node, (1) if the physical link id list exists, randomly selecting an id in the physical link id list as a path; (2) if the physical link id list does not exist, but the FlexE group id list exists, namely, a plurality of physical links under the same FlexE group are needed to meet the bandwidth delay requirement, one id is randomly selected in the FlexE group id list, and the physical links are sequentially selected in the corresponding FlexE group until the bandwidth (a plurality of physical links can be met); (3) if the physical link id list and the FlexE group id list do not exist, the fact that the physical link meeting the requirements does not exist is indicated, the ids of the corresponding nodes are deleted in the isAllowed, and the next circulation is directly carried out.

Calculate the selected objective function OF _k And according to pheromone and an objective function OF _k Calculation of probability [ k ]]. Calculation of probability [ k ]]The formula of (2) is as follows:

nodeIdA and nodeIdB represent the physical node ids, OF, at both ends OF the selected physical link _k Representing the objective function of the current path. The probability that the physical link is selected is calculated by examining both the pheromone and the objective function.

Then, a node and a corresponding physical link are randomly selected by taking the value in the probability array as the selection probability (if the array subscript is not in isAllowed, the value is 0). The specific method comprises the following steps: 1. calculating the sum of probabilities in the probability array; 2. for all k e isAllowed,

so that the sum of probabilities in the probability array is 1;3. generating a random number between 0 and 1, and sequentially accumulating probability [ k ]]And when the accumulated value is larger than the random number, taking the next hop node corresponding to the current k value and the physical link as a result. If the selection is successful, recording the result in the ant information; if isAllowed is empty, the selection fails and the ant information (including path information) is initialized.

And finally updating the global output path and the iterative output path.

Then, the best path change information, i.e. the physical links of the physical link set ios, which are included in all previous iterative output path solutions and are not included in the physical link set bios of the current global output path solution, is calculated. Vinformation, BIOSloution is first set to the empty set. And adding the physical link contained in the global output path into BIOSlocking. And adding the physical link contained in the iterative output path into the IOSloation. And calculating a difference set of ioslotion and BIOSlotion, namely, the Vinformation.

Updating the pheromone matrix. The updating steps are as follows: 1. the pheromone is volatilized, the pheromone left by ants in nature volatilizes along with the time, ρ is the proportion of the former pheromone left after each iteration, and thus the pheomone [ a ] is calculated for all values of the pheromone matrix][b]* =ρ;2. the new explored path is additionally enhanced by pheromone and the increment is stored in the pheromone matrix, so that the diversity of the solution can be increased, and all physical links e contained in the optimal path change information Vinformation are correspondingly processed _c,d,e ∈E _c,d Calculation of pheomone [ c ]][d]+=1/OF (iteratorOptimalPath); 3. the pheromone updating is carried out on the global output path solution, the probability of exploring the vicinity of the global output path solution is increased, and therefore, all physical links e contained in the global output path are updated _f,g,e ∈E _f,g Calculation of pheomone [ f ]][g]+=1/OF (globalOptimalPath); 4. resetting elements which are smaller than minPheromone and are not 0 in the pheromone matrix to the minPheromone in order to limit the element size of the pheromone matrix; the meta of the pheromone matrix is larger than maxPahermoneA hormone, reset to maxpheresone; 5. the maxpheresone is set as an estimate of the asymptotic maximum of the pheromone matrix element, and thus the maxpheresone is updated,

And judging whether the pheromone matrix falls into stagnation or not by using the solving matrix. The judging method comprises the following steps: 1. recording a solution set matrix A after the last iteration and a solution set matrix B after the current iteration, wherein each element represents that a solution passing through the path exists by 1, and 0 represents that the solution does not exist; 2. adding the two matrixes to obtain a matrix C;3. calculating the ratio of the element with the value of 2 to the element with the value of 1 or 2, namely the similarity of the solution set matrix in two iterations; 4. if the duty ratio is more than or equal to 90%, the pheromone matrix is considered to be trapped in stagnation; if less than 90%, no stagnation is considered.

If the pheromone matrix falls into a dead state, a smoothing mechanism is used for the pheromone matrix: subscript h, l corresponding to element with value 2 in matrix C, let phenomenone [ h ] [ l ] =ρ (maxphererone-phenomenone [ h ] [ l ]). If the modified value is less than minPheromone or greater than maxPaherone, then reset to minPheromone or maxPaherone.

And after the iteration is finished, outputting a global output path. The algorithm is used to calculate the working channel and the protection channel of the service respectively.

It should be noted that, the method of the embodiments of the present application may be performed by a single device, for example, a computer or a server. The method of the embodiment can also be applied to a distributed scene, and is completed by mutually matching a plurality of devices. In the case of such a distributed scenario, one of the devices may perform only one or more steps of the methods of embodiments of the present application, and the devices may interact with each other to complete the methods.

It should be noted that some embodiments of the present application are described above. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments described above and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.

Based on the same inventive concept, the application also provides a power communication service protection device based on the flexible Ethernet technology, which corresponds to the method of any embodiment.

Referring to fig. 2, the power communication service protection device based on the flexible ethernet technology includes:

an information determining module 201 configured to acquire a flexible ethernet device-based power communication network; determining physical nodes and physical links in a network according to the power communication network;

an iteration output path determining module 202 configured to set the iteration number of the ant colony optimization algorithm, and the pheromone matrix; iterating by utilizing an ant colony optimization algorithm and a pheromone matrix, selecting the physical node and the physical link in each iteration, and connecting the selected physical node and the physical link to obtain an iteration output path;

A global output path determination module 203 configured to determine a global output path from the iterative output paths;

the pheromone matrix updating module 204 is configured to update the pheromone matrix according to all iteration output paths and global output paths obtained in each iteration process, and perform the next iteration process by using the updated pheromone matrix;

a channel determining module 205 configured to output a final global output path obtained by the last iteration process in response to reaching the iteration number; and according to the final global output path, a working channel and a protection channel of the power communication service are obtained.

In some embodiments, the output path determination module 202 specifically includes:

the preset unit is configured to preset a plurality of initial paths by utilizing an ant colony optimization algorithm in each iteration;

a next-hop determination unit configured to determine a next-hop node and a physical link of a current position of the start path in response to any one of the start paths;

a first iterative output path determining unit configured to connect the initial path and the plurality of next-hop nodes with physical links to obtain a first iterative output path;

An iterative output path determining unit configured to determine a plurality of first iterative output paths obtained by the plurality of initial paths correspondingly; calculating an objective function of each first iteration output path by using an objective function calculation method; comparing the objective functions of the plurality of first iteration output paths, and taking the first iteration output path with the minimum objective function value as the iteration output path corresponding to the iteration process.

In some embodiments, the next hop determination unit specifically includes:

a list determining subunit configured to obtain, according to the physical nodes and the physical links in the network, an identifier list isAllowed of all next-hop nodes that can be reached by the current location;

a link determining subunit configured to confirm a physical link meeting the delay and bandwidth requirements from the identifier list isAllowed; in response to the fact that any next-hop node does not exist in the physical links, determining to delete the next-hop node without the physical links in the identification number list, and then re-selecting the next-hop node; in response to the existence of the physical link of any next-hop node, determining specific information of the next-hop node and the physical link:

Calculating a probability that the physical link is selected:

wherein, probability [ k ]]For a certain kindProbability OF selecting a physical link, k being any number, the nodeIdA and nodeIdB representing node identification numbers at both ends OF the selected physical link, OF _k Said objective function representing the current path, phenomenone [ nodeIdA ]][nodeIdB]Representing pheromones on the selected physical link, θ+β=1, θ and β being parameters for adjusting weights;

let all k e isAllowed,

In some embodiments, before iterating the output path determining unit, further comprising:

an objective function calculation unit configured to: an objective function of the working channel and an objective function of the protection channel;

min{αT ^ω +(1-α)CSE ^w }

and->

Weight representing the maximum and minimum number of physical link working channels in a network ^w (e _a,b,c ) Representative service _num ^w (e _a,b,c ) Normalized value, CSE ^w Representing the service balance of the working channel in the network,/->

Representing working channel->

Is represented by the light velocity, alpha is the weight parameter, min { alpha T ] ^ω +(1-α)CSE ^w -is the final objective function calculation; />

min{[αT ^p +(1-α)CSE ^p ]×e ^CI }

and->

Representing a protection channel->

representing the number of nodes used by the working channel and the protection channel, < > which are the same>

Representing the number of working channels>

Representing the number of protection channels>

In some embodiments, the global output path determining module 203 specifically includes:

a first determining unit configured to take an iteration output path obtained by the first iteration as a global output path;

And the iteration determining unit is configured to compare the obtained objective function of the iteration output path with the objective function of the global output path when the next iteration is carried out, and update the path with the minimum objective function as the global output path.

In some embodiments, the pheromone matrix updating module 204 specifically includes:

the optimal path change information determining unit is configured to obtain optimal path change information through a difference set of a physical link set of the iterative output path obtained in each iterative process and a physical link set of the global output path of the current iteration;

and a pheromone matrix updating unit configured to update the pheromone matrix according to the optimal path change information.

In some embodiments, the pheromone matrix updating unit specifically includes:

an all-value calculation subunit configured to calculate, for all values of the pheromone matrix, a value of b '=a value of b, [ p ] where the value of a value of b' is an updated value of a corresponding value of a value of b, a and b are arbitrary values, and p is a proportion of the pheromone left after each iteration;

A best path change information pheromone calculating subunit configured to, for all physical links e contained in the best path change information _c,d,e ∈E _c,d Calculation of pheomone [ c ]][d]′＝pheromone[c][d]+1/OF (iteratorOptimalPath), where E _c,d Representing a set of all physical links connected between physical node c and physical node d, e _c,d,e Represents E _c,d E represents the physical link sequence number in the set, OF (iteratorOptimalPath) is the objective function of the iterative output path, pheomone [ c ]][d]Refers to pheromone corresponding to each physical path contained in the optimal path change information in the pheromone matrix, and the pheromone [ c ]][d]' is the corresponding pheomone [ c ]][d]C and d are arbitrary values;

global output path signalingA pheromone calculation subunit configured to, for all physical links e contained in the global output path _f,g,e ∈E _f,g Calculation of pheomone [ f ]][g]′＝pheromone[f][g]+1/OF (globalOptimalPath), where E _f,g Representing a set of all physical links connected between physical node f and physical node g, e _f,g,e Represents E _f,g E represents the physical link sequence number in the set, OF (globalOptimalPath) is the objective function of the global output path, phersone [ f ]][g]Refers to pheromone corresponding to each physical path contained in a global output path in an pheromone matrix ][g]' is the corresponding pheomone [ f ]][g]F and g are arbitrary values;

a boundary value calculation subunit configured to reset an element that is smaller than minPheromone and is not 0 in the pheromone matrix to minPheromone, where minPheromone is a lower boundary of element values of the pheromone matrix; resetting the element larger than the maxPahereome in the pheromone matrix to be maxPahereome, wherein maxPahereome is the upper bound of the element value of the pheromone matrix. The maxpheresone is updated and,

in some embodiments, after the pheromone matrix updating module 204, further includes:

a pheromone matrix judging module configured to judge whether the updated pheromone matrix falls into stagnation, comprising:

when the elements in the solution set matrix A and the solution set matrix B are physical links contained in the first iteration output path, the elements are represented by a character x; when an element in the matrix A and the matrix B is not a physical link contained in the first iterative output path, the element is represented by a character y;

Adding the matrix A and the matrix B to obtain a matrix C formed by a plurality of elements of x, y and z, wherein z is a value obtained by adding two characters x;

In some embodiments, the channel determination module 205, in particular,

the working channel determining unit is configured to obtain the final global output path as a working channel after the first round of iteration is finished;

and the protection channel determining unit is configured to obtain the final global output path as a protection channel after the second round of iteration is finished.

For convenience of description, the above devices are described as being functionally divided into various modules, respectively. Of course, the functions of the various modules may be implemented in the same one or more pieces of software and/or hardware when implementing the present disclosure.

The device of the foregoing embodiment is configured to implement the corresponding flexible ethernet technology-based power communication service protection method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.

Based on the same inventive concept, the present disclosure also provides an electronic device corresponding to the method of any embodiment, including a memory, a processor, and a computer program stored on the memory and capable of running on the processor, where the processor implements the power communication service protection method based on the flexible ethernet technology according to any embodiment when executing the program.

Fig. 3 shows a more specific hardware architecture of an electronic device according to this embodiment, where the device may include: a processor 310, a memory 320, an input/output interface 330, a communication interface 340, and a bus 350. Wherein the processor 310, the memory 320, the input/output interface 330 and the communication interface 340 are communicatively coupled to each other within the device via a bus 350.

The processor 310 may be implemented by a general-purpose CPU (Central Processing Unit ), a microprocessor, an application specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, etc. for executing relevant programs to implement the technical solutions provided in the embodiments of the present disclosure.

The Memory 320 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage device, dynamic storage device, or the like. Memory 320 may store an operating system and other application programs, and when implementing the techniques provided by the embodiments of the present disclosure via software or firmware, the associated program code is stored in memory 320 and invoked for execution by processor 310.

The input/output interface 330 is used for connecting with an input/output module to realize information input and output. The input/output module may be configured as a component in a device (not shown) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.

The communication interface 340 is used to connect to a communication module (not shown in the figure) to enable communication interaction between the present device and other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).

Bus 350 includes a path to transfer information between components of the device (e.g., processor 310, memory 320, input/output interface 330, and communication interface 340).

It should be noted that although the above device only shows the processor 310, the memory 320, the input/output interface 330, the communication interface 340, and the bus 350, in the implementation, the device may further include other components necessary to achieve normal operation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the embodiments of the present description, and not all the components shown in the drawings.

The electronic device of the foregoing embodiment is configured to implement the corresponding flexible ethernet technology-based power communication service protection method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.

Based on the same inventive concept, corresponding to any of the above embodiments of the method, the present disclosure further provides a non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the flexible ethernet technology-based power communication service protection method according to any of the above embodiments.

The computer readable media of the present embodiments, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.

The computer instructions stored in the storage medium of the foregoing embodiments are used to make the computer execute the power communication service protection method based on the flexible ethernet technology according to any one of the foregoing embodiments, and have the beneficial effects of the corresponding method embodiments, which are not described herein.

Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the disclosure, including the claims, is limited to these examples; the technical features of the above embodiments or in the different embodiments may also be combined under the idea of the present disclosure, the steps may be implemented in any order, and there are many other variations of the different aspects of the embodiments of the present disclosure as described above, which are not provided in details for the sake of brevity.

Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the embodiments of the present disclosure. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the embodiments of the present disclosure, and this also accounts for the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform on which the embodiments of the present disclosure are to be implemented (i.e., such specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.

While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.

The disclosed embodiments are intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Accordingly, any omissions, modifications, equivalents, improvements, and the like, which are within the spirit and principles of the embodiments of the disclosure, are intended to be included within the scope of the disclosure.

Claims

1. The utility model provides a power communication service protection method based on flexible Ethernet technology, which is characterized by comprising the following steps:

acquiring a power communication network based on flexible Ethernet equipment;

Determining a global output path according to the iterative output path;

and according to the final global output path, a working channel and a protection channel of the power communication service are obtained.

2. The method of claim 1, wherein the iterating with the ant colony optimization algorithm and the pheromone matrix, selecting the physical node and the physical link in each iteration, and connecting the selected physical node and the physical link to obtain an iterated output path, comprises:

in each iteration, presetting a plurality of initial paths by using an ant colony optimization algorithm;

in response to determining a next hop node and physical link for any of the starting paths at the current location of the starting path;

connecting the initial path with a plurality of next-hop nodes and physical links to obtain a first iteration output path;

Determining a plurality of first iteration output paths obtained by the corresponding plurality of initial paths;

calculating an objective function of each first iteration output path by using an objective function calculation method;

comparing the objective functions of the plurality of first iteration output paths, and taking the first iteration output path with the minimum objective function value as the iteration output path corresponding to the iteration process.

3. The method of claim 2, wherein before calculating the objective function for each first iteration path using the objective function calculation method, further comprises:

a calculation method for determining the objective function;

the objective function includes: an objective function of the working channel and an objective function of the protection channel;

min{αT ^ω +(1-α)CSE ^w }

and->

Representing working channel->

Is represented by the light velocity, alpha is the weight parameter, min { alpha T ] ^ω +(1-α)CSE ^w -is the final objective function calculation;

min{[αT ^p +(1-α)CSE ^p ]×e ^CI }

and->

Maximum and minimum representing the number of physical link protection channels in a networkValue, weight ^p (e _a,b,c ) Representative service _num ^p (e _a,b,c ) Normalized value, CSE ^p Representing the protection channel traffic balance in the network, < > and->

Representing weigh ^w (e _a,b,c ) Is the average value of (E) is the number of physical links, T ^p Channel delay representing the current traffic protection channel, +.>

Representing a protection channel->

Representing the number of working channels>

Representing the number of protection channels>

4. A method according to claim 3, wherein responsive to determining the next-hop node and physical link for the current location of the starting path for any of the starting paths, comprising:

obtaining an identification number list isAllowed of all next hop nodes which can be reached at the current position according to physical nodes and physical links in the network;

from the identification number list isAllowed, confirming a physical link meeting the requirements of time delay and bandwidth;

in response to the fact that any next-hop node does not exist in the physical links, determining to delete the next-hop node without the physical links in the identification number list, and then re-selecting the next-hop node;

in response to the existence of the physical link of any next-hop node, determining specific information of the next-hop node and the physical link:

calculating a probability that the physical link is selected:

wherein, probability [ k ] ]For the probability that a physical link is selected, k is any number, where nodeIdA and nodeIdB represent the node identification numbers at both ends OF the selected physical link, OF _k Said objective function representing the current path, phenomenone [ nodeIdA ]][nodeIdB]Representing pheromones on the selected physical link, θ+β=1, θ and β being parameters for adjusting weights;

make the instituteWith k e isAllowed,

so that all probability ₁ [k]The sum of the probabilities of the arrays is 1;

5. The method of claim 2, wherein said determining a global output path from said iterative output path comprises:

taking an iteration output path obtained by the first iteration as a global output path;

and when the next iteration is carried out, comparing the obtained objective function of the iterative output path with the objective function of the global output path, and updating the path with the minimum objective function into the global output path.

6. The method according to claim 2, wherein updating the pheromone matrix according to all iterative output paths and global output paths obtained in each iterative process, and performing the next iterative process by using the updated pheromone matrix, further comprising:

obtaining optimal path change information through a difference set of a physical link set of the iterative output path obtained in each iterative process and a physical link set of the global output path of the current iteration;

updating the pheromone matrix according to the optimal path change information.

7. The method of claim 6, wherein updating the pheromone matrix according to the best path change information comprises:

calculating a PHEROMone [ a ] [ b ] '= PHEROMone [ a ] [ b ] [ rho ] for all values of the pheromone matrix, wherein the PHEROMone [ a ] [ b ] refers to each pheromone in the pheromone matrix, the PHEROMone [ a ] [ b ]' is an updated value of the corresponding PHEROMone [ a ] [ b ], a and b are arbitrary values, and rho is the proportion of the pheromone left after each iteration;

For all physical links e contained in the best path change information _c,d,e ∈E _c,d Calculation of pheomone [ c ]][d]′＝pheromone[c][d]+1/OF (iteratorOptimalPath), where E _c,d Representing a set of all physical links connected between physical node c and physical node d, e _c,d,e Represents E _c,d E represents the physical link sequence number in the set, OF (iteratorOptimalPath) is the objective function of the iterative output path, pheomone [ c ]][d]Refers to pheromone corresponding to each physical path contained in the optimal path change information in the pheromone matrix, and the pheromone [ c ]][d]' is the corresponding pheomone [ c ]][d]C and d are arbitrary values;

for all physical links e contained in the global output path _f,g,e ∈E _f,g Calculation of pheomone [ f ]][g]′＝pheromone[f][g]+1/OF (globalOptimalPath), where E _f,g Representing a set of all physical links connected between physical node f and physical node g, e _f,g,e Represents E _f,g E represents the physical link sequence number in the set, OF (globalOptimalPath) is the objective function of the global output path, phersone [ f ]][g]Refers to pheromone corresponding to each physical path contained in a global output path in an pheromone matrix][g]' is the corresponding pheomone [ f ]][g]F and g are arbitrary values;

Resetting elements which are smaller than minPheromone and are not 0 in the pheromone matrix to minPheromone, wherein minPheromone is the lower bound of element values of the pheromone matrix;

resetting elements larger than maxPahereome in the pheromone matrix to maxPahereome, wherein maxPahereome is the upper bound of element values of the pheromone matrix;

the maxpheresone is updated and,

and obtaining the updated pheromone matrix.

8. The method of claim 6, wherein after updating the pheromone matrix according to the optimal path change information, further comprising:

changing a pheromone [ h ] [ l ] at a position corresponding to the element position in the pheromone matrix according to the element position with the value z in the matrix C, changing the pheromone at the corresponding position into a pheromone [ h ] [ l ] = rho (maxPahereome-pheomone [ h ] [ l ]), resetting the value of each obtained pheromone [ h ] [ l ] smaller than that of minPheomone to be minPheomone, resetting the value larger than maxPahereome to maxPahereome, and entering the next iteration, wherein h and l are element subscripts of the corresponding positions in the matrix C and the pheromone matrix, and h and l are arbitrary values;

9. The method according to claim 1, wherein the obtaining a working channel and a protection channel of the power communication service according to the final global output path includes:

After the first round of iteration is finished, the obtained final global output path is a working channel;

and after the second round of iteration is finished, the obtained final global output path is a protection channel.

10. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the method of any one of claims 1 to 9 when the program is executed.