AOI-Cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing (Articolo in rivista)

Type
Label
  • AOI-Cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing (Articolo in rivista) (literal)
Anno
  • 2012-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.1002/cpe.2973 (literal)
Alternative label
  • Ricci L., Genovali L., Carlini E., Coppola M. (2012)
    AOI-Cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing
    in Concurrency and computation (Online); Wiley, San Francisco (Stati Uniti d'America)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Ricci L., Genovali L., Carlini E., Coppola M. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#altreInformazioni
  • Grant agreement 257438 Tipo Progetto EU_FP7 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://onlinelibrary.wiley.com/doi/10.1002/cpe.2973/abstract (literal)
Rivista
Note
  • PuMa (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Department of Computer Science, University of Pisa, Pisa, Italy; IMT Institutions, Markets, Technology, Institute for Advanced Studies, Lucca, Italy; CNR-ISTI, Pisa, Italy; CNR-ISTI, Pisa, Italy; (literal)
Titolo
  • AOI-Cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing (literal)
Abstract
  • This paper presents a novel Area Of Interest (AOI)-cast algorithm for distributed virtual environments targeted to Delaunay-based P2P overlays. The algorithm exploits the mathematical properties of Delaunay triangulations to build a spanning tree supporting the notification of the events generated by a peer to the other ones located in its AOI. The spanning tree is computed by the reversing compass routing, a routing algorithm proposed for geometric networks. Our approach presents a set of novel features. First, it requires only the knowledge of the peer's neighbors, so that the amount of traffic load on the P2P overlay is minimized. Second, we prove that, for circular shaped AOI, the algorithm builds a spanning tree covering all and only the peers of the AOI. Finally, our approach takes into account the possible inconsistencies among the local views of the peers, because the network latency, by introducing a tolerance threshold in the reverse compass routing. We present a set of simulations considering both synthetic data and real data traces taken from a real multiplayer game, which show the effectiveness of our proposal. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Editore di
Insieme di parole chiave di
data.CNR.it