Abstract | ||
---|---|---|
P2P DHT has fast become a rather "classical" research field. The currently popular mindsets are mostly routing-centric, or storage-centric. In this paper, we argue that it maybe more interesting to simply view DHT as a logical space that can dynamically size itself with potentially unlimited amount resources. This is in someway analogous to the virtual memory in any contemporary operating system. We believe that exploring such a perspective will bring about new insights as well as applications. We illustrate the power of this abstraction with a few examples, including self-scaling, self-healing fat tree, self-tune storage system, and a lightweight quorum-based distributed lock protocol which does not assume a constant number of members to start with. While their individual utilizations differ radically, all of them are united under this viewpoint. |
Year | DOI | Venue |
---|---|---|
2004 | 10.1109/FTDCS.2004.1316634 | FTDCS |
Keywords | Field | DocType |
logical space,self-healing fat tree,distributed lock protocol,self-tune storage system,tree data structures,dht,p2p,mass user adoption,good indication,self-scaling,lightweight quorum-based protocol,internet,distributed hash table,routing protocols,middleware,distributed processing,topology,jitter,operating system,optimization,robustness,virtual memory,distributed computing,storage system,scalability,routing | Middleware,Computer science,Virtual memory,Tree (data structure),Distributed lock manager,Theoretical computer science,Fat tree,Routing protocol,Scalability,Distributed computing,Distributed hash table | Conference |
ISSN | ISBN | Citations |
1071-0485 | 0-7695-2118-5 | 4 |
PageRank | References | Authors |
0.46 | 6 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Zheng Zhang | 1 | 1193 | 73.82 |