A Local Search algorithm for Ontology-based Peer-to-Peer Networks
One important problem in peer-to-peer (P2P) networks is searching and retrieving the correct information. Semantic Web Services are a promising combination of Semantic Web technology, aiming at providing means of automatically executing, discovering and composing semantically marked-up Web services. First, we propose an mechanisms for information retrieval in ontology-based peer-to-peer networks which allow for carrying out searches on permanently reconfiguring networks to be an ideal infrastructure for deploying a network of Semantic Web Service providers. Next, we propose a graph topology which allows for very efficient broadcast and search. We show how our scheme can be made even more efficient by using a globally known ontology to determine the organization of peers in the graph topology. The modified conceptbased search mechanism, is an extension of the current Gnuttela protocol, allows searching with profiles, and is designed to minimize the number of messages that are needed to search the network. In this algorithm, each peer autonomously decides which of its peers are most likely to answer a given query. The algorithm is entirely distributed, and therefore scales well with the size of the network.
Peer-to-Peer graph peer profile ontology routing
Qian Hong JiangYunfei Qian Hong GuoHeng SuiMingxiang ZhangDonghui
Software Research Instiitute Sun Yat-Sen University GuangZhou, China Computer Science Department ZhongShang polytechnic college ZhongShan, China
国际会议
桂林
英文
459-462
2010-11-17（万方平台首次上网日期，不代表论文的发表时间）