Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 112-124 |
| Seitenumfang | 13 |
| Fachzeitschrift | Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) |
| Jahrgang | 2530 |
| Publikationsstatus | Veröffentlicht - 2003 |
| Extern publiziert | Ja |
| Veranstaltung | First International Workshop: AP2PC 2002 - Agents and Peer-to-Peer Computing - Bologna, Italien Dauer: 15 Juli 2002 → 15 Juli 2002 |
Abstract
Peer-to-peer networks are envisioned to be deployed for a wide range of applications. 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 describe a broadcast algorithm that exploits the topology to reach all nodes in the network with the minimum number of messages possible. 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. Nodes can join and leave the self-organizing network at any time, and the network is resilient against failure. Moreover, we show how our scheme can be made even more efficient by using a global ontology to determine the organization of peers in the graph topology, allowing for efficient concept-based search.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Theoretische Informatik
- Informatik (insg.)
- Allgemeine Computerwissenschaft
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), Jahrgang 2530, 2003, S. 112-124.
Publikation: Beitrag in Fachzeitschrift › Konferenzaufsatz in Fachzeitschrift › Forschung › Peer-Review
}
TY - JOUR
T1 - HyperCuP - Hypercubes, ontologies, and efficient search on peer-to-peer networks
AU - Schlosser, Mario
AU - Sintek, Michael
AU - Decker, Stefan
AU - Nejdl, Wolfgang
PY - 2003
Y1 - 2003
N2 - Peer-to-peer networks are envisioned to be deployed for a wide range of applications. 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 describe a broadcast algorithm that exploits the topology to reach all nodes in the network with the minimum number of messages possible. 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. Nodes can join and leave the self-organizing network at any time, and the network is resilient against failure. Moreover, we show how our scheme can be made even more efficient by using a global ontology to determine the organization of peers in the graph topology, allowing for efficient concept-based search.
AB - Peer-to-peer networks are envisioned to be deployed for a wide range of applications. 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 describe a broadcast algorithm that exploits the topology to reach all nodes in the network with the minimum number of messages possible. 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. Nodes can join and leave the self-organizing network at any time, and the network is resilient against failure. Moreover, we show how our scheme can be made even more efficient by using a global 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=21144432204&partnerID=8YFLogxK
U2 - 10.1007/3-540-45074-2_11
DO - 10.1007/3-540-45074-2_11
M3 - Conference article
AN - SCOPUS:21144432204
VL - 2530
SP - 112
EP - 124
JO - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
JF - Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
SN - 0302-9743
T2 - First International Workshop: AP2PC 2002 - Agents and Peer-to-Peer Computing
Y2 - 15 July 2002 through 15 July 2002
ER -