HD Tree: A novel data structure to support multi-dimensional range query for P2P networks

Gu, Yaxu; Boukerche, Azzedine

doi:10.1016/j.jpdc.2011.04.003

Cited by 12 publications

(12 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to , the average case time complexity of distributed routing in the ideal routing environment can be computed as follows:

italic T_{avg} MathClass-open(DR MathClass-close) ⩽2d - \frac{2}{k - 1} + \frac{2}{k^{d} MathClass-open(k - 1 MathClass-close)} .

…”

Section: Previous Related Workmentioning

confidence: 99%

“…According to , the time complexity of DROCR in the ideal routing environment can be computed as follows:

italic T MathClass-open(DROCR MathClass-close) = d_{SRC} + d_{DST} - 2m

…”

Section: Previous Related Workmentioning

confidence: 99%

“…According to [41], the average case time complexity of distributed routing in the ideal routing environment can be computed as follows:…”

Section: Basic Distributed Operationsmentioning

confidence: 99%

“…If no match exists, there are at least two routing options: a D2H operation starting from the left-most side of the destination code and an H2D operation starting from the right-most side of the destination code (shown in Figure 5). According to [41], the time complexity of DROCR in the ideal routing environment can be computed as follows:…”

Section: Basic Routing Mechanismmentioning

confidence: 99%

See 3 more Smart Citations

Supporting multidimensional range queries in Hierarchically Distributed Tree

Boukerche

Grande

2013

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

SUMMARYAn examination of the multidimensional range query in existing peer-to-peer (P2P) overlay networks indicates that multidimensional range queries are sensitive to underlying topologies; this is because partitioning and mapping of multidimensional data space are two interconnected parts of a process that must be carried out cooperatively. The first section focuses on how to preserve data localities, whereas the second section concerns how to accommodate and maintain data localities at the P2P overlay layer. There are many studies that have been conducted on the first section since 1966, and those works that are well accepted are mostly based on recursive decomposition, which forms a tree structure in nature. However, less effort has been made to provide comparable support from the P2P overlay layer. In our previous work, we proposed the Hierarchically Distributed Tree (HD Tree) in order to better support multidimensional range queries in the P2P overlay network. This paper further explores error-resilient routing and load balancing strategies that can be employed in the HD Tree. We also provide a complete set of experimental results for all routing operations: Join and Leave of nodes, range queries at different levels of selectivity, and the dynamic load balancing scheme. Comparisons are made by conducting simulations under both the ideal and the error-prone routing environment and within various ary HD Trees. The experimental results show that load balancing in the HD Tree can be adjusted dynamically and globally, and it is actually a trade-off between distributing the basic load and the involvement of nodes in range querying. The experimental results also indicate that a maximum of 10 percent of routing nodes' failures do not have significant effects on the performance of range queries. However, a lower ary HD Tree appears to have better routing performance, whereas a higher ary HD Tree achieves a higher fault-tolerant capacity. Nevertheless, the performance of range queries in a higher ary HD Tree can be further optimized if all possible routing options can be fully explored in the error-prone routing environment.

show abstract

“…According to , the average case time complexity of distributed routing in the ideal routing environment can be computed as follows:

italic T_{avg} MathClass-open(DR MathClass-close) ⩽2d - \frac{2}{k - 1} + \frac{2}{k^{d} MathClass-open(k - 1 MathClass-close)} .

…”

Section: Previous Related Workmentioning

confidence: 99%

“…According to , the time complexity of DROCR in the ideal routing environment can be computed as follows:

italic T MathClass-open(DROCR MathClass-close) = d_{SRC} + d_{DST} - 2m

…”

Section: Previous Related Workmentioning

confidence: 99%

“…According to [41], the average case time complexity of distributed routing in the ideal routing environment can be computed as follows:…”

Section: Basic Distributed Operationsmentioning

confidence: 99%

Section: Basic Routing Mechanismmentioning

confidence: 99%

See 2 more Smart Citations

Supporting multidimensional range queries in Hierarchically Distributed Tree

Boukerche

Grande

2013

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

show abstract

“…P2P applications distribute their data over several nodes. Storage and retrieval of information by maintaining and storing indexes from this large distributed data space is a non-trivial issue [30]. In the P2P computing infrastructure, the pool of computers providing storage and processing is dynamic and often may not be under the control of the organization.…”

Section: Performancementioning

confidence: 99%

P2P Business Applications: Future and Directions

Pankaj¹,

Hyde²,

Rodger³

2012

View full text Add to dashboard Cite

Since the launch of Napster in June 1999, peer-to-peer technology (P2P) has become synonymous with file sharing applications that are the bane of the recording industry due to copyright infringements and consequent revenue losses. P2P promised a revolution in business computing which has not arrived. It has become synonymous with illegal file sharing and copyright violations. Meanwhile the information systems industry has undergone a paradigm change, and we are supposedly living in a world of cloud computing and mobile devices. It is pertinent to examine if P2P, as a revolutionary technology, is still relevant and important today and will be in future. One has to examine this question in the context of the fact that P2P technologies have matured but have however had limited adoption outside file sharing in the consumer space. This paper provides a detailed analysis of P2P computing and offers some propositions to answer the question of the relevancy of P2P. It is proposed that P2P is still a relevant technology but may be reshaped in the coming years in a different form as compared to what exists today

show abstract