An Efficient Load Balancing Scheme for Resilient Search in KAD Peer to Peer Networks
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
764 | en_US |
dc.citation.spage |
759 | en_US |
dc.contributor.author |
Wu, Tai-Ting | en_US |
dc.contributor.author |
Wang, Kuochen | en_US |
dc.contributor.department |
資訊工程學系 | zh_TW |
dc.contributor.department |
Department of Computer Science | en_US |
dc.date.accessioned |
2014-12-08T15:20:49Z | |
dc.date.available |
2014-12-08T15:20:49Z | |
dc.date.issued |
2009 | en_US |
dc.description.abstract |
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. | en_US |
dc.identifier.isbn |
978-1-4244-5532-4 | en_US |
dc.identifier.journal |
2009 IEEE 9TH MALAYSIA INTERNATIONAL CONFERENCE ON COMMUNICATIONS (MICC) | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/14799 | |
dc.identifier.wosnumber |
WOS:000278114300143 | |
dc.language.iso |
en_US | en_US |
dc.subject |
Load balancing | en_US |
dc.subject |
KAD | en_US |
dc.subject |
peer to peer network | en_US |
dc.subject |
resilient search | en_US |
dc.title |
An Efficient Load Balancing Scheme for Resilient Search in KAD Peer to Peer Networks | en_US |
dc.type |
Article | en_US |
檔案
本條目沒有附加檔案。
所屬典藏: 會議論文
引用此條目
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
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/14799