A scalable and ontology-based P2P infrastructure for Semantic Web Services

被引:46
作者
Schlosser, M [1 ]
Sintek, M [1 ]
Decker, S [1 ]
Nejdl, W [1 ]
机构
[1] Stanford Univ, Stanford, CA 94305 USA
来源
SECOND INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING, PROCEEDINGS | 2002年
关键词
D O I
10.1109/PTP.2002.1046319
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Semantic Web Services area promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing semantically marked-up Web services We envision peer-to-peer networks which allow for carrying out searches in real-time on permanently reconfiguring networks to be an ideal infrastructure for deploying a network of Semantic Web Service providers However, P2P networks evolving in an unorganized manner suffer from serious scalability problems, limiting the number of nodes in the network, creating network overload and pushing search times to unacceptable limits We address these problems by imposing a deterministic shape on P2P networks We propose a graph topology which allows for very efficient broadcast and search, and we provide an efficient topology construction and maintenance algorithm which, crucial to symmetric peer-to-peer networks, does neither require a central server nor super nodes in the network. 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, allowing for efficient concept-based search.
引用
收藏
页码:104 / 111
页数:8
相关论文
共 12 条
[1]  
Akers S. B., 1989, IEEE T COMPUTERS, V38
[2]  
CRESPO A, 2002, P 28 C DISTR COMP SY
[3]  
JOHNSON SL, 1989, IEEE T COMPUTERS, V38
[4]  
MARTIN D, 2001, DAML S SEMANTIC MARK
[5]   Semantic Web services [J].
McIlraith, SA ;
Son, TC ;
Zeng, HL .
IEEE INTELLIGENT SYSTEMS & THEIR APPLICATIONS, 2001, 16 (02) :46-53
[6]  
NEJDL W, 2002, P WWW11 MAY HAW
[7]  
PANDURANGAN G, 2001, P 42 ANN IEEE S FDN
[8]  
Ratnasamy S., 2001, P ACM SIGCOMM AUG
[9]  
RATNASAMY S, 2002, P 1 INT WORKSH P2P S
[10]  
Schlosser M., 2002, HYPERCUP O SHAPING P