Open AccessComparative analysis of routing techniques in chord overlay network
Author(s) -
Osemwegie Omoruyi,
Samuel John,
A Adewale Adeyinka,
Etinosa NomaOsaghae,
Kennedy Okokpujie
Publication year - 2021
Publication title -
international journal of power electronics and drive systems/international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
eISSN - 2722-2578
pISSN - 2722-256X
DOI - 10.11591/ijece.v11i5.pp4361-4372
Subject(s) - computer science , computer network , distributed computing , dynamic source routing , static routing , chord (peer to peer) , policy based routing , successor cardinal , multipath routing , link state routing protocol , equal cost multi path routing , routing algorithm , routing (electronic design automation) , routing protocol , mathematical analysis , mathematics
Overlay networks are not a new field or area of study. This domain of computing will someday drive P2P systems in various application areas such as block-chain, energy trading, video multicasting, and distributed file storage. This study highlights the two widely known methods of routing information employed in one of such overlay networks called chord. In this study, simulations of both routing modes (iterative and recursive) and their variations under no-churn (leaving and joining of nodes) and churn conditions was carried out. The routing parameter (successor list size) was varied for each of the routing techniques in a simulation study. The results obtained show that semi recursive routing gives a better routing performance under churn scenarios.