Plan-X: Peer-to-Peer Routing for Persistent Storage
Overview
The general goal of this project is to investigate and analyze existing peer-to-peer routing algorithms for dynamic wide-area networks and to implement a routing algorithm suitable for XML Store. Peer-to-peer routing algorithms essentially provide a distributed and scalable mapping of keys to values.
An adapted version of the Kademlia routing algorithm has been implemented. An improved scheme for ensuring availability of the key-value pairs stored is presented. The scheme improves the best-case performance from O(M) messages per hour to O(N) messages per hour, where M is the total number of key-value pairs in a network of N peers. The worst-case performance is still O(M) messages, but it is argued that the average performance is closer to the best-case than the worst-case.
Paper
- Peer-to-Peer Routing for Persistent Storage (ps.gz)
Software
- routing.jar (source code and compiled code)
People
tsa)