A delaunay triangulation architecture supporting churn and user mobility in MMVEs
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
Efficient management of resources and entities using the HyVonNe P2P architecture
International Journal of Grid and Utility Computing
A location aware P2P voice communication protocol for networked virtual environments
Proceedings of the 16th ACM Symposium on Virtual Reality Software and Technology
Don't love thy nearest neighbor
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
| Hi-index | 0.00 |
Delaunay triangulation (DT) is a useful geometric structure for networking applications. In this paper we investigate the design of join, leave, and maintenance protocols to construct and maintain a distributed DT dynamically. We define a distributed DT and present a necessary and sufficient condition for a distributed DT to be correct. This condition is used as a guide for protocol design. We present join and leave protocols as well as correctness proofs for serial joins and leaves. In addition, to handle concurrent joins and leaves as well as node failures, we present a maintenance protocol. An accuracy metric is defined for a distributed DT. Experimental results show that our join, leave and maintenance protocols are scalable, and they achieve high accuracy for systems under churn and with node failures. We also present application protocols for greedy routing, clustering, broadcast, and multicast within a radius, and discuss and prove their correctness.