A proactive method for content distribution in a data indexed DHT overlay

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In a data-indexed DHT overlay network, published data annotations form distributed databases. Queries are distributed to these databases in a nonuniform way. Constructing content distribution networks for popular databases is effective for addressing the skew problem. However, various crucial replication decisions such as which data object should be replicated, how many replicas should be created and what replica placement policy should be used, may affect the performance of replication based content distribution and load balancing mechanisms in the presence of non-uniform data and access distribution. Particularly, the impact of the propagation speed of replicas on the performance of such type of overlay networks is not well studied. In this paper, a proactive method is given to tackle this problem. The method can adaptively adjust the number of replicas to create based on the changing demand. It works in a fully distributed manner. Our experiments show that the approach is able to adapt quickly to flash query crowds and improve the query service quality of the systems. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Alqaralleh, B. A., Wang, C., Zhou, B. B., & Zomaya, A. Y. (2007). A proactive method for content distribution in a data indexed DHT overlay. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4782 LNCS, pp. 599–610). Springer Verlag. https://doi.org/10.1007/978-3-540-75444-2_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free