The Server Reassignment Problem for Load Balancing in Structured P2P Systems

Load Balancing in Structureed P2P Systems Using Server Reassignment Technique

“…In [1] focus on the notion of VS's is mostly based on [3], whose explicit definition and use for load balance were first proposed by Rao et al [5]. In [5] author introduce several load balancing algorithms, including many-to-many with dislodge (called M2M in this paper) and M2M without dislodge (called DM2M), based on the assistance of a new type of peer node, called directory.…”

“…Both neighborhoods are searched using a single cost function, making no distinction between feasible and infeasible solutions. • The fundamental insight in [1] is on need of more focused definition of the neighborhood search spaces for the local search. • The authors in [1] proposes to classify the search spaces into two types using dual-pace local search algorithm and develop a corresponding search strategy as an effective approach to tackle the problem.…”

“…• The concept is applicable to many types of resources such as storage, CPU processing time, bandwidth, etc. The major contribution in [1] is to derive an effective server reassignment algorithm for the solution of the load balance problem and address issues as:…”

Load Balancing in Structured P2P Systems using Server Reassignment Technique

“…To resolve the above problems, approach on the virtual server (VS) i.e. called as a migration-based approach to load balancing is focused in [1], which helps to under load the overloaded physical node by moving portions of the load dynamically. A VS acts as a peer in the original DHT architecture which is responsible for a zone, but each physical node may be associated with several VS's.…”

“…The major contribution in [1] is to derive an effective server reassignment algorithm for the solution of the load balance problem and address issues as:…”