Search in P2P Triangular Mesh by Space Filling Trees

Nicolas Bonnel (1) , Gildas Ménier (1) , Pierre-François Marteau (1)

1 VALORIA - Laboratoire de Recherche en Informatique et ses Applications de Vannes et Lorient

We introduce a new P2P exploration strategy based on an extension of space filling curve principles. This stategy is exhaustive and do not generates redundant messages. Initiated at the source node of a search query, a walker is sent to explore the neighbourhood of this node. This walker is carrying an increasing list of visited nodes as an Ariadne-sequence, building at the same time an uncrossable fence. When encountering a fence, this walker splits and its offsprings continue the scanning of the close neighbourhood. The set of walkers creates a tree-like covering structure that ensures that all nodes are visited once and only once. We describe the support overlay and introduce a low cost node heterogeneity management. We conclude with a discussion on experimental validation results.

Mots clés: P2P; Filling curve; Apollonian network; Flooding

Domaines: Réseaux et télécommunications [cs.NI]

Nicolas Bonnel, Gildas Ménier, Pierre-François Marteau. Search in P2P Triangular Mesh by Space Filling Trees. 16th IEEE International Conference on Networks (ICON), Dec 2008, New Delhi, India. pp.1 - 6, ⟨10.1109/ICON.2008.4772629⟩. ⟨hal-00497607⟩