Routing over Relaxed Triangulation Structures for P2P-based Virtual Environments

Despite the plethora of existing works, the efficient distribution and management of avatar states remains a highly challenging issue in P2P-based virtual environments (VEs). The present paper addresses this issue by building on our previously proposed Relaxed Triangulation (RT) overlay, designed to accommodate the dynamic nature of VEs by drastically reducing the maintenance cost inherent to the well-known Delaunay construct. Given that our RT overlay no longer supports greedy routing, we propose in this paper to complement our RT overlay with a message routing algorithm that guarantees message delivery on top of RT, thus combining in one solution the best of the two worlds. We provide simulation results to demonstrate our system performance, and also discuss its limitations.