Research on Optimization Algorithm for Knapsack Problem of Complex Network Based on Complex Network Evolution
Dawei Zhang, Haiyan Li
Abstract
Open-access reader
Dawei Zhang, Haiyan Li
Abstract
Open-access reader
In order to verify the correctness and validity of the complex networks function evaluation algorithm based on node efficiency, we did a simulation experiment, simply use the topology robustness to assess the robustness of the real network is not enough, but also need to consider node load.By increasing the resources of the information processing nodes to improve the reliability of the actual network system; to measure the actual network system functionality robustness, should use conditions of maintaining the normal function of system to restrain.Under conditions of maintaining normal function, scale-free network in response to a deliberate attack is very fragile, but has a strong fault tolerance to random attack; when a node hit is smaller, different ways of attack has little effect on random networks, and there is same classic conclusion with complex network robustness study.The simulation results show that: the assessment of this algorithm which considers the complex network functionality robust of node load is feasible and effective, and for large complex networks, can get a good computing power.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In order to verify the correctness and validity of the complex networks function evaluation algorithm based on node efficiency, we did a simulation experiment, simply use the topology robustness to assess the robustness of the real network is not enough, but also need to consider node load.By increasing the resources of the information processing nodes to improve the reliability of the actual network system; to measure the actual network system functionality robustness, should use conditions of maintaining the normal function of system to restrain.Under conditions of maintaining normal function, scale-free network in response to a deliberate attack is very fragile, but has a strong fault tolerance to random attack; when a node hit is smaller, different ways of attack has little effect on random networks, and there is same classic conclusion with complex network robustness study.The simulation results show that: the assessment of this algorithm which considers the complex network functionality robust of node load is feasible and effective, and for large complex networks, can get a good computing power.
Key concepts: Robustness (evolution), Correctness, Computer science, Complex network, Network topology, Fault tolerance, Distributed computing, Knapsack problem