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

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.

Download Full-text

HASH-BASED OVERLAY PARTITIONING IN UNSTRUCTURED PEER-TO-PEER SYSTEMS

Parallel Processing Letters ◽

10.1142/s0129626409000067 ◽

2009 ◽

Vol 19 (01) ◽

pp. 57-71

Author(s):

HARRIS PAPADAKIS ◽

PARASKEVI FRAGOPOULOU ◽

EVANGELOS P. MARKATOS ◽

MARIOS D. DIKAIAKOS ◽

ALEXANDROS LABRINIDIS

Keyword(s):

Hash Function ◽

Overlay Network ◽

Peer To Peer ◽

Network Coverage ◽

P2p Networks ◽

Traffic Reduction ◽

Peer To Peer Systems ◽

Simulation Results ◽

The Cost ◽

Unstructured Overlay

Unstructured peer-to-peer (P2P) networks suffer from the increased volume of traffic produced by flooding. Methods such as random walks or dynamic querying managed to limit the traffic at the cost of reduced network coverage. In this paper, we propose a partitioning method of the unstructured overlay network into a relative small number of distinct subnetworks. The partitioning is driven by the categorization of keywords based on a uniform hash function. The method proposed in this paper is easy to implement and results in significant benefit for the blind flood method. Each search is restricted to a certain partition of the initial overlay network and as a result it is much more targeted. Last but not least, the search accuracy is not sacrificed to the least since all related content is searched. The benefit of the proposed method is demonstrated with extensive simulation results, which show that the overhead for the implementation and maintenance of this system is minimal compared to the resulted benefit in traffic reduction.

Download Full-text

Comment on “DIO Suppression Attack Against Routing in the Internet of Things”

10.36227/techrxiv.11346335.v1 ◽

2019 ◽

Author(s):

Abhishek Verma ◽

Virender Ranga

Keyword(s):

Internet Of Things ◽

Network Topology ◽

Impact Analysis ◽

The Internet ◽

Routing Performance ◽

Routing Attack ◽

The Internet Of Things ◽

Specific Reason

<div>We have thoroughly studied the paper of Perazzo et al., which presents a routing attack named DIO suppression attack with its impact analysis. However, the considered simulation grid of size 20mx20m does not correspond to the results presented in their paper. We believe that the incorrect simulation detail needs to be rectified further for the scientific correctness of the results. In this comment, it is shown that the suppression attack on such small sized network topology does not have any major impact on routing performance, and specific reason is discussed for such behavior.</div>

Download Full-text