Many Peer-to-Peer (P2P) systems rely on cooperation among nodes that should be supported with incentives. Introducing ranks into P2P designs could reward cooperating nodes and increase overall system performance. In this paper, we consider the problem of P2P ranking. In a P2P resource sharing system (RSS), the ranks allow a node to decide which sources to keep locally, which external resources to download and through which nodes, what control to apply for transit resource requests, and how much quality of service (QoS) to provide. We introduce a mathematical model for local P2P resource ranking that optimizes these decisions. Complete proofs can be found in our technical report.
/lp/association-for-computing-machinery/a-local-equilibrium-model-for-p2p-resource-ranking-ZAwp86a0L6