Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
Most of current peer-to-peer designs build their own system overlays independent of the physical one. Nodes within unstructured systems form a random overlay, on the contrary, str...
In this work we study preference systems suitable for the Peer-to-Peer paradigm. Most of them fall in one of the three following categories: global, symmetric and complementary. Al...
Structured peer-to-peer systems allow to administer large volumes of data. Several peers collaborate to generate a query result. Analyses of unstructured peer-to-peer systems, nam...