| Summary: | 碩士 === 國立臺灣科技大學 === 資訊工程系 === 92 === Abstract
In recent years, peer to peer (P2P) systems have become a burgeoning topic in large distributed system. Gnutella and Napster are the most famous peer-to-peer file sharing system among these, but both of them have its loading problem.
In structure P2P system, the identifier space is partitioned among the nodes and each node is in charge of the items that map into the same portion. Most P2P systems are using DHT (distributed hash table) abstraction as the main part to build P2P overlay network.Current distributed hash tables do not evenly partition the hash-function range; some machines get a larger portion of it. Thus, even if keys are numerous and random, some machine receive more than their fair share, by as much as a factor of O(log N) times the average.
In this paper we try to modify ASH+TS(LS) to adapt our load balancing problem in P2P network .In the latter experiments ,we will show that our scheme get better performance comparing with the many_to_many scheme both in load movement factor or number of rounds metrics.
|
|---|
