Name
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). |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/ISCC.2006.51 | ISCC |
Keywords | DocType | ISBN |
connectivity maintenance,strong overlay connectivity,connectivity maintenance problem,infinite participation,fundamental problem,communication channel management,unbounded concurrency,unstructured peer-to-peer network,computational modeling,network topology,protocols,concurrent computing,communication channels,distributed computing | Conference | 0-7695-2588-1 |
Citations | PageRank | References |
3 | 0.40 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Baldoni | 1 | 1606 | 132.37 |
| Sirio Scipioni | 2 | 29 | 3.41 |
| Sara Tucci Piergiovanni | 3 | 286 | 22.22 |