Melola Discovery

← Melola Discovery

Jurnal SINTA 1

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

Bulletin of Electrical Engineering and Informatics · Vol. 8 No. 2 (2019) · hlm. 389–395

DOI
10.11591/eei.v8i2.1449
ISSN
2089-3191, 2302-9285
Terbit
2019-03-01
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en

Abstrak

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.

Kata kunci

Jaringan kolaborasi para penulis

29 penulis · 92 tautan kepenulisan bersama · 50 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universiti Teknologi MARA
  • Universiti Utara Malaysia
  • Daffodil International University
  • University of Technology Malaysia
  • Sultan Zainal Abidin University
  • Universiti Teknikal Malaysia Melaka
  • Universiti Tenaga Nasional
  • Organisasi lain
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Roshidi DinUniversiti Utara Malaysia3
Rosmadi BakarUniversiti Utara Malaysia3
Shahirah Mohamed HatimUniversiti Teknologi MARA3
Mohamad Yusof DarusUniversiti Teknologi MARA3
Md. Maruf HassanDaffodil International University2
Adam Wong Yoon KhangUniversiti Teknikal Malaysia Melaka2
Shapina AbdullahUniversiti Teknologi MARA2
Nur Anisah HassanUniversiti Teknologi MARA2
Lily Marlia Abdul LatifUniversiti Teknologi MARA2
Ahmad Zambri ShahuddinUniversiti Teknologi MARA2
Haryani HaronUniversiti Teknologi MARA1
Nor Shahniza Kamal BashahUniversiti Teknologi MARA1
Tonmoy GhoshDaffodil International University1
Sunariya UtamaUniversiti Utara Malaysia1
Jamaluddin JasmisUniversiti Teknologi MARA1
Norashidah Md DinUniversiti Tenaga Nasional1
Ashrafia EshaDaffodil International University1
Rafika RishaDaffodil International University1
Mohammad Shahidul HasanUniversity of Staffordshire1
Nadiatulhuda ZulkifliUniversity of Technology Malaysia1
Jaysuman PusppanathanUniversity of Technology Malaysia1
Nur Hamidah Abdul HalimUniversiti Malaysia Perlis1
Raihan Sabirah SabriUniversiti Utara Malaysia1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<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 xml:lang="en">Routing performance of structured overlay in Distributed Hash Tables (DHT) for P2P</dc:title><dc:creator>Rafiza Ruslan</dc:creator><dc:creator>Ayu Shaqirra Mohd Zailani</dc:creator><dc:creator>Nurul Hidayah Mohd Zukri</dc:creator><dc:creator>Nur Khairani Kamarudin</dc:creator><dc:creator>Shamsul Jamel Elias</dc:creator><dc:creator>R. Badlishah Ahmad</dc:creator><dc:subject>structured overlay networks</dc:subject><dc:subject>distributed hash tables</dc:subject><dc:subject>peer-to-peer networks</dc:subject><dc:subject>routing performance</dc:subject><dc:subject>chords</dc:subject><dc:subject>pastry</dc:subject><dc:subject>Kademlia</dc:subject><dc:subject>lookup latency</dc:subject><dc:subject>routing efficiency</dc:subject><dc:description xml:lang="en">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.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2019-03-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/eei.v8i2.1449</dc:identifier><dc:identifier>10.11591/eei.v8i2.1449</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 8 No 2 (2019); 389-395</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>http://beei.org/index.php/EEI/article/download/1449/1044</dc:relation></oai_dc:dc>