Error-Resilient Routing for Supporting Multi-dimensional Range Query in HD Tree

Abstract

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.Index Terms-fault tolerance, error-resilient, distributed, data structure, HD Tree, peer-to-peer (P2P), overlay, associative searching, multi-dimensional, range query