Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches


Qi Cao, Satoshi Fujita, Journal of Information Processing Systems Vol. 10, No. 4, pp. 628-645, Dec. 2014  

https://doi.org/10.3745/JIPS.03.0020
Keywords: DHT, Load Balancing, Load Reduction, Multi-Keyword Search, Replication
Fulltext:

Abstract

In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness o


Statistics
Show / Hide Statistics

Statistics (Past 3 Years)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.




Cite this article
[APA Style]
Cao, Q. & Fujita, S. (2014). Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches. Journal of Information Processing Systems, 10(4), 628-645. DOI: 10.3745/JIPS.03.0020.

[IEEE Style]
Q. Cao and S. Fujita, "Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches," Journal of Information Processing Systems, vol. 10, no. 4, pp. 628-645, 2014. DOI: 10.3745/JIPS.03.0020.

[ACM Style]
Qi Cao and Satoshi Fujita. 2014. Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches. Journal of Information Processing Systems, 10, 4, (2014), 628-645. DOI: 10.3745/JIPS.03.0020.