Name
Abstract | ||
|---|---|---|
Distributed hash table (DHT) based overlay networks offer an administration-free and fault-tolerant storage space that maps "keys" to "values". For these systems to function efficiently, their structures must fit that of the underlying network. Existing techniques for discovering network proximity information, such as landmark clustering and expanding-ring search are either inaccurate or expensive. The lack of global proximity information in overlay construction and maintenance can result in bad proximity approximation or excessive communication. To address these problems, we propose the following: (1) Combining landmark clustering and round-trip time (RTT) measurements to generate proximity information, achieving both efficiency and accuracy. (2) Controlled placement of global proximity information on the system itself as soft-state, such that nodes can independently access relevant information efficiently. (3) Publish/subscribe functionality that allows nodes to subscribe to the relevant soft-state and get notified as the state changes necessitate overlay restructuring. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/ICDCS.2003.1203500 | international conference on distributed computing systems |
Keywords | Field | DocType |
proximity information,relevant information,global proximity information,landmark clustering,suchas landmark clustering,network proximity information,expanding-ring search,fault tolerant computing,relevant soft-state,topology-aware overlay network,network topology,round-trip time measurement,global soft-state,overlay network,distributed hash table,file organisation,state changesnecessitate overlay restructuring,fault-tolerant storage space,content-addressable storage,building topology-aware,globalproximity information,combining landmark clustering,distributed processing,global proximity informationin overlay,table lookup,publish subscribe,overlay,round trip time,soft state,control systems,fault tolerant,network protocol,routing,time measurement,internet,col,topology,fault tolerance | Computer science,Soft state,Computer network,Network topology,Fault tolerance,Content-addressable storage,Cluster analysis,Overlay,Overlay network,Distributed hash table,Distributed computing | Conference |
ISSN | ISBN | Citations |
1063-6927 | 0-7695-1920-2 | 114 |
PageRank | References | Authors |
5.47 | 16 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhichen Xu | 1 | 1057 | 66.72 |
| Chunqiang Tang | 2 | 1287 | 75.09 |
| Zheng Zhang | 3 | 114 | 5.47 |