Skip to Main content Skip to Navigation
New interface
Conference papers

Weaving Arigatoni with a graph topology

Michel Cosnard 1 Luigi Liquori 2, 1 
1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
2 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Luigi Liquori Connect in order to contact the contributor
Submitted on : Wednesday, May 13, 2015 - 12:53:29 PM
Last modification on : Thursday, August 4, 2022 - 4:52:44 PM
Long-term archiving on: : Wednesday, April 19, 2017 - 3:07:30 PM


Files produced by the author(s)



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⟩



Record views


Files downloads