An Efficient Decentralized Load Balancing Scheme in KAD Peer-to-Peer Networks
碩士 === 國立交通大學 === 網路工程研究所 === 98 === Kademlia (KAD) peer-to-peer (P2P) networks have become more and more popular. However, they have an unbalanced publish load problem. It causes a few peers to store a large number of indexes and these peers will become hotspots. Once become a hotspot, the peer mus...
Main Authors: | Hsu, Chung-Yuan, 徐崇騵 |
---|---|
Other Authors: | Wang, Kuo-Chen |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/88775959198943857488 |
Similar Items
-
A Load Balancing Scheme for Resilient Search in KAD Peer-to-Peer Networks
by: Wu, Tai-Ting, et al.
Published: (2009) -
A DNS-based Rapid Service Discovery for Decentralized Peer-to-Peer Networks with Load Balance
by: Phui-Si Gan, et al.
Published: (2006) -
A Load Balance Oriented Scheduling Scheme in a Hierarchal Peer-to-Peer Network
by: Hsiu-fang Chen, et al.
Published: (2008) -
A Study on Improving Search Efficiency and Load Balance in Peer-to-Peer Networks
by: Kai-Jun Yang, et al.
Published: (2007) -
Understanding Churn in Decentralized Peer-to-Peer Networks
by: Yao, Zhongmei
Published: (2010)