http://iet.metastore.ingenta.com
1887

Descriptive agent-based modeling of Kademlia peer-to-peer protocol

Descriptive agent-based modeling of Kademlia peer-to-peer protocol

For access to this article, please select a purchase option:

Buy chapter PDF
£10.00
(plus tax if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Modeling and Simulation of Complex Communication Networks — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The objective of writing this chapter is twofold. First, ABM model for the Kademlia is being proposed using complex networks-based and agent-based approaches combination. While developing the model of Kademlia, we will use the already developed complex networks like Line-walking Turtles, Communication-T-T network and Random Network. For validation purpose, we will present a hybrid routing algorithm based on centrality. By this, we can say that a communication has taken place end to end between users. Second, ODD and DREAM are two techniques that we have used for ABM specification. Then, we will also give a comparative analysis of ODD and DREAM. Some of our main contributions are as follows: To model and simulate Kademlia, an agent-based and complex network modeling approach is proposed. ODD specification technique for Kademlia's ABM model. DREAM specification technique for Kademlia's ABM model. An algorithm based on hybrid centrality measure. A comparative analysis of ODD and DREAM specification techniques.

Chapter Contents:

  • 10.1 Introduction
  • 10.2 Background and literature review
  • 10.2.1 Complex adaptive systems
  • 10.2.2 Cognitive agent-based computing
  • 10.2.3 Complex network modeling
  • 10.2.4 Architecture of the "Kademlia" protocol
  • 10.2.4.1 Introduction
  • 10.2.4.2 System description
  • 10.2.4.3 Distance calculation
  • 10.2.4.4 Node
  • 10.2.4.5 Protocol
  • 10.2.4.6 Node Look up
  • 10.2.4.7 Routing table
  • 10.2.5 Literature review
  • 10.3 Model design
  • 10.3.1 ODD model of "Kademlia"
  • 10.3.2 Overview
  • 10.3.3 Design concept
  • 10.3.4 Details
  • 10.3.5 Activity diagrams of "Kademlia"
  • 10.3.6 DREAM model of "Kademlia"
  • 10.3.7 Network model
  • 10.3.8 Pseudo-code description
  • 10.4 Results and discussion
  • 10.4.1 Evaluation metrics
  • 10.4.2 Power law plots of centrality measures
  • 10.4.3 PeerSim simulation using existing code in PeerSim
  • 10.4.4 ABM simulation
  • 10.4.4.1 Configuration
  • 10.4.4.2 Results
  • 10.4.5 Comparison of PeerSim and ABM results
  • 10.4.6 Discussion
  • 10.4.6.1 Comparison of ODD and DREAM
  • 10.4.6.2 Kademlia relation with theory of computation
  • 10.5 Conclusion and future work
  • References

Inspec keywords: complex networks; routing protocols; peer-to-peer computing

Other keywords: Communication-T-T network; DREAM modeling; DescRiptivEAgent-based Modeling; P2P protocol; Random Network; ODD modeling; complex networks; Overview, Design concepts and Details; hybrid routing algorithm; hybrid centrality measure; ABM model; descriptive agent-based modeling; Kademlia peer-to-peer protocol; distributed hash tables; Line-walking Turtles

Subjects: Internet software; Communication network design, planning and routing; Computer networks and techniques; Computer communications; Protocols; Protocols

Preview this chapter:
Zoom in
Zoomout

Descriptive agent-based modeling of Kademlia peer-to-peer protocol, Page 1 of 2

| /docserver/preview/fulltext/books/pc/pbpc018e/PBPC018E_ch10-1.gif /docserver/preview/fulltext/books/pc/pbpc018e/PBPC018E_ch10-2.gif

Related content

content/books/10.1049/pbpc018e_ch10
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address