RootChord
We present a distributed data structure, which we call "RootChord". To our knowledge, this is the first distributed hash table which is able to adapt to changes in the size of the network and answer lookup queries within a guaranteed two hops while maintaining a routing table of size Thet...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/5117 |