A fundamental problem for both structured and unstructured peer-to-peer networks is how to maintain connected the topology of a network in the presence of processes that, possibly concurrently, join and leave the network. In this paper we firstly define a model of the computation well-suited to analyze connectivity maintenance among processes carrying out a distributed computation considering unbounded concurrency and infinite participation. Secondly upon this model we provide a specification of the connectivity maintenance problem. We finally present a protocol that guarantees connectivity maintenance by arranging processes of the computation on a tree. The protocol handles both joins and leaves concurrently and actively (i.e., some piece of code is executed by a leaving/joining process interacting with its neighbors in the topology). © 2006 IEEE.
Communication channel management for maintenance of strong overlay connectivity / Baldoni, Roberto; Scipioni, Sirio; TUCCI PIERGIOVANNI, Sara. - (2006), pp. 63-68. (Intervento presentato al convegno 11th IEEE Symposium on Computers and Communications, ISCC 2006 tenutosi a Cagliari; Italy nel 26 June 2006 through 29 June 2006) [10.1109/iscc.2006.51].
Communication channel management for maintenance of strong overlay connectivity
BALDONI, Roberto;SCIPIONI, Sirio;TUCCI PIERGIOVANNI, sara
2006
Abstract
A fundamental problem for both structured and unstructured peer-to-peer networks is how to maintain connected the topology of a network in the presence of processes that, possibly concurrently, join and leave the network. In this paper we firstly define a model of the computation well-suited to analyze connectivity maintenance among processes carrying out a distributed computation considering unbounded concurrency and infinite participation. Secondly upon this model we provide a specification of the connectivity maintenance problem. We finally present a protocol that guarantees connectivity maintenance by arranging processes of the computation on a tree. The protocol handles both joins and leaves concurrently and actively (i.e., some piece of code is executed by a leaving/joining process interacting with its neighbors in the topology). © 2006 IEEE.File | Dimensione | Formato | |
---|---|---|---|
VE_2006_11573-367057.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
201.64 kB
Formato
Adobe PDF
|
201.64 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.