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.
展开▼
