Comparative analysis of routing techniques in chord overlay network

Omoruyi Osemwegie, Samuel John, Adewale Adeyinka, Etinosa Noma-Osaghae, Kennedy Okokpujie


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 network 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.


churn; iterative routing; recursive routing; structured overlay networks


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

International Journal of Electrical and Computer Engineering (IJECE)
p-ISSN 2088-8708, e-ISSN 2722-2578