| | |
Summary: Indexing data-oriented overlay networks
Karl Aberer, Anwitaman Datta, Manfred Hauswirth, Roman Schmidt
School of Computer and Communication Sciences
Ecole Polytechnique F´ed´erale de Lausanne (EPFL)
CH-1015 Lausanne, Switzerland
Abstract
The application of structured overlay networks
to implement index structures for data-oriented
applications such as peer-to-peer databases or
peer-to-peer information retrieval, requires highly
efficient approaches for overlay construction,
as changing application requirements frequently
lead to re-indexing of the data and hence (re-
)construction of overlay networks. This prob-
lem has so far not been addressed in the liter-
ature and thus we describe an approach for the
efficient construction of data-oriented, structured
overlay networks from scratch in a self-organized
way. Standard maintenance algorithms for over-
|
