DocumentCode
475593
Title
Computing the Tenacity of Network Based on Genetic Algorithm
Author
Wang, Yue ; Cai, Wandong ; Duan, Qi
Author_Institution
Sch. of Comput. Sci., Northwestern Polytech. Univ., Xi´´an
Volume
1
fYear
2008
fDate
3-4 Aug. 2008
Firstpage
61
Lastpage
65
Abstract
Tenacity is an important index for evaluating network vulnerability, implying the difficulty of destroying the network when nodes were invalidated or network was attacked. Tenacity also indicates the communication capability of subnet and the difficulty of network restoration after parts of network were damaged. At present, there is no algorithm that can compute the tenacity in polynomial time because the computation of tenacity is an NP problem. To solve the problem of complicated exhaustive scheme, an algorithm based on genetic algorithm is proposed to compute the tenacity of network. Stochastic optimization technique is used to search optimum solution efficiently in parametric space of tenacity. The results of simulation suggest that the algorithm is always converging at optimum solution efficiently. This algorithm provides a feasible and valid method to measure the vulnerability of network.
Keywords
computational complexity; computer network reliability; genetic algorithms; NP problem; genetic algorithm; network restoration; network tenacity; network vulnerability; polynomial time; stochastic optimization technique; Communication system control; Computer network management; Computer networks; Computer science; Equations; Genetic algorithms; Graph theory; Network topology; Polynomials; Scattering; Genetic Algorithm; Tenacity; Vulnerability;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing, Communication, Control, and Management, 2008. CCCM '08. ISECS International Colloquium on
Conference_Location
Guangzhou
Print_ISBN
978-0-7695-3290-5
Type
conf
DOI
10.1109/CCCM.2008.340
Filename
4609469
Link To Document