Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Comparative analysis of routing techniques in chord overlay network

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 11 No. 5 (2021)

DOI
10.11591/ijece.v11i5.pp4361-4372
ISSN
2722-2578, 2088-8708
Published
2021-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

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.

Collaboration network of the authors

22 authors · 67 co-authorship links · 3 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Covenant University
  • Kwara State University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Imhade Princess OkokpujieCovenant University5
Charles Uzoanya NdujiubaCovenant University5
Uzairue StanleyCovenant University3
Nsikan NkordehCovenant University3
Olatunji OkesolaCovenant University2
Emmanuel Chijioke ChukwuCovenant University2
Olamilekan ShobayoCovenant University2
Modupe OdusamiCovenant University2
Koto OmiloliCovenant University2
Oghorchukwuyem ObiaziCovenant University2
Ademola AbdulkareemCovenant University1
Tobiloba SomefunCovenant University1
Lambe Mutalub AdesinaKwara State University1
William A. Abdulateef-AdogaCovenant University1
Oghenetega C. OwivriCovenant University1
Adaora Princess IjehCovenant University1
Morayo E. AwomoyAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Comparative analysis of routing techniques in chord overlay network</dc:title><dc:creator>Osemwegie, Omoruyi</dc:creator><dc:creator>John, Samuel</dc:creator><dc:creator>Adeyinka, Adewale</dc:creator><dc:creator>Noma-Osaghae, Etinosa</dc:creator><dc:creator>Okokpujie, Kennedy</dc:creator><dc:description>&lt;jats:p&gt;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.&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2021-10-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v11i5.pp4361-4372</dc:identifier><dc:identifier>10.11591/ijece.v11i5.pp4361-4372</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 11 No 5 (2021); 4361</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/22763/15082</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>