{"title":"Investigation of Performance of Distributed Complex Systems Using Information-theoretic Means and Genetic Algorithms","authors":"D. Repperger, R. Ewing, J. Lyons, R. G. Roberts","doi":"10.1109/CIRA.2007.382846","DOIUrl":null,"url":null,"abstract":"An investigation is conducted into performance measures to evaluate network-centric systems via their information or other flow properties. To approach this problem, concepts are borrowed from Graph Theory Information Theory, and current methods to analyze network-centric systems. A number of tools are presented to help better understand how to measure the flow in distributed networks. The efficacy of the proposed method is demonstrated by taking a known distributed paradigm (logistics system) and examining situations that produce maximum and minimum flow conditions. The optimization problem involving flow variables is computationally complex (NP-hard) and thus is determined via genetic algorithms.","PeriodicalId":301626,"journal":{"name":"2007 International Symposium on Computational Intelligence in Robotics and Automation","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Symposium on Computational Intelligence in Robotics and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIRA.2007.382846","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
An investigation is conducted into performance measures to evaluate network-centric systems via their information or other flow properties. To approach this problem, concepts are borrowed from Graph Theory Information Theory, and current methods to analyze network-centric systems. A number of tools are presented to help better understand how to measure the flow in distributed networks. The efficacy of the proposed method is demonstrated by taking a known distributed paradigm (logistics system) and examining situations that produce maximum and minimum flow conditions. The optimization problem involving flow variables is computationally complex (NP-hard) and thus is determined via genetic algorithms.