AOI‐cast in distributed virtual environments: an approach based on delay tolerant reverse compass routing

Abstract

SummaryThis 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. Copyright © 2012 John Wiley & Sons, Ltd.

A Study on Design Requirement Development and Satisfaction for Future Virtual World Systems

“…Energy trade-off [67] QoS/QoE MAUI [87] Reliability Reliability Database replication [88] Database replication [88] Pithos [89] Backup [105] IRS [106] Mutual verification [107] RACS [108] Hotspot Scalability KIWANO [102] Peer-assisted [91] AOI-cast [103] Virtual server transfer [90] Security Cheating Prevention Cryptographic measures [104] Cheating Detection Behavior monitoring [105] IRS [106] Mutual verification [107] RACS [108]…”

Virtual Net: A Decentralized Architecture for Interaction in Mobile Virtual Worlds

“…Interest management [2] restricts the range of message receipt to reduce communication overhead in state update. Event dissemination [6] reduces the number of communication channels on event senders to avoid overwhelming them in hotspot areas. Cheat prevention [7] is needed to achieve fairness without the arbitration from a central server.…”

Community Discovery for Interest Management in DVEs: A Case Study

“…However, these solution are often based on a distributed index, which needs to be maintained causing latencies and disruption in the interest management. Compared to structured approaches, unstructured P2P solutions focus on building the overlay according to the spatial proximity of the peers in the virtual environment [12,21]. In order to perform IM, each peer connects with a subset of its neighbours so that peers may warn each other both about their movements and about new peers entering their AoI.…”

“…A common trait of DVEs architectures is the distribution of the state of the virtual environment to the client machines. Many distribution approaches have been proposed over the years [20], ranging from unstructured solutions [12,21] to structured ones [3,15]. The fundamental requirement arising from the distribution of the state is making sure that each client machine has its view of the virtual environment up-to-date.…”