Data networks
Algorithmic mechanism design (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Incentives for sharing in peer-to-peer networks
Proceedings of the 3rd ACM conference on Electronic Commerce
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
A reputation system for peer-to-peer networks
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
Pricing WiFi at Starbucks: issues in online mechanism design
Proceedings of the 4th ACM conference on Electronic commerce
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
An Incentive Mechanism for P2P Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
COPACC: An Architecture of Cooperative Proxy-Client Caching System for On-Demand Media Streaming
IEEE Transactions on Parallel and Distributed Systems
Automatic grid assembly by promoting collaboration in peer-to-peer grids
Journal of Parallel and Distributed Computing
Stochastic analysis of file-swarming systems
Performance Evaluation
On the Access Pricing and Network Scaling Issues of Wireless Mesh Networks
IEEE Transactions on Computers
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Mathematical modeling of incentive policies in p2p systems
Proceedings of the 3rd international workshop on Economics of networked systems
On cooperative settlement between content, transit and eyeball internet service providers
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
The design trade-offs of BitTorrent-like file sharing protocols
IEEE/ACM Transactions on Networking (TON)
Reward mechanisms for P2P VoIP networks
Information Technology and Management
P2P trading in social networks: the value of staying connected
INFOCOM'10 Proceedings of the 29th conference on Information communications
Pricing digital content distribution over heterogeneous channels
Decision Support Systems
Collusion in peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
On cooperative settlement between content, transit, and eyeball internet service providers
IEEE/ACM Transactions on Networking (TON)
Coordination of cooperation policies in a peer-to-peer system using swarm-based RL
Journal of Network and Computer Applications
A mathematical framework for analyzing adaptive incentive protocols in P2P networks
IEEE/ACM Transactions on Networking (TON)
International Journal of Communication Networks and Distributed Systems
COINS: COalitions and INcentiveS for effective Peer-to-Peer downloads
Journal of Network and Computer Applications
Future Generation Computer Systems
The evolution of cooperation in file sharing p2p systems: first steps
MICAI'12 Proceedings of the 11th Mexican international conference on Advances in Computational Intelligence - Volume Part II
On incentivizing upload capacity in P2P-VoD systems: Design, analysis and evaluation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Rating Protocols in Online Communities
ACM Transactions on Economics and Computation
| Hi-index | 0.00 |
Conventional peer-to-peer (P2P) networks do not provide service differentiation and incentive for users. Therefore, users can easily obtain information without themselves contributing any information or service to a P2P community. This leads to the well known free-riding problem. Consequently, most of the information requests are directed towards a small number of P2P nodes which are willing to share information or provide service, causing the "tragedy of the commons." The aim of this paper is to provide service differentiation in a P2P network based on the amount of services each node has provided to the network community. Since the differentiation is based on nodes' prior contributions, the nodes are encouraged to share information/services with each other. We first introduce a resource distribution mechanism for all the information sharing nodes. The mechanism is distributed in nature, has linear time complexity, and guarantees Pareto-optimal resource allocation. Second, we model the whole resource request/distribution process as a competition game between the competing nodes. We show that this game has a Nash equilibrium. To realize the game, we propose a protocol in which the competing nodes can interact with the information providing node to reach Nash equilibrium efficiently and dynamically. We also present a generalized incentive mechanism for nodes having heterogeneous utility functions. Convergence analysis of the competition game is carried out. Examples are used to illustrate that the incentive protocol provides service differentiation and can induce productive resource sharing by rational network nodes. Lastly, the incentive protocol is adaptive to node arrival and departure events, and to different forms of network congestion.