Distributed Hash Tables.ppt

Distributed Hash Tables David Tam Patrick Pang Presentation Outline What is DHT (Distributed Hash Table)? Why DHTs? Applications How lookup works? Alternatives to DHTs Performance – Routing Performance – Load Balancing Security – Routing Attack Security – Inconsistent Behaviour Comparison to Other Facilities Current Research Projects Conclusion What is DHT? Why DHTs? Applications How lookup works? Alternatives to DHTs Performance -- Lookup Performance -- Load Balancing Security – Incorrect Lookup (1) Security – Inconsistent Behaviour Comparison to Other Facilities Research Projects Summary References * Distributed hash table Distributed application get (key) data node node node …. put(key, data) (Figure adopted from Frans Kaashoek) DHT provides the information look up service for P2P applications. Nodes uniformly distributed across key space Nodes form an overlay network Nodes maintain list of neighbours in routing table Decoupled from physical network topology Why Do We Need DHTs? Simplifies the development for large-scale distributed Apps Better security and robustness Simple API Exploits P2P resources Why Middleware? Simplifies the development for large-scale distributed Apps Better security and robustness Simple API Anything that requires a hash table Databases, FSes, storage, archival Web serving, caching Content distribution Query indexing Naming systems Communication primitives Chat services Application-layer multi-casting Event notification services Publish/subscribe systems ? 2 14 12 10 7 5 0 3 4 6 8 9 11 13 10 [10,2) 10 7 [6,10) 6 5 [4,6) 4 5 [3,4) 3 succ. interval start Finger Table for Node 2 15 1 Example: Chord [Stoica et. al.] How lookup works? 2 14 12 10 7 5 0 3 4 6 8 9 11 13 15 2 [2,10) 2 14 [14,2) 14 12 [12,14) 12 12 [11,12) 11 succ. interval start Finger Table for Node 10 1 Example: Chord How lookup works? 2 14 12 10 7 5 0 3 4 6 8 9 11 13 15 2 [2,10) 2 14 [14,2) 14 12 [12,14) 12 12 [11,12) 11 succ. interval start Finger Ta