Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Flexible Information Discovery in Decentralized Distributed Systems
HPDC '03 Proceedings of the 12th IEEE International Symposium on High Performance Distributed Computing
P-Grid: a self-organizing structured P2P system
ACM SIGMOD Record
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Mercury: supporting scalable multi-attribute range queries
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
BATON: a balanced tree structure for peer-to-peer networks
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Supporting Multi-Dimensional Range Queries in Peer-to-Peer Systems
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Supporting Multi-dimensional Range Query in HD Tree
DS-RT '10 Proceedings of the 2010 IEEE/ACM 14th International Symposium on Distributed Simulation and Real Time Applications
Spurring adoption of DHTs with openhash, a public DHT service
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
A structured overlay for multi-dimensional range queries
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Towards Robust Routing in HD Tree
DS-RT '12 Proceedings of the 2012 IEEE/ACM 16th International Symposium on Distributed Simulation and Real Time Applications
Hi-index | 0.00 |
The Hierarchically Distributed Tree (HD Tree) is a novel distributed data structure built over a complete tree. The purpose of proposing this new data structure is to better support multi-dimensional range query in the distributed environment. HD Tree doubles the number of neighbors at the cost of doubling total links of a tree. The routing operation in HD Tree is supposed to be highly error-resilient. In HD Tree, the routing table size is determined by the system parameter k, and the performance of all basic operations are bound by O(lg(n)). Multiple routing options can be found between any two nodes in the system. This paper explores fault tolerant routing strategies in HD Tree. The experimental results produce very limited and unnoticeable increases in routing cost when conducting range queries in an error-prone routing environment. The maximum failures we have tested are about 5 percent of routing nodes. The experimental results also indicate that higher fault tolerant capability requires finer consideration in the design of the error-resilient routing strategy.