jashmenn / chordjerl

An Erlang implementation of the Chord distributed hash lookup protocol

This URL has Read+Write access

tweak to client
jashmenn (author)
Tue Jan 20 18:07:51 -0800 2009
commit  f886c6074354bc5774df8efd62c7ed905ab30411
tree    6180e72ee4e56461afa3c5662903c6982d3a26a8
parent  f6892ae7465efd9fff9b516c61bdfde9e8ddfb15
name age
history
message
file .gitignore Loading commit data...
file README.md
file Rakefile
file chordjerl.pub Fri Jan 16 22:29:50 -0800 2009 added .pub file [jashmenn]
directory doc/
directory include/
directory priv/
directory src/
directory test/
README.md

Chordjerl

The goal of Chordjerl (pronounced: cordial) is to be an reusable Erlang implementation of the Chord distrubuted key lookup protocol.

Chord

Chord is a lookup protocol for efficient location of a node that stores a desired data item in a decentralized, peer-to-peer system. The Chord algorithm provides the foundation for a reliable, efficient, scalable decentralized distributed hash.

Chord provides support for just one operation: given a key, it maps the key onto a node.

You can read more about Chord in the paper from Stoica et al. "Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications" (http://pdos.csail.mit.edu/papers/ton:chord/paper-ton.pdf)

Status ======

Planning stages

(Planned) Features

  • Virtual Nodes
  • Behavior module to help implement the value store
  • Optional extensions to routing algorithm/finger table such as node uptime, network latency, etc.
  • Support for LAN or WAN use