Ant colony algorithm initialization method and system based on ISIS protocol

Abstract

The invention provides an ant colony algorithm initialization method and system based on an ISIS protocol, and the method comprises the steps: collecting network topology information in real time based on the ISIS protocol, including a node set, a link set and cost parameters of each link, the cost parameters including transmission time delay, bandwidth utilization rate and packet loss rate; constructing a comprehensive cost evaluation model based on weighted summation of the cost parameters of the links; a pheromone matrix of the ant colony algorithm is initialized based on the result of the comprehensive cost evaluation model, and the link comprehensive cost is inversely proportional to the initial pheromone value; constructing a heuristic information model according to the network topology information, wherein the heuristic information model is the reciprocal of the comprehensive cost; and based on the pheromone matrix and the heuristic information model, initializing a node selection probability function of an ant colony algorithm, and executing the ant colony algorithm to iteratively solve an optimal routing path. According to the method, the real-time network information obtained by the ISIS protocol is used for the initialization of the ant colony algorithm, so that the initialization precision can be improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of computer network routing optimization, in particular to an ant colony algorithm initialization method based on ISIS protocol, an ant colony algorithm initialization system based on ISIS protocol, an electronic device and a computer readable medium. BACKGROUND

[0002] With the expansion of computer network scale and the improvement of business complexity, the ant colony algorithm is widely used in routing optimization. However, the initialization process of the existing ant colony algorithm usually depends on the manually preset network topology parameters, and the setting of the initial pheromone lacks the association with the actual network state, which may prolong the algorithm convergence time and affect the real-time performance of the routing decision. SUMMARY

[0003] In view of the above problems, the present application is proposed in order to provide an ant colony algorithm initialization method based on ISIS protocol and a corresponding ant colony algorithm initialization method system based on ISIS protocol, an electronic device and a computer readable medium which overcome the above problems or at least partially solve the above problems.

[0004] The present application discloses an ant colony algorithm initialization method based on ISIS protocol, which comprises: collecting network topology information in real time based on ISIS protocol; the network topology information comprises a node set, a link set and cost parameters of each link, and the cost parameters comprise transmission delay, bandwidth utilization and packet loss rate; constructing a comprehensive cost evaluation model based on the cost parameters of the links, wherein the comprehensive cost evaluation model is the weighted sum of the transmission delay, bandwidth utilization and packet loss rate; initializing the pheromone matrix of the ant colony algorithm based on the results of the comprehensive cost evaluation model, wherein the link comprehensive cost is inversely proportional to the initial pheromone value; constructing a heuristic information model based on the network topology information, wherein the heuristic information model is the reciprocal of the comprehensive cost; initializing the node selection probability function of the ant colony algorithm based on the initialized pheromone matrix and the heuristic information model, and performing the iteration of the initialized ant colony algorithm to solve the optimal routing path.

[0005] Optionally, collecting network topology information in real time based on ISIS protocol comprises: exchanging link information through link state advertisement (LSA) to construct and maintain a dynamically updated link state database; the link state database comprises node attributes, link attributes and link on-off state; the node attributes comprise node processing capacity and cache capacity, and the link attributes comprise transmission rate, link length and bit error rate.

[0006] Optionally, the initial pheromone value is calculated in the following manner: τ0(i,j) = k / C (i,j) wherein τ0(i,j) is the initial pheromone value from node i to node j, k is a preset reference pheromone constant, and C (i,j) is the comprehensive cost from node i to node j based on the comprehensive cost evaluation model.

[0007] Optionally, the method further comprises: setting initial values of the number of ants, the initial value of pheromone evaporation rate, the initial value of pheromone importance factor α, and the initial value of heuristic information importance factor β.

[0008] Optionally, the initialized ant colony algorithm is iterated to solve the optimal routing path, comprising: the ants start from the source node and select the next hop based on the initialized node selection probability function; after reaching the destination node, the path comprehensive cost is calculated; after each iteration, the pheromone is updated according to the path comprehensive cost of each ant, and the lower the path comprehensive cost, the greater the pheromone increment; the pheromone is evaporated at the preset initial value of pheromone evaporation rate; the historical optimal path is reserved as a candidate route.

[0009] The application further discloses an ant colony algorithm initialization system based on the ISIS protocol, which comprises: an ISIS protocol module, configured to collect network topology information in real time based on the ISIS protocol; the network topology information comprises a node set, a link set, and cost parameters of each link, and the cost parameters comprise transmission delay, bandwidth utilization, and packet loss rate; a comprehensive cost evaluation module, configured to construct a comprehensive cost evaluation model based on the cost parameters of the links, wherein the comprehensive cost evaluation model is a weighted sum of the transmission delay, the bandwidth utilization, and the packet loss rate; a pheromone matrix initialization module, configured to initialize the pheromone matrix of the ant colony algorithm based on the result of the comprehensive cost evaluation model, wherein the link comprehensive cost is inversely proportional to the initial pheromone value; a heuristic information generation module, configured to construct a heuristic information model based on the network topology information, wherein the heuristic information model is the reciprocal of the comprehensive cost; a path optimization module, configured to initialize the node selection probability function of the ant colony algorithm based on the initialized pheromone matrix and the heuristic information model, and to execute the initialized ant colony algorithm to iteratively solve the optimal routing path.

[0010] Optionally, the ISIS protocol module is configured to: exchange link information through link state advertisement (LSA) to build and maintain a dynamically updated link state database, wherein the link state database comprises node attributes, link attributes and link state, the node attributes comprise node processing capacity and buffer capacity, and the link attributes comprise transmission rate, link length and bit error rate.

[0011] Optionally, the initial pheromone value is calculated in the following manner: τ0(i,j) = k / C (i,j) wherein τ0(i,j) is the initial pheromone value from node i to node j, k is a preset reference pheromone constant, and C (i,j) is the comprehensive cost from node i to node j based on a comprehensive cost evaluation model.

[0012] Optionally, the system further comprises: a parameter configuration module configured to set initial values of the number of ants, the initial value of pheromone evaporation rate, the initial value of the importance factor of pheromone α, and the initial value of the importance factor of heuristic information β.

[0013] Optionally, the path optimization module is configured to: select the next hop based on the initialized node selection probability function; calculate the path comprehensive cost after reaching the destination node; update the pheromone according to the path comprehensive cost of each ant after each iteration, wherein the lower the path comprehensive cost, the greater the pheromone increment; evaporate the pheromone according to the preset initial value of pheromone evaporation rate; retain the historical optimal path as a candidate route.

[0014] The application further discloses an electronic device comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory complete communication with each other through the communication bus. The memory is used to store a computer program. The processor is used to execute the program stored on the memory to implement the ant colony algorithm initialization method based on the ISIS protocol.

[0015] The application further discloses a computer readable medium having instructions stored thereon, which, when executed by one or more processors, cause the processors to execute the ant colony algorithm initialization method based on the ISIS protocol.

[0016] The application has the following advantages: The ant colony algorithm initialization method based on the ISIS protocol provided by the embodiment of the application utilizes the topology discovery capability of the ISIS protocol, constructs a comprehensive cost evaluation model in combination with multi-dimensional link cost parameters, makes the initialization parameters of the ant colony algorithm highly match the actual network state, reduces manual intervention, improves initialization precision, associates pheromone initialization with comprehensive cost, makes initial pheromone distribution more reasonable, speeds up algorithm convergence speed, and improves routing optimization efficiency; the heuristic information is constructed based on actual network cost, improves the accuracy of node selection, and lays a good foundation for subsequent algorithm iteration. BRIEF DESCRIPTION OF DRAWINGS

[0017] Figure 1 is a step flowchart of an ant colony algorithm initialization method based on an ISIS protocol provided by an embodiment of the application; Figure 2 is a structural block diagram of an ant colony algorithm initialization system based on an ISIS protocol provided by an embodiment of the application; Figure 3 is a block diagram of an electronic device provided by an embodiment of the application; Figure 4 is a schematic diagram of a computer readable medium provided by an embodiment of the application. DETAILED DESCRIPTION

[0018] The intermediate system to intermediate system (ISIS) protocol is a mature link state routing protocol, which can dynamically discover network topology and maintain a link state database, and provide accurate neighbor relationship and link cost information for network nodes. Real-time network information obtained by the ISIS protocol is used for initialization of the ant colony algorithm, which can improve initialization precision. The core of the application is to utilize real-time data of the ISIS protocol to construct initialization parameters with strong association with network state, to provide accurate initial conditions for the ant colony algorithm, and the application is particularly suitable for communication network scenarios with high requirements for routing convergence speed.

[0019] In order to make the above-mentioned purposes, features and advantages of the application more obvious and easy to understand, the application will be further described in detail below with reference to the drawings and specific embodiments.

[0020] Referring to Figure 1 , a step flowchart of an ant colony algorithm initialization method based on an ISIS protocol provided by an embodiment of the application is shown, which can specifically include the following steps: Step 101, real-time network topology information is collected based on the ISIS protocol; the network topology information includes a node set, a link set and cost parameters of each link, and the cost parameters include transmission delay, bandwidth utilization and packet loss rate; In an optional embodiment of the application, real-time network topology information is collected based on the ISIS protocol, including: Link information is exchanged through Link State Advertisement (LSA) to build and maintain a dynamically updated link state database; the link state database includes node attributes, link attributes and link on-off state; the node attributes include node processing capacity and cache capacity, and the link attributes include transmission rate, link length and error rate.

[0021] After the ISIS protocol module is started, an adjacent relationship is established through a Hello message, and link information is exchanged through a Link State Advertisement (LSA) to build a link state database containing the following contents: A node set: {R1, R2, R3, R4, R5} (router nodes), recording the processing capacity (such as R1=500 Mbps) and cache capacity (such as R1=100 MB) of each node; A link set: {(R1,R2), (R1,R3), (R2,R3), (R2,R4), (R3,R4), (R3,R5), (R4,R5)}; A link cost parameter: transmission delay (such as (R1,R2)=2 ms), bandwidth utilization (such as (R1,R2)=30%) and packet loss rate (such as (R1,R2)=0.5%) of each link.

[0022] Step 102, a comprehensive cost evaluation model is built based on the cost parameters of the link, and the comprehensive cost evaluation model is a weighted sum of transmission delay, bandwidth utilization and packet loss rate; The comprehensive cost calculation formula is: C (i,j) = w1×d (i,j) + w2×u (i,j) + w3×l (i,j) Wherein, w1=0.4, w2=0.3, w3=0.3 (the weight can be adjusted according to the business demand).

[0023] Taking the link (R2,R3) as an example: d=1 ms, u=20%, l=0.3%, then C (R2,R3)=0.4×1+0.3×20%+0.3×0.3%=0.4609.

[0024] Step 103, the pheromone matrix of the ant colony algorithm is initialized based on the result of the comprehensive cost evaluation model, wherein the link comprehensive cost is inversely proportional to the initial pheromone value; In an optional embodiment of the application, the calculation method of the initial pheromone value is: τ0(i,j) = k / C (i,j) In the formula, τ0(i,j) is an initial pheromone value of the node i to the node j, k is a preset reference pheromone constant, and C(i,j) is the comprehensive cost of the node i to the node j based on a comprehensive cost evaluation model.

[0025] The initial pheromone is calculated according to the formula τ0(i,j)=k / C(i,j), and k=1.0: τ0(R2,R3)=1.0 / 0.4609≈2.17, τ0(R1,R3)=1.0 / (0.4*5+0.3*40%+0.3*0.8%)≈1.0 / 2.1202≈0.471.

[0026] In step 104, a heuristic information model is constructed according to the network topology information, and the heuristic information model is the reciprocal of the comprehensive cost. The heuristic information η(i,j)=1 / C(i,j), and η(R2,R3)=1 / 0.4609≈2.17, which is consistent with the pheromone distribution trend.

[0027] In step 105, a node selection probability function of the ant colony algorithm is initialized based on the initialized pheromone matrix and the heuristic information model, and the initialized ant colony algorithm is iterated to solve the optimal routing path.

[0028] In an optional embodiment of the present application, the method further comprises: The initial value of the number of ants, the initial value of the pheromone evaporation rate, the initial value of the pheromone importance factor α, and the initial value of the heuristic information importance factor β are set.

[0029] In an optional embodiment of the present application, the initialized ant colony algorithm is iterated to solve the optimal routing path, comprising: The ant starts from the source node, selects the next hop based on the initialized node selection probability function; After reaching the destination node, the path comprehensive cost is calculated; After each iteration, the pheromone is updated according to the path comprehensive cost of each ant, and the lower the path comprehensive cost, the greater the pheromone increment; The pheromone is evaporated at the preset initial value of the pheromone evaporation rate; The historical optimal path is reserved as a candidate route.

[0030] The probability formula is: p(i,j)=[τ(i,j)^α×η(i,j)^β] / Σ[τ(i,k)^α×η(i,k)^β] (k∈allowed) Where α is the initial value of the pheromone importance factor, β is the initial value of the heuristic information importance factor, and allowed is the set of unvisited nodes. For example, when the unvisited nodes of R2 are {R1,R3,R4}, the probabilities are calculated and the next hop is selected.

[0031] Set initial values ​​for ant colony size, pheromone evaporation rate, pheromone importance factor α, and heuristic pheromone importance factor β, and then use the ant colony algorithm to iteratively solve for the optimal routing path.

[0032] For example, the number of ants = 10, the evaporation rate = 0.1, α = 1, β = 2; The path optimization module has started its iteration: Ants start from the source node (e.g., R1) and choose the next hop (e.g., R2 or R3) based on a probability function. After reaching the destination node (e.g., R5), calculate the total cost of the path (e.g., the total cost of R1→R2→R3→R5). Update pheromones based on path cost: the lower the cost, the larger Δτ(i,j); Perform the evaporation operation: τ(i,j)=(1-0.1)×τ(i,j)+Δτ(i,j).

[0033] The beneficial effects of this invention are as follows: 1. By leveraging the topology discovery capabilities of the ISIS protocol and combining it with multi-dimensional link cost parameters to construct a comprehensive cost evaluation model, the initialization parameters of the ant colony algorithm are highly matched with the actual network state, reducing manual intervention and improving initialization accuracy; 2. The correlation between pheromone initialization and overall cost makes the initial pheromone distribution more reasonable, accelerates the algorithm convergence speed, and improves the efficiency of route optimization; 3. Heuristic information is constructed based on actual network costs, which improves the accuracy of node selection and lays a good foundation for subsequent algorithm iterations.

[0034] It should be noted that, for the sake of simplicity, the method embodiments are all described as a series of actions. However, those skilled in the art should understand that the embodiments of the present invention are not limited to the described order of actions, because according to the embodiments of the present invention, some steps can be performed in other orders or simultaneously. Furthermore, those skilled in the art should also understand that the embodiments described in the specification are preferred embodiments, and the actions involved are not necessarily essential to the embodiments of the present invention.

[0035] Reference Figure 2 The diagram illustrates a structural block diagram of an ant colony algorithm initialization system based on the ISIS protocol provided in an embodiment of the present invention, which may specifically include the following modules: ISIS protocol module 201 is used to collect network topology information in real time based on the ISIS protocol; the network topology information includes a set of nodes, a set of links, and cost parameters of each link, the cost parameters including transmission delay, bandwidth utilization, and packet loss rate; The comprehensive cost assessment module 202 is used to construct a comprehensive cost assessment model based on the cost parameters of the link. The comprehensive cost assessment model is a weighted sum of transmission delay, bandwidth utilization and packet loss rate. The pheromone matrix initialization module 203 is used to initialize the pheromone matrix of the ant colony algorithm based on the results of the comprehensive cost evaluation model, wherein the comprehensive link cost is inversely proportional to the initial pheromone value; The heuristic information generation module 204 is used to construct a heuristic information model based on the network topology information, wherein the heuristic information model is the reciprocal of the overall cost; The path optimization module 205 is used to initialize the node selection probability function of the ant colony algorithm based on the pheromone matrix and heuristic information model obtained during initialization, and to execute the initialized ant colony algorithm iteratively to solve for the optimal routing path.

[0036] Optionally, the ISIS protocol module is used for: Link information is exchanged through Link State Advertisement (LSA), and a dynamically updated link state database is constructed and maintained. The link state database includes node attributes, link attributes, and link connectivity status. The node attributes include node processing capacity and buffer capacity, and the link attributes include transmission rate, link length, and bit error rate.

[0037] Optionally, the initial pheromone value is calculated as follows: τ0(i,j) = k / C (i,j) In the formula, τ0(i,j) is the initial pheromone value from node i to node j, k is the preset baseline pheromone constant, and C(i,j) is the comprehensive cost from node i to node j obtained based on the comprehensive cost evaluation model.

[0038] Optionally, the system further includes: The parameter configuration module is used to set the initial values ​​for ant colony size, pheromone evaporation rate, pheromone importance factor α, and heuristic pheromone importance factor β.

[0039] Optionally, the path optimization module is used for: The ant starts from the source node and selects the next hop based on the node selection probability function obtained during initialization. After reaching the destination node, calculate the total cost of the path. After each iteration, the pheromone is updated based on the overall path cost of each ant. The lower the overall path cost, the greater the pheromone increment. The pheromone is evaporated according to the preset initial value of the pheromone evaporation rate; The best historical path is retained and used as a candidate route.

[0040] As the system implementation is basically similar to the method implementation, it is described in a relatively simple way. For relevant details, please refer to the description of the method implementation.

[0041] In addition, embodiments of the present invention also provide an electronic device, such as... Figure 3 As shown, it includes a processor 301, a communication interface 302, a memory 303, and a communication bus 304, wherein the processor 301, the communication interface 302, and the memory 303 communicate with each other through the communication bus 304. Memory 303 is used to store computer programs; When processor 301 executes a program stored in memory 303, it performs the following steps: Real-time acquisition of network topology information based on the ISIS protocol; the network topology information includes a set of nodes, a set of links, and cost parameters for each link, including transmission latency, bandwidth utilization, and packet loss rate; A comprehensive cost evaluation model is constructed based on the cost parameters of the link. The comprehensive cost evaluation model is a weighted sum of transmission delay, bandwidth utilization and packet loss rate. The pheromone matrix of the ant colony algorithm is initialized based on the results of the comprehensive cost evaluation model, wherein the comprehensive link cost is inversely proportional to the initial pheromone value; A heuristic information model is constructed based on the network topology information, and the heuristic information model is the reciprocal of the overall cost; Based on the pheromone matrix and heuristic information model obtained from the initialization, the node selection probability function of the ant colony algorithm is initialized, and the initialized ant colony algorithm is executed iteratively to solve for the optimal routing path.

[0042] Optionally, network topology information is collected in real time based on the ISIS protocol, including: Link information is exchanged through Link State Advertisement (LSA), and a dynamically updated link state database is constructed and maintained. The link state database includes node attributes, link attributes, and link connectivity status. The node attributes include node processing capacity and buffer capacity, and the link attributes include transmission rate, link length, and bit error rate.

[0043] Optionally, the initial pheromone value is calculated as follows: τ0(i,j) = k / C (i,j) In the formula, τ0(i,j) is the initial pheromone value from node i to node j, k is the preset baseline pheromone constant, and C(i,j) is the comprehensive cost from node i to node j obtained based on the comprehensive cost evaluation model.

[0044] Optionally, the method further includes: Set initial values ​​for ant colony size, pheromone evaporation rate, pheromone importance factor α, and heuristic pheromone importance factor β.

[0045] Optionally, the initialized ant colony algorithm is executed iteratively to solve for the optimal route path, including: The ant starts from the source node and selects the next hop based on the node selection probability function obtained during initialization. After reaching the destination node, calculate the total cost of the path. After each iteration, the pheromone is updated based on the overall path cost of each ant. The lower the overall path cost, the greater the pheromone increment. The pheromone is evaporated according to the preset initial value of the pheromone evaporation rate; The best historical path is retained and used as a candidate route.

[0046] The communication bus mentioned above can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. This communication bus can be divided into address bus, data bus, control bus, etc. For ease of illustration, only one thick line is used to represent it in the diagram, but this does not mean that there is only one bus or one type of bus.

[0047] The communication interface is used for communication between the aforementioned terminal and other devices.

[0048] The memory may include random access memory (RAM) or non-volatile memory, such as at least one disk storage device. Optionally, the memory may also be at least one storage device located remotely from the aforementioned processor.

[0049] The processors mentioned above can be general-purpose processors, including central processing units (CPUs), network processors (NPs), etc.; they can also be digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0050] like Figure 4 As shown, in another embodiment of the present invention, a computer-readable storage medium 401 is also provided, which stores instructions that, when run on a computer, cause the computer to execute the ant colony algorithm initialization method based on the ISIS protocol described in the above embodiment.

[0051] In another embodiment of the present invention, a computer program product containing instructions is also provided, which, when run on a computer, causes the computer to execute the ant colony algorithm initialization method based on the ISIS protocol described in the above embodiments.

[0052] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially as a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of the present invention are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid-state disk (SSD)).

[0053] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Unless otherwise specified, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0054] The various embodiments in this specification are described in a related manner. Similar or identical parts between embodiments can be referred to mutually. Each embodiment focuses on describing the differences from other embodiments. In particular, the system embodiments are basically similar to the method embodiments, so the description is relatively simple; relevant parts can be referred to the descriptions of the method embodiments.

[0055] The above description is merely a preferred embodiment of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention are included within the scope of protection of the present invention.

Claims

1. A method for initializing an ant colony algorithm based on the ISIS protocol, characterized in that, The method includes: Real-time acquisition of network topology information based on the ISIS protocol; the network topology information includes a set of nodes, a set of links, and cost parameters for each link, including transmission latency, bandwidth utilization, and packet loss rate; A comprehensive cost evaluation model is constructed based on the cost parameters of the link. The comprehensive cost evaluation model is a weighted sum of transmission delay, bandwidth utilization and packet loss rate. The pheromone matrix of the ant colony algorithm is initialized based on the results of the comprehensive cost evaluation model, wherein the comprehensive link cost is inversely proportional to the initial pheromone value; A heuristic information model is constructed based on the network topology information, and the heuristic information model is the reciprocal of the overall cost; Based on the pheromone matrix and heuristic information model obtained from the initialization, the node selection probability function of the ant colony algorithm is initialized, and the initialized ant colony algorithm is executed iteratively to solve for the optimal routing path.

2. The method according to claim 1, characterized in that, Real-time acquisition of network topology information based on the ISIS protocol, including: Link information is exchanged through Link State Advertisement (LSA), and a dynamically updated link state database is constructed and maintained. The link state database includes node attributes, link attributes, and link connectivity status. The node attributes include node processing capacity and buffer capacity, and the link attributes include transmission rate, link length, and bit error rate.

3. The method according to claim 1, characterized in that, The initial pheromone value is calculated as follows: τ0(i,j) = k / C (i,j) In the formula, τ0(i,j) is the initial pheromone value from node i to node j, k is the preset baseline pheromone constant, and C(i,j) is the comprehensive cost from node i to node j obtained based on the comprehensive cost evaluation model.

4. The method according to claim 1, characterized in that, The method further includes: Set initial values ​​for ant colony size, pheromone evaporation rate, pheromone importance factor α, and heuristic pheromone importance factor β.

5. The method according to claim 4, characterized in that, The initialized ant colony algorithm iteratively solves for the optimal route path, including: The ant starts from the source node and selects the next hop based on the node selection probability function obtained during initialization. After reaching the destination node, calculate the total cost of the path. After each iteration, the pheromone is updated based on the overall path cost of each ant. The lower the overall path cost, the greater the pheromone increment. The pheromone is evaporated according to the preset initial value of the pheromone evaporation rate; The best historical path is retained and used as a candidate route.

6. An ant colony algorithm initialization system based on the ISIS protocol, characterized in that, The system includes: The ISIS protocol module is used to collect network topology information in real time based on the ISIS protocol. The network topology information includes a set of nodes, a set of links, and cost parameters for each link. The cost parameters include transmission latency, bandwidth utilization, and packet loss rate. The comprehensive cost assessment module is used to construct a comprehensive cost assessment model based on the cost parameters of the link. The comprehensive cost assessment model is a weighted sum of transmission delay, bandwidth utilization, and packet loss rate. The pheromone matrix initialization module is used to initialize the pheromone matrix of the ant colony algorithm based on the results of the comprehensive cost evaluation model, wherein the comprehensive link cost is inversely proportional to the initial pheromone value. A heuristic information generation module is used to construct a heuristic information model based on the network topology information, wherein the heuristic information model is the reciprocal of the overall cost; The path optimization module is used to initialize the node selection probability function of the ant colony algorithm based on the pheromone matrix and heuristic information model obtained during initialization, and to execute the initialized ant colony algorithm iteratively to solve for the optimal routing path.

7. The system according to claim 6, characterized in that, The ISIS protocol module is used for: Link information is exchanged through Link State Advertisement (LSA), and a dynamically updated link state database is constructed and maintained. The link state database includes node attributes, link attributes, and link connectivity status. The node attributes include node processing capacity and buffer capacity, and the link attributes include transmission rate, link length, and bit error rate.

8. The system according to claim 6, characterized in that, The initial pheromone value is calculated as follows: τ0(i,j) = k / C (i,j) In the formula, τ0(i,j) is the initial pheromone value from node i to node j, k is the preset baseline pheromone constant, and C(i,j) is the comprehensive cost from node i to node j obtained based on the comprehensive cost evaluation model.

9. An electronic device, characterized in that, It includes a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other through the communication bus; The memory is used to store computer programs; When the processor executes the program stored in the memory, it implements the ant colony algorithm initialization method based on the ISIS protocol as described in any one of claims 1-5.

10. A computer-readable medium, characterized in that, It stores instructions that, when executed by one or more processors, cause the processors to perform the ant colony algorithm initialization method based on the ISIS protocol as described in any one of claims 1-5.

Images