{"title":"基于树型聚类的数据网格一致性创新方法","authors":"Hosein Ebrahimi Ahangaran, A. Rahmani","doi":"10.1109/ICCNT.2010.8","DOIUrl":null,"url":null,"abstract":"Nowadays, Data Grids can be seen as a frameworks responding to the needs of large scale applications by affording varied geographically distributed resources set. The main aim here is to ensure flexible and efficient access and quality data, to improve the availability and accessibility, we must improve scalability and efficient usability of Grid to reduce application communication costs and request average response times. In relation with the problem of the coherence maintenance of replicas, we propose a Tree-Based Clustering method which not only organizes those replicas having similarity in demand number into clusters hierarchically looking like trees, but also tries to choose the shortest connection so that communication cost, average response time and total data transferred through Grid will be reduced.","PeriodicalId":135847,"journal":{"name":"2010 Second International Conference on Computer and Network Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"An Innovative Approach of Data Grid Consistency Using Tree-Based Clustering\",\"authors\":\"Hosein Ebrahimi Ahangaran, A. Rahmani\",\"doi\":\"10.1109/ICCNT.2010.8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, Data Grids can be seen as a frameworks responding to the needs of large scale applications by affording varied geographically distributed resources set. The main aim here is to ensure flexible and efficient access and quality data, to improve the availability and accessibility, we must improve scalability and efficient usability of Grid to reduce application communication costs and request average response times. In relation with the problem of the coherence maintenance of replicas, we propose a Tree-Based Clustering method which not only organizes those replicas having similarity in demand number into clusters hierarchically looking like trees, but also tries to choose the shortest connection so that communication cost, average response time and total data transferred through Grid will be reduced.\",\"PeriodicalId\":135847,\"journal\":{\"name\":\"2010 Second International Conference on Computer and Network Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Second International Conference on Computer and Network Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCNT.2010.8\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computer and Network Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCNT.2010.8","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Innovative Approach of Data Grid Consistency Using Tree-Based Clustering
Nowadays, Data Grids can be seen as a frameworks responding to the needs of large scale applications by affording varied geographically distributed resources set. The main aim here is to ensure flexible and efficient access and quality data, to improve the availability and accessibility, we must improve scalability and efficient usability of Grid to reduce application communication costs and request average response times. In relation with the problem of the coherence maintenance of replicas, we propose a Tree-Based Clustering method which not only organizes those replicas having similarity in demand number into clusters hierarchically looking like trees, but also tries to choose the shortest connection so that communication cost, average response time and total data transferred through Grid will be reduced.