Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Load balancing and Poisson equation in a graph
Concurrency: Practice and Experience
Randomized algorithms
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Diffusive Load-Balancing Policies for Dynamic Applications
IEEE Concurrency
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Measurement, modeling, and analysis of a peer-to-peer file-sharing workload
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Computer Networks: The International Journal of Computer and Telecommunications Networking
Continuum modeling of large networks
International Journal of Numerical Modelling: Electronic Networks, Devices and Fields
A survey of load balancing in grid computing
CIS'04 Proceedings of the First international conference on Computational and Information Science
A survey and comparison of peer-to-peer overlay network schemes
IEEE Communications Surveys & Tutorials
Hi-index | 0.00 |
We propose a generalised diffusion-based file replication scheme for load balancing in unstructured P2P file-sharing networks. The generalised method is derived by replacing the replication probability of a peer used in our previous study with a new expression. In the previous expression, the replication probability is defined to be proportional to the difference between its own load and the average load of its neighbour peers. We show here that the replication probability can instead be expressed as a simple average of one defined to be negatively proportional to its own load and one defined to be proportional to the average load of its neighbour peers. The generalised method (a) includes the above three methods as special cases, (b) can control the trade-off between search and load balancing performances, (c) has a physical analogy to diffusion phenomena, and (d) achieves a good balance in the trade-off differently from our previous method.