An optimization method of network coding environment security resources based on simulated annealing algorithm
A simulated annealing algorithm and network coding technology, applied in the field of security resource optimization, can solve problems such as security concerns, poor efficiency, and inability to effectively utilize local information, and achieve the effect of reducing time and space complexity and reducing the amount of code.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0037] The present invention tests 4 groups of fixed formats and 10 groups of random topological graphs, and the parameters are given in Table 1.
[0038] Table 1 Test Topology Parameters
[0039]
[0040] Proceed as follows:
[0041] Step 1, initialize data.
[0042] The data includes topology map, initial temperature of the item, termination temperature, and temperature change rate, as follows:
[0043] T=3000; T_end=1; delta=0.99.
[0044] Where T is the initial temperature, T_end is the end temperature, and delta is the temperature change rate.
[0045] Step 2, decompose the potential coding nodes on the network topology by graph decomposition method, and use the new topology as input to find the path through simulated annealing algorithm;
[0046] Step 3. For each node, if it has only one outgoing edge, it will be included in the path; if there are two outgoing edges, it will enter the first outgoing edge with a certain probability, as follows:
[0047]
[0048...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


