{"title":"点对点网络语义查询路由的蚁群优化","authors":"U. V. Arivazhagu, S. Srinivasan","doi":"10.1109/ICOAC.2012.6416847","DOIUrl":null,"url":null,"abstract":"Peer-to-Peer systems implement a new environment in decentralized model. In the previous work, to process a single query searching of neighbor nodes is difficult. During query processing we need to search all the nodes in a network for retrieving the appropriate answer for the queries in a particular peer. Hence in this paper we proposed an ant colony optimization technique for query routing and relevance ranking methodology for the selection of peers with good accuracy. Secured way of routing is very important in order to extract efficient resources from the peers. Clustered based approach can be used to overcome the high overhead and delay. By simulation results, we show that our approach improves the efficiency of P2P networks.","PeriodicalId":286985,"journal":{"name":"2012 Fourth International Conference on Advanced Computing (ICoAC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Ant colony optimization of semantic query routing in Peer to Peer networks\",\"authors\":\"U. V. Arivazhagu, S. Srinivasan\",\"doi\":\"10.1109/ICOAC.2012.6416847\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Peer-to-Peer systems implement a new environment in decentralized model. In the previous work, to process a single query searching of neighbor nodes is difficult. During query processing we need to search all the nodes in a network for retrieving the appropriate answer for the queries in a particular peer. Hence in this paper we proposed an ant colony optimization technique for query routing and relevance ranking methodology for the selection of peers with good accuracy. Secured way of routing is very important in order to extract efficient resources from the peers. Clustered based approach can be used to overcome the high overhead and delay. By simulation results, we show that our approach improves the efficiency of P2P networks.\",\"PeriodicalId\":286985,\"journal\":{\"name\":\"2012 Fourth International Conference on Advanced Computing (ICoAC)\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Fourth International Conference on Advanced Computing (ICoAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOAC.2012.6416847\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Fourth International Conference on Advanced Computing (ICoAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOAC.2012.6416847","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ant colony optimization of semantic query routing in Peer to Peer networks
Peer-to-Peer systems implement a new environment in decentralized model. In the previous work, to process a single query searching of neighbor nodes is difficult. During query processing we need to search all the nodes in a network for retrieving the appropriate answer for the queries in a particular peer. Hence in this paper we proposed an ant colony optimization technique for query routing and relevance ranking methodology for the selection of peers with good accuracy. Secured way of routing is very important in order to extract efficient resources from the peers. Clustered based approach can be used to overcome the high overhead and delay. By simulation results, we show that our approach improves the efficiency of P2P networks.