In this work, we formulate and solve the selfish allocation problem in P2P file application. We design and analyze a strategy proof, feasible, VCG-based file allocation mechanism, which provides a new, promising direction in distributed algorithmic mechanism design on P2P file application. Our work is different from the previously studied researches in three ways that make it more accurately reflective of real world P2P allocation: (1) we treat the nodes as strategic agents and treat the replica allocation as a deliberate auction where node is incentivized to give his true quality of service for getting the replica, (2) our mechanism can achieve group strategy proof for all nodes, (3) we show how to compute our mechanism with a distributed algorithm that is a straightforward extension to P2P allocation method and finally we give simulations to illustrate great improvement in delay and throughput in P2P file application by our schema.
展开▼
