Abstract
A fundamental issue in P2P networks is that of distributing workload in a balanced way to optimize performance. Unfortunately, optimal load balance is difficult to realize, although it is easy to compute, because participants of P2P networks are usually self-interested and seek to maximize their individual utility without considering system-wide utility. In this paper, we study the influence of selfish behaviors on the load balance in P2P networks, and propose a priority based load balancing scheme to help a P2P network achieve better performance. The scheme is simple and effective, and can be easily used in a P2P environment. Besides presenting the theoretical foundation of our scheme, we also address its major implementation issues and conduct extensive experiments to verify its effectiveness and practicality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Zhou, X., Nejdl, W. (2007). Priority Based Load Balancing in a Self-interested P2P Network. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, JH., Ouksel, A.M. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P DBISP2P 2006 2005. Lecture Notes in Computer Science, vol 4125. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71661-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-71661-7_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71660-0
Online ISBN: 978-3-540-71661-7
eBook Packages: Computer ScienceComputer Science (R0)