Weaving Arigatoni with a graph topology - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

Weaving Arigatoni with a graph topology


Arigatoni is a structured multi-layer overlay network that provides various services with variable guarantees, and promotes an intermittent participation in the overlay because peers can appear, disappear, and organize themselves dynamically. Arigatoni provides a very powerful decentralized, asyn-chronous, and scalable resource discovery mechanism within an overlay with a dynamic network topology. In the first version of Arigatoni, the network topology was tree-or forest-based. This paper makes a significant step by weaving the network topology with general dynamic graph properties. As an immediate consequence, the Arigatoni protocols must be reconsidered in order to take into accounts routing loops when updating routing tables, for dealing with resource overbooking, and resource discovery loops.
Fichier principal
Vignette du fichier
2007-advcomp-07.pdf (348.73 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01148523 , version 1 (13-05-2015)



Michel Cosnard, Luigi Liquori. Weaving Arigatoni with a graph topology. 1sr International Conference on Advanced Engineering Computing and Applications in Sciences ADVCOMP 2007, Nov 2007, Papeete, French Polynesia. pp.55 - 59, ⟨10.1109/ADVCOMP.2007.11⟩. ⟨hal-01148523⟩
426 View
140 Download



Gmail Facebook Twitter LinkedIn More