Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Delete and insert operations in Voronoi/Delaunay methods and applications
Computers & Geosciences
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Concurrency and Computation: Practice & Experience - Second International Workshop on Emerging Technologies for Next-generation GRID (ETNGRID 2005)
Protocol Design for Dynamic Delaunay Triangulation
ICDCS '07 Proceedings of the 27th International Conference on Distributed Computing Systems
DS-RT '07 Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications
VON: a scalable peer-to-peer network for virtual environments
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Grid and P2P environments often require to manage a wide number of distributed and mobile entities. In this paper we present a scalable partitioning technique of the entity space, based on Voronoi diagrams, that is well-suited for distributed applications with dynamically changing topology. In HyVonNe (Hybrid Voronoi Network) architecture, the entity space is partitioned in Voronoi regions, each one including a limited number of entities and managed by a Region Leader. Regions are created and deleted depending on the spatial density of entities and the resulting Overlay Network is used to support routing and searching activities. This two-layered structure (entity space and Voronoi regions) is scalable, extendable, and allows to reduce the propagation of the entity position updates in the network and to maintain the load balancing among regions. The fault tolerance features of HyVonNe are studied as well, simulating two different applications in Grid and P2P environments.