Eliana Valenzuela Andrade, Manuel Rodiguez-Martinez
{"title":"基于蚁群理论的数据源和查询处理站点的自主排序和表征","authors":"Eliana Valenzuela Andrade, Manuel Rodiguez-Martinez","doi":"10.1109/AMS.2009.71","DOIUrl":null,"url":null,"abstract":"This paper presents a novel approach to the problem of discovering and ranking the characteristics of the data sources and query processing sites in a distributed database system. We model the network as a graph with nodes representing data sources and query processing sites, some of which might be replicated.We introduce a heuristic technique inspired in Ant Colony Theory to dynamically discover,assess and catalog each data source or query-processing site. Our goal is to find possible paths to access the computational resources or data provided by the highest quality sites and define the quality of this sites and data sources. The concept of quality could be defined in terms of performance, freshness, completeness or other metrics. We describe a simulation of the system using Java CSIM and also a preliminary performance and freshness studies designed to analyze the quality of paths found by the Ant Colony algorithm and the accurate of the freshness estimators. These experiments show that our approach is promissory and could do the job than we expect offering the information that the system needs to optimize a query request in a middleware system.","PeriodicalId":6461,"journal":{"name":"2009 Third Asia International Conference on Modelling & Simulation","volume":"35 1","pages":"578-583"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Autonomic Ranking and Characterization of Data Sources and Query Processing Sites Using Ant Colony Theory\",\"authors\":\"Eliana Valenzuela Andrade, Manuel Rodiguez-Martinez\",\"doi\":\"10.1109/AMS.2009.71\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel approach to the problem of discovering and ranking the characteristics of the data sources and query processing sites in a distributed database system. We model the network as a graph with nodes representing data sources and query processing sites, some of which might be replicated.We introduce a heuristic technique inspired in Ant Colony Theory to dynamically discover,assess and catalog each data source or query-processing site. Our goal is to find possible paths to access the computational resources or data provided by the highest quality sites and define the quality of this sites and data sources. The concept of quality could be defined in terms of performance, freshness, completeness or other metrics. We describe a simulation of the system using Java CSIM and also a preliminary performance and freshness studies designed to analyze the quality of paths found by the Ant Colony algorithm and the accurate of the freshness estimators. These experiments show that our approach is promissory and could do the job than we expect offering the information that the system needs to optimize a query request in a middleware system.\",\"PeriodicalId\":6461,\"journal\":{\"name\":\"2009 Third Asia International Conference on Modelling & Simulation\",\"volume\":\"35 1\",\"pages\":\"578-583\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Third Asia International Conference on Modelling & Simulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AMS.2009.71\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Third Asia International Conference on Modelling & Simulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2009.71","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Autonomic Ranking and Characterization of Data Sources and Query Processing Sites Using Ant Colony Theory
This paper presents a novel approach to the problem of discovering and ranking the characteristics of the data sources and query processing sites in a distributed database system. We model the network as a graph with nodes representing data sources and query processing sites, some of which might be replicated.We introduce a heuristic technique inspired in Ant Colony Theory to dynamically discover,assess and catalog each data source or query-processing site. Our goal is to find possible paths to access the computational resources or data provided by the highest quality sites and define the quality of this sites and data sources. The concept of quality could be defined in terms of performance, freshness, completeness or other metrics. We describe a simulation of the system using Java CSIM and also a preliminary performance and freshness studies designed to analyze the quality of paths found by the Ant Colony algorithm and the accurate of the freshness estimators. These experiments show that our approach is promissory and could do the job than we expect offering the information that the system needs to optimize a query request in a middleware system.