期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2011
卷号：2
期号：2(Version 1)
出版社：Ayushmaan Technologies
摘要：Application-layer peer-to-peer (P2P) networks are considered to be the path break in the Internet infrastructure. Load balancing among the peers is critical for these systems to be effective. Most structured P2P systems rely on ID-space partitioning schemes to solve the load imbalance problem. Our focus is on an important issue vital to the performance in the virtual server framework, such as the effect of the number of directories employed in the system and the performance ramification of user registration strategies. We systematically characterize the effect of heterogeneity on load balancing algorithm called as dual-space localsearch (DSLS) and the conditions in which heterogeneity may be easy or hard to deal with based on an extensive study of a wide spectrum of load and capacity scenarios. A fundamental problem that confronts peerto- peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses Load balancing problem.search
关键词：load balance; structured Peer-peer system; dual space local search;algorithm.
