Journal of Information Processing Systems

  • 제10권4호
  • /
  • Pages.628-645
  • /
  • 2014
  • /
  • 1976-913X(pISSN)
  • /
  • 2092-805X(eISSN)
한국정보처리학회 (Korea Information Processing Society)
권호 표지
DOI QR코드

DOI QR Code

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

  • Cao, Qi (Department of Information Engineering, Hiroshima University) ;
  • Fujita, Satoshi (Department of Information Engineering, Hiroshima University)
  • 투고 : 2013.10.22
  • 심사 : 2014.03.03
  • 발행 : 2014.12.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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 of users' preferences regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has a great potential for alleviating this problem, existing schemes did not explicitly address it or incurred high cost. To overcome this issue, we propose, in this paper, an integrated solution that consists of three replication schemes to alleviate query load imbalance while minimizing the cost. The first scheme is an active index replication that is used in order to decrease routing load in the system and to distribute response load of an index among peers that store replicas of the index. The second scheme is a proactive pointer replication that places location information of each index to a predetermined number of peers for reducing maintenance cost between the index and its replicas. The third scheme is a passive index replication that guarantees the maximum query load of peers. The result of simulations indicates that the proposed schemes can help alleviate the query load imbalance of peers. Moreover, it was found by comparison that our schemes are more cost-effective on placing replicas than PCache and EAD.

키워드

참고문헌

  1. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: a scalable peer-to-peer lookup service for Internet applications," in Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM2001), San Diego, CA, 2001, pp. 149-160.
  2. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM2001), San Diego, CA, 2001, pp. 161-172.
  3. A. Rowstron and P. Druschel, "Pastry: scalable, decentralized object location, and routing for large- scale peer-to-peer systems," in Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms (Middleware2001), Heidelberg, Germany, 2001, pp. 329-350.
  4. B. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph, "Tapestry: an infrastructure for fault-tolerant widearea location and routing," Technical Report, University of California at Berkeley, CA, 2001.
  5. M. E. Newman, "Power laws, Pareto distributions and Zipf's law," Contemporary Physics, vol. 46, no. 5, pp. 323-351, 2005. https://doi.org/10.1080/00107510500052444
  6. V. Ramasubramanian and E. G. Sirer, "Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays," in Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI2004), Berkeley, CA, 2004, pp. 8-8.
  7. W. Rao, L. Chen, A. W. C. Fu, and G. Wang, "Optimal resource placement in structured peer-to-peer netwotks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 7, pp. 1011-1026, 2010. https://doi.org/10.1109/TPDS.2009.136
  8. H. Shen, "An efficient and adaptive decentralized file replication algorithm in P2P file sharing systems," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 6, pp. 827-840, 2010. https://doi.org/10.1109/TPDS.2009.127
  9. J. Zhou, X. Zhang, L. Bhuyan, and B. Liu, "Clustered K-center: effective replica placement in peer-to- peer systems," in Proceedings of the Global Communications Conference (GLOBECOM2007), Washington, DC, 2007, pp. 2008-2013.
  10. A. Ghodsi, L. O. Alima, and S. Haridi, "Symmetric replication for structured peer-to-peer systems," in Databases, Information Systems, and Peer-to-peer Computing. Heidelberg: Springer, 2005, pp. 74-85.
  11. F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "Wide-area cooperative storage with CFS," in Proceedings of the 18th ACM Symposium on Operating System Principles (SOSP2001), Banff, Canada, 2001, pp. 202-215.
  12. B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load balancing in dynamic structured P2P systems," in Proceedings of 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2004), Hong Kong, Chana, 2004, pp. 2253-2262.
  13. A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load balancing in structured P2P systems," in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS2003), Berkeley, CA, 2003, pp. 68-79.
  14. S. Rieche, L. Petrak, and K. Wehrle, "A thermal-dissipation-based approach for balancing data load in distributed hash tables," in Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks (LCN2004), Tampa, FL, 2004, pp. 15-23.
  15. D. R. Karger and M. Ruhl, "Simple efficient load balancing algorithms for peer-to-peer systems," in Proceedings of the 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA2004), Barcelona, Spain, 2004, pp. 36-43.
  16. J. Byers, J. Considine, and M. Mitzenmacher, "Simple load balancing for DHTs," in Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS2003), Berkeley, CA, 2003, pp. 80-87.
  17. S. Bianchi, S. Serbu, P. Felber, and P. Kropf, "Adaptive load balancing for DHT lookups," in Proceedings of 15th International Conference on Computer Communications and Networks (ICCCN200), Arlington, VA, 2006, pp. 411-418.
  18. H. Shen and C. Z. Xu, "Elastic routing table with provable performance for congestion control in DHT networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 2, pp. 242-256, 2010. https://doi.org/10.1109/TPDS.2009.51
  19. C. Harvesf and D. M. Blough, "Replica placement for route diversity in tree-based routing distributed hash tables," IEEE Transactions on Dependable and Secure Computing, vol. 8, no. 3, pp. 419-433, 2011. https://doi.org/10.1109/TDSC.2009.49
  20. Trellian, "Keyword and search engines statistics," http://www.keyworddiscovery.com/keywordstats.html.
  21. K. Shudo, Y. Tanaka, and S. Sekiguchi, "Overlay Weaver: an overlay construction tooikit," Computer Communications, vol. 31, no. 2, pp. 402-412, 2008. https://doi.org/10.1016/j.comcom.2007.08.002

피인용 문헌

  1. A shareable keyword search over encrypted data in cloud computing 2015, https://doi.org/10.1007/s11227-015-1515-8