Data networks
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Incentives for Sharing in Peer-to-Peer Networks
WELCOM '01 Proceedings of the Second International Workshop on Electronic Commerce
Comparing economic incentives in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Internet economics: Pricing and policies
Bandwidth Trading in Unstructured P2P Content Distribution Networks
P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Sender-based resource allocation for multi-hop routing networks
SARNOFF'09 Proceedings of the 32nd international conference on Sarnoff symposium
Mesh-based peer-to-peer layered video streaming with taxation
Proceedings of the 20th international workshop on Network and operating systems support for digital audio and video
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Inter-domain pricing: challenges and possible approaches
International Journal of Network Management
Decentralized proactive resource allocation for maximizing throughput of P2P Grid
Journal of Parallel and Distributed Computing
Hi-index | 0.24 |
The first peer-to-peer (P2P) networks were based mainly on the altruistic behavior of the peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures a guaranteed service rate. This article is meant as a first step towards the development of P2P networks with guaranteed service rate. We propose a distributed resource allocation algorithm where peers control the service rates to their neighbors. This algorithm is based on the congestion pricing principle known from IP networks and ensures some form of fairness. Hence a peer gets a fair share of the resources available in the P2P network weighted by its contribution to the network. We study the convergence properties of the distributed algorithm and validate them by simulation. Further simulation results present the functionality of the algorithm in large and varying networks. The results indicate a fair allocation of the resources even when the service rates of some peers deteriorate due to errors.