Details
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 2nd International Conference on Peer-to-Peer Computing, P2P 2002 |
| Editors | Nahid Shahmehri, Ross Lee Graham |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 104-111 |
| Number of pages | 8 |
| ISBN (electronic) | 0769518109, 9780769518107 |
| Publication status | Published - 2002 |
| Externally published | Yes |
| Event | 2nd International Conference on Peer-to-Peer Computing, P2P 2002 - Linkoping, Sweden Duration: 5 Sept 2002 → 7 Sept 2002 |
Publication series
| Name | Proceedings - 2nd International Conference on Peer-to-Peer Computing, P2P 2002 |
|---|
Abstract
Semantic Web Services are a 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.
ASJC Scopus subject areas
- Computer Science(all)
- Computer Networks and Communications
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
Proceedings - 2nd International Conference on Peer-to-Peer Computing, P2P 2002. ed. / Nahid Shahmehri; Ross Lee Graham. Institute of Electrical and Electronics Engineers Inc., 2002. p. 104-111 1046319 (Proceedings - 2nd International Conference on Peer-to-Peer Computing, P2P 2002).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - A scalable and ontology-based P2P infrastructure for Semantic Web Services
AU - Schlosser, M.
AU - Sintek, M.
AU - Decker, S.
AU - Nejdl, W.
N1 - Publisher Copyright: © 2002 IEEE.
PY - 2002
Y1 - 2002
N2 - Semantic Web Services are a 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.
AB - Semantic Web Services are a 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.
UR - http://www.scopus.com/inward/record.url?scp=84964285125&partnerID=8YFLogxK
U2 - 10.1109/PTP.2002.1046319
DO - 10.1109/PTP.2002.1046319
M3 - Conference contribution
AN - SCOPUS:84964285125
T3 - Proceedings - 2nd International Conference on Peer-to-Peer Computing, P2P 2002
SP - 104
EP - 111
BT - Proceedings - 2nd International Conference on Peer-to-Peer Computing, P2P 2002
A2 - Shahmehri, Nahid
A2 - Graham, Ross Lee
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2nd International Conference on Peer-to-Peer Computing, P2P 2002
Y2 - 5 September 2002 through 7 September 2002
ER -