View source for User:RyanT5000/DHT

=== First Layer: Messaging system ===
* Problem: don't know network topology; can't use Pastry-style routing, because we can't know when we're making progress
** This is the most difficult challenge; we need a heuristic that will tend to result in progress
*** Heuristic should perhaps be replaceable in updates
**** We might want to send statistics to OLPC to verify (better than a simulator)
** Need to store a large routing table at each node
*** But, space concerns
**** Gzip
**** [http://theory.csail.mit.edu/~edemaine/ Demaine's zero-overhead hash table storage algorithm]
*** Some nodes (e.g. school servers) can store very large tables
* Problem: trust model - what about people sharing falsified routing information?
** Probably don't need to worry about this yet; backburner
* Problem: fairness - want to make sure no individual can hog the network resources
** 1st iteration: No checking
** 2nd iteration: checking on each node
** 3rd iteration: perhaps some kind of reputation/points system