Name
Abstract | ||
|---|---|---|
A fundamental requirement for the discovery and the retrieval of the entities of a distributed virtual environment is the definition of a scalable Interest Management (IM) support. This paper presents a distributed protocol for IM that integrates two different gossip protocols. The first one based on a discrete tessellation of the Area of Interest of a peer in order to maximise its coverage by the peer neighbours. The second is based on a distributed algorithm enabling the peers to self-organise themselves in communities. The paper presents a set of experimental results showing the effectiveness of the proposed approach. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-54420-0_36 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Interest management,Virtual machine,Computer science,Computer network,Distributed algorithm,Tessellation,Gossip protocol,Area of interest,Scalability,Distributed computing | Conference | 8374 |
ISSN | Citations | PageRank |
0302-9743 | 5 | 0.42 |
References | Authors | |
27 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emanuele Carlini | 1 | 166 | 20.15 |
| Patrizio Dazzi | 2 | 249 | 24.78 |
| Matteo Mordacchini | 3 | 218 | 19.66 |
| Laura Ricci | 4 | 151 | 14.12 |