Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
oaioai:ojs.portalgaruda.org:article/1786

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

Authors
Publication date
1 June 2019
Publisher
'Institute of Advanced Engineering and Science'
Doi

    Abstract

    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

    Similar works

    Full text

    thumbnail-image

    Bulletin of Electrical Engineering and Informatics

    redirect
    oaioai:ojs.portalgaruda.org:artic...
    Last time updated on 05/04/2020

    This paper was published in Bulletin of Electrical Engineering and Informatics.

    Having an issue?

    Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.