DocumentCode :
2370656
Title :
Weaving Arigatoni with a Graph Topology
Author :
Cosnard, Michel ; Liquori, Luigi
Author_Institution :
INRIA Rocquencourt Headquarters, Paris
fYear :
2007
fDate :
4-9 Nov. 2007
Firstpage :
55
Lastpage :
59
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, asynchronous, 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.
Keywords :
graph theory; routing protocols; telecommunication network topology; Arigatoni protocols; dynamic network topology; graph topology; multilayer overlay network; resource discovery loops; resource overbooking; routing loops; routing tables; scalable resource discovery mechanism; weaving Arigatoni; Computer networks; Grid computing; IP networks; Network topology; Peer to peer computing; Personal digital assistants; Protocols; Routing; Weaving; Web and internet services;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Engineering Computing and Applications in Sciences, 2007. ADVCOMP 2007. International Conference on
Conference_Location :
Papeete
Print_ISBN :
978-0-7695-2992-9
Type :
conf
DOI :
10.1109/ADVCOMP.2007.11
Filename :
4401898
Link To Document :
بازگشت