点对点网络语义查询路由的蚁群优化

U. V. Arivazhagu, S. Srinivasan
{"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}
引用次数: 2

摘要

点对点系统在去中心化模式下实现了一种新的环境。在以往的工作中,处理邻居节点的单个查询搜索比较困难。在查询处理期间,我们需要搜索网络中的所有节点,以便为特定对等点中的查询检索适当的答案。因此,本文提出了一种蚁群优化查询路由技术和相关度排序方法,用于选择精度较高的节点。为了从对等体中提取有效的资源,安全的路由方式非常重要。基于集群的方法可以克服高开销和延迟。仿真结果表明,该方法提高了P2P网络的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Realization of gateway relocation using admission control algorithm in mobile WiMAX networks Where are you? A location awareness system Atmospheric correction of remotely sensed multispectral satellite images in transform domain Vehicle detection in aerial surveillance using morphological shared-pixels neural (MSPN) networks SVM-instance based approach to improve QoS parameters for time critical applications in WSN
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1