scholarly journals Routing performance of structured overlay in Distributed Hash Tables (DHT) for P2P

2019 ◽  
Vol 8 (2) ◽  
pp. 389-395
Author(s):  
Rafiza Ruslan ◽  
Ayu Shaqirra Mohd Zailani ◽  
Nurul Hidayah Mohd Zukri ◽  
Nur Khairani Kamarudin ◽  
Shamsul Jamel Elias ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Network Performance ◽  
Overlay Networks ◽  
Rapid Development ◽  
Hash Tables ◽  
Hop Count ◽  
Structured Overlay ◽  
Routing Performance ◽  
Structured Overlay Networks ◽  
Better Than

This paper presents a routing performance analysis of structured P2P overlay network. Due to the rapid development and hectic life, sharing data wirelessly is essential. P2P allows participating peers move freely by joining and leaving the network at any convenience time. Therefore, it exists constraint when one measuring the network performance. Moreover, the design of structured overlay networks is fragmented and with various design. P2P networks need to have a reliable routing protocol. In order to analyse the routing performance, this work simulates three structured overlay protocols-Chord, Pastry and Kademlia using OMNeT++ with INET and OverSim module. The result shows that Pastry is the best among others with 100% routing efficiency. However, Kademlia leads with 12.76% and 18.78% better than Chord and Pastry in lookup hop count and lookup success latency respectively. Hence, Pastry and Kamelia architectures will have a better choice for implementing structured overlay P2P network.

SONNET: subscription using path queries over structured overlay networks

2007 ◽  
Vol 1 (2) ◽  
pp. 213-225
Author(s):  
Weining Qian ◽  
Linhao Xu ◽  
Aoying Zhou ◽  
Minqi Zhou
Keyword(s):  
Overlay Networks ◽  
Structured Overlay ◽  
Path Queries ◽  
Structured Overlay Networks

scholarly journals Performance of Static Iot Networks using RPL Objective Functions

2019 ◽  
Vol 8 (4) ◽  
pp. 8972-8977 ◽  
Keyword(s):  
Objective Function ◽  
Routing Protocol ◽  
Routing Algorithms ◽  
Transmission Protocol ◽  
Objective Functions ◽  
Lossy Networks ◽  
Hop Count ◽  
Efficient Data ◽  
Selection Of ◽  
Better Than

Internet of Things, abbreviated as IoT is a network used mainly for the communication where different devices are connected for the retrieval, examination and execution of the necessary task. One of IoT’s biggest challenge is that, they are resource-constrained. Hence, it is essential to use an efficient data transmission protocol for routing. An effective routing protocol for static IoT network is the Routing protocol for Low Power and Lossy Networks (RPL). It is essential to assess the effectiveness of the RPL with the selection of best objective function for different static model. In this paper, the performance of different routing algorithms is compared in connection with different static topologies. Hence, the objective function’s performance is compared for different topologies i.e., Butterfly, Ring and Umbrella topologies. We consider two objective functions: namely Minimum Rank with Hysteresis Objective Function (MRHOF) and Objective Function Zero (OF0). MRHOF considers Expected Transmission Count (ETX) as its metric and the metric considered under OF0 is hop count. It is observed that the objective function OF0 performs better than MRHOF for the metric of energy and successful receiving of data.

Structured Overlay Networks as an Enabler for Future Internet ServicesStrukturierte Overlay Netze als Wegbereiter für NGI Dienste

2009 ◽  
Vol 50 (6) ◽  
Author(s):  
Gerald Kunzmann ◽  
Andreas Binzenhöfer ◽  
Fabian Stäber
Keyword(s):  
User Experience ◽  
Technological Progress ◽  
Overlay Networks ◽  
Future Internet ◽  
Basic Principles ◽  
Internet Applications ◽  
Next Generation Internet ◽  
Powerful Means ◽  
Structured Overlay ◽  
Structured Overlay Networks

AbstractThe next generation Internet will not only be defined by its technological progress but also by innovative Internet applications which offer new features, more interactivity, and a better user experience. Structured overlay networks, which create a well-defined virtual topology above the basic transport network, are a powerful means to easily create such Internet applications. There are many different approaches to realize structured overlay networks which in their core functions share the same basic principles. In this work we summarize the fundamentals of structured overlay networks, describe their inherent problems, and present an overview of our solutions. We then show how all these ideas have been put into practice in terms of a distributed carrier grade communication platform.

scholarly journals A Node Virtualization Scheme for Structured Overlay Networks Based on Multiple Different Time Intervals

2020 ◽  
Vol 10 (23) ◽  
pp. 8596
Author(s):  
Tomoya Kawakami
Keyword(s):  
Overlay Networks ◽  
Previous Method ◽  
Sensor Data ◽  
Specific Time ◽  
Time Intervals ◽  
Structured Overlay ◽  
Physical Node ◽  
Simulation Results ◽  
Structured Overlay Networks ◽  
Computer Node

Sensor data which relate to the specific geographical positions, areas, and time are strongly expected in IoT. The author has studied overlay networks to efficiently process interval queries which have specific time intervals and the actual users tend to request. However, unfairness and a concentration of the loads occur for the specific processing computer (node) in the previous method because the density of data or those generators/providers is different from those related values. In this paper, the author proposes the enhanced scheme for structured overlay networks based on multiple different time intervals. The proposed method uses node virtualization to equalize the loads of each real (physical) node. The simulation results showed that the proposed method can increase the fairness of the number of the assigned data among physical nodes.

Continuous Join Query Processing over Structured Overlay Networks

2011 ◽  
Vol 467-469 ◽  
pp. 859-861
Author(s):  
Yang Liu ◽  
Ke Jun Zhao ◽  
Yi Hong Qiu ◽  
Qi Liu
Keyword(s):  
Query Processing ◽  
Network Traffic ◽  
Overlay Networks ◽  
Data Flow ◽  
P2p Network ◽  
Distributed Data ◽  
Structured Overlay ◽  
Structured Overlay Networks ◽  
Global Query ◽  
P2p Overlay

P2P network is more suitable for distributed data flow processing. This paper concentrates on how to answer continuous join query in structured p2p overlay networks. In the algorithm proposed, the data that cannot contribute the queries’ results will not be distributed in the network based on global query indices. Experiment shows that the algorithm ensures the availability of join query and network traffic is reduced.

scholarly journals THE RELAXED-RING: A FAULT-TOLERANT TOPOLOGY FOR STRUCTURED OVERLAY NETWORKS

2008 ◽  
Vol 18 (03) ◽  
pp. 411-432 ◽  
Author(s):  
BORIS MEJÍAS ◽  
PETER VAN ROY
Keyword(s):  
Fault Tolerance ◽  
Overlay Networks ◽  
Fault Tolerant ◽  
Ring Topology ◽  
Failure Handling ◽  
Periodic Maintenance ◽  
Structured Overlay ◽  
Structured Overlay Networks ◽  
Self Organizing

Fault-tolerance and lookup consistency are considered crucial properties for building applications on top of structured overlay networks. Many of these networks use the ring topology for the organization or their peers. The network must handle multiple joins, leaves and failures of peers while keeping the connection between every pair of successor-predecessor correct. This property makes the maintenance of the ring very costly and temporarily impossible to achieve, requiring periodic stabilization for fixing the ring. We introduce the relaxed-ring topology that does not rely on a perfect successor-predecessor relationship and it does not need a any periodic maintenance. Leaves and failures are considered as the same type of event providing a fault-tolerant and self-organizing maintenance of the ring. Relaxed-ring's limitations with respect to failure handling are formally identified, providing strong guarantees to develop applications on top of the architecture. Besides permanent failures, the paper analyses temporary failures and false suspicions caused by broken links, which are often ignored.

Churn handling strategies for structured overlay networks: A survey

2017 ◽  
Vol 13 (4) ◽  
pp. 331-351 ◽  
Author(s):  
Ramanpreet Kaur ◽  
Amrit Lal Sangal ◽  
Krishan Kumar
Keyword(s):  
Overlay Networks ◽  
Structured Overlay ◽  
Structured Overlay Networks
Sign in / Sign up

Export Citation Format

Share Document