Home
  • English
  • ÄŒeÅ¡tina
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • LatvieÅ¡u
  • Magyar
  • Nederlands
  • Português
  • Português do Brasil
  • Suomi
  • Log In
    New user? Click here to register. Have you forgotten your password?
Home
  • Browse Our Collections
  • Publications
  • Researchers
  • Research Data
  • Institutions
  • Statistics
    • English
    • ÄŒeÅ¡tina
    • Deutsch
    • Español
    • Français
    • Gàidhlig
    • LatvieÅ¡u
    • Magyar
    • Nederlands
    • Português
    • Português do Brasil
    • Suomi
    • Log In
      New user? Click here to register. Have you forgotten your password?
  1. Home
  2. Resources
  3. UniMAP Index Publications
  4. Publications 2019
  5. Routing performance of structured overlay in distributed hash tables (DHT) for P2P
 
Options

Routing performance of structured overlay in distributed hash tables (DHT) for P2P

Journal
Bulletin of Electrical Engineering and Informatics
ISSN
20893191
Date Issued
2019-06-01
Author(s)
Ruslan R.
Zailani A.S.M.
Zukri N.H.M.
Kamarudin N.K.
Elias S.J.
Ahmad R.B.
DOI
10.11591/eei.v8i2.1449
Handle (URI)
https://hdl.handle.net/20.500.14170/10841
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.
Funding(s)
Universiti Malaysia Perlis
Subjects
  • Chord | DHT | Kademli...

Thumbnail Image
google-scholar
Views
Downloads
  • About Us
  • Contact Us
  • Policies