Autonomous Generation of Spherical P2P Delaunay Network for Global Internet Applications

Kato, Hiroaki; Eguchi, T.; Ohnishi, Masato; Ueshima, Shinichi

doi:10.1109/c5.2006.10

Cited by 9 publications

(5 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[29] suggests to exploit Compass Routing to define a Spanning Tree supporting an application layer multicast. [31][32][33]21,28] propose protocols to build and maintain Delaunay triangulation-based overlay networks. [32] describes an incremental algorithm to construct and manage bi-dimensional Delaunay overlay networks where nodes communicate only with neighbouring nodes and build the overlay network incrementally.…”

Section: Related Workmentioning

confidence: 99%

“…This approach is applicable to geographical networks with large diameter and GIS (Geographical Information Systems). [33] proposes a distributed algorithm to build spherical Delaunay networks where nodes operate independently to generate incrementally a local area network according to the geometrical proximity of neighbour nodes. It can be used in the context of Collaborative Virtual Space.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Multidimensional range queries on hierarchical Voronoi overlays

Ferrucci

Ricci

Albano

et al. 2016

Journal of Computer and System Sciences

View full text Add to dashboard Cite

The definition of a support for multi-attribute range queries is mandatory for highly distributed systems. Even if several solutions have been proposed in the last decade, most of them do not meet the requirements of recent platforms, like IoT or smart cities. The paper presents an approach that builds a multidimensional Voronoi graph by exploiting the attributes of the objects published by a node. Our solution overcomes the curse of dimensionality issue affecting Voronoi Tessellations in high dimensional spaces by defining a Voronoi hierarchy. The paper formally defines the structure, analysis the complexity of the operations and presents experimental results

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Multidimensional range queries on hierarchical Voronoi overlays

Ferrucci

Ricci

Albano

et al. 2016

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…This is because Delaunay graph topology is a necessary and sufficient condition to ensure success of greedy routing based on Euclidean distance. Second, the Delaunay graph structure is a local structure, so control messages are only exchanged locally with distributed Delaunay overlay constructing methods [3] [4]. Third, Delaunay overlay networks' routing tables only have spatial neighbor nodes.…”

Section: Introductionmentioning

confidence: 99%

Distributed Incremental Construction Method of Delaunay Overlay Network Using Detour Paths

Ohnishi

Inoue

2011

2011 Tenth International Symposium on Autonomous Decentralized Systems

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…This approach is applicable to geographical networks with large diameter and geographical information systems, such as, GIS navigation systems. In [15] the authors propose a distributed algorithm to build spherical P2P Delaunay networks, where the nodes operate independently, generating a local area network according to the geometrical proximity of neighbour nodes. At global levels nodes incrementally generate spherical networks.…”

Section: Related Workmentioning

confidence: 99%

“…[2], [14], [15], [16] propose protocols to build and maintain Delaunay triangulation-based overlay networks. The authors of [2] investigates the design of node join, node leave and node failure protocols in environments with a high churn rate.…”

Section: Related Workmentioning

confidence: 99%

GoDel: Delaunay overlays in P2P networks via Gossip

Baraglia

Dazzi

Guidi

et al. 2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

Abstract-P2P overlays based on Delaunay triangulations have been recently exploited to implement systems providing efficient routing and data broadcast solutions. Several applications such as Distributed Virtual Environments and geographical nearest neighbours selection benefit from this approach. This paper presents a novel distributed algorithm for the incremental construction of a Delaunay overlay in a P2P network. The algorithm employs a distributed version of the classical Edge Flipping procedure. Each peer builds the Delaunay links incrementally by exploiting a random peer sample returned by the underlying gossip level. The algorithm is then optimized by considering the Euclidean distance between peers to speed up the overlay convergence. We present theoretical results that prove the correctness of our approach along with a set of experiments that assess the convergence rate of the distributed algorithm.

show abstract

Autonomous Generation of Spherical P2P Delaunay Network for Global Internet Applications

Cited by 9 publications

References 5 publications

Multidimensional range queries on hierarchical Voronoi overlays

Multidimensional range queries on hierarchical Voronoi overlays

Distributed Incremental Construction Method of Delaunay Overlay Network Using Detour Paths

GoDel: Delaunay overlays in P2P networks via Gossip

Contact Info

Product

Resources

About