Distributed Incremental Construction Method of Delaunay Overlay Network Using Detour Paths

Abstract

Delaunay overlay networks have a Delaunay graph structure, which has spatial locality. This feature is useful for distributed spatial computing, distributed geographical database systems, and geometric routing networks. An incremental construction method of these networks is proposed. The existing method assumes that each communication node can create overlay connections using IDs with all other nodes via underlay networks. Yet this method cannot be used for deploying underlay networks. To solve this problem, the existing method is enhanced by using detour paths for spatial neighbor-connected networks. We propose a detour path construction procedure, which is useful for introducing position-based heuristic routing to L3 networks, DTNs, and database networks.