Research on Optimization Algorithm for Knapsack Problem of Complex Network Based on Complex Network Evolution
- DOI
- 10.2991/iiicec-15.2015.145How to use a DOI?
- Keywords
- loading differences; Complex Network; Complex Network Evolution
- Abstract
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.
- Copyright
- © 2015, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
Cite this article
TY - CONF AU - Da-wei Zhang AU - Hai-yan Li PY - 2015/03 DA - 2015/03 TI - Research on Optimization Algorithm for Knapsack Problem of Complex Network Based on Complex Network Evolution BT - Proceedings of the 2015 International Industrial Informatics and Computer Engineering Conference PB - Atlantis Press SP - 637 EP - 640 SN - 2352-538X UR - https://doi.org/10.2991/iiicec-15.2015.145 DO - 10.2991/iiicec-15.2015.145 ID - Zhang2015/03 ER -