Distributive Generation Algorithm of Long Range Contact for Remote Spatial-data Access on P2P Delaunay Network

Ohnishi, Masato; Tsuboi, S.; Hirayama, Mio; Eguchi, T.; Ueshima, Shinichi

doi:10.1109/c5.2007.10

Cited by 4 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are several previous works concerned with the hierarchical Delaunay network. Ohnishi et al proposed a network called LRC (Long Range Contact), 13 which is obtained by connecting each peer in a Delaunay network with (at least) log N remote peers via shortcut links. More precisely, it connects each peer x to peers at 2 i hops away from x by shortcut links for each 1 ≤ i ≤ log N .…”

Section: Hierarchical Delaunay Networkmentioning

confidence: 99%

“…In fact, the improvement of the routing performance is attained by the hyper-cubic shortcut links, and the fact that the underlying graph is organized according to DT is not used except for the calculation of the intersection of Voronoi regions with the given bands. 13 Skip Delaunay Network (SDN) 18 proposed by the same authors is a more explicit extension of the skip graph. Recall that the basic idea of skip graph is to assign a random bit sequence to each peer as the ID and to construct ring structure defined by the lexicographical order of IDs in a hierarchical manner.…”

Section: Hierarchical Delaunay Networkmentioning

confidence: 99%

See 1 more Smart Citation

Three-Tier Delaunay Network as a Topology for Peer-to-Peer Overlay

Fujita

2019

J. Inter. Net.

View full text Add to dashboard Cite

This paper considers the problem of improving the routing performance of hierarchical Delaunay networks. Delaunay network is a network topology for peer-to-peer systems based on the Delaunay triangulation of a set of points associated with a set of peers. It is known that Delaunay networks have a favorable property as a topology for peer-to-peer systems such that a greedy routing scheme always delivers a given message to its destination without encountering a dead-end. The key idea used in the proposed method is to apply a hash function to the address of participant peers. More concretely, by applying a hash function to the coordinate point of the peers and by associating several points to each peer, we could realize an overlay so that the number of hops to the destination in the original network could be significantly reduced.

show abstract

Section: Hierarchical Delaunay Networkmentioning

confidence: 99%

Section: Hierarchical Delaunay Networkmentioning

confidence: 99%