By Topic

New Results in Understanding Performance and Vulnerability in Complex Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Repperger, D.W. ; Air Force Research Laboratory - Dayton, Ohio

New results can be obtained about performance and vulnerability of complex networks through the common intersection of the fields of graph theory, information theory, and optimization theory. Graph theory provides a basis of architecture and also constraint relationships for key flow variables. Information theory provides measures and metrics of flow performance. The optimization of complex networks is accomplished via genetic algorithms on the flow variables. By performing a minimum flow and maximum flow optimization, a sensitivity matrix of vulnerabilities of a network can be ascertained. Thus the most vulnerable set of nodes can be determined. This procedure is first applied to a logistics network. The generalization to communication's networks and other distributed complex systems is discussed.

Published in:

Computational Intelligence in Robotics and Automation, 2007. CIRA 2007. International Symposium on

Date of Conference:

20-23 June 2007