An Efficient Load Balancing Scheme for Resilient Search in KAD Peer to Peer Networks

檔案

本條目沒有附加檔案。

日期

2009

期刊名稱

2009 IEEE 9TH MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS (MICC)

摘要

In this paper, we propose an efficient multiple hashes method (called KAD-N) to balance peer loads in the KAD (Kademlia) network. Note that N is the maximum hash times, determining by a cost-effectiveness factor. This method hashes the keyword of an object r times to produce a key for publishing objects, where r is a random number and 1 <= r <= N. Simulation results show that the distribution of indexes is more balanced using the proposed KAD-N method. We found out that N = 7 (KAD-7) is the optimal setting in our simulation environment. We used a standard deviation to evaluate the proposed load balancing method. Simulation results also show that KAD-7 has the search hit rate close to 100% and the standard deviation is 44% less than that of the KAD (i.e., KAD-1), which means the proposed method is more load balancing than the KAD. However, KAD-7 has 7% extra traffic overhead. By increasing the search hit rate, KAD-N improves the search resilience of KAD networks with failed peers. Furthermore, the proposed KAD-N method can easily be extended to other DHT-based P2P networks.

所屬典藏

會議論文
顯示完整詮釋資料 統計資料

引用此條目

Wu, T.-T., & Wang, K. (2009). An Efficient Load Balancing Scheme for Resilient Search in KAD Peer to Peer Networks. 2009 IEEE 9TH MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS (MICC), 759–764. https://ir.lib.nycu.edu.tw/handle/11536/14799

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/14799