Distributed Resource Allocation for P2P Multicast Networks with Network Coding: Optimality, Delays, and Incentives

We consider a P2P multicast network with time- varying topology and node upload capacities. By utilizing network coding, we design a dynamic and distributed algorithm that can achieve arbitrarily close to maximum network utility while maintaining network stability. In addition, we show this algorithm can provide incentives for nodes to stay in the network and relay traffic for others even when they do not have interested contents.