The mathematics of nonlinear programming
The mathematics of nonlinear programming
Virtual path bandwidth allocation in multiuser networks
IEEE/ACM Transactions on Networking (TON)
A game theoretic framework for bandwidth allocation and pricing in broadband networks
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pricing network edges for heterogeneous selfish users
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Stackelberg Scheduling Strategies
SIAM Journal on Computing
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A survey on networking games in telecommunications
Computers and Operations Research
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
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.