Home

MaidSafe-Routing wiki

• Build Instructions
• Documentation
• Testing-Tools
• Dashboard
• Code Standards

Description

A Kademlia-like Distributed Hash Table (DHT) with NAT Traversal that utilises Kademlia-like routing tables for scalability with D1HT speed. Used in conjunction with RUDP this library provides a very robust DHT implementation.

Features

• Support for Store and Delete operations
• Complete network reconfiguration in a time period from 20ms to 5 seconds maximum (as compared with 60 minutes for existing DHT's)
• Node Identification guaranteed via PKI provided by MaidSafe-Passport (no Spartacus attacks)
• Inbuilt machinery for rank system (remove misbehaving nodes)
• Asymmetric encryption provided node identification to prevent Sybil attacks
• Encrypted end to end communications
• Encrypted per hop communications (at RUDP level using different keys)
• 2^512 bit address space
• Opportunistic caching (i.e. resistant to any denial of service attack)
• Recursive algorithm, enabling simpler traversal of NAT routers
• Send/Ack system to ensure message is checked as forwarded at any node (with zero speed impact on sending)
• RUDP integration to provide resistance to 'man in the middle' attacks

Status

This library is considered BETA quality and is provided with a full test suite and QA suite. This can be considered for use in production quality systems.