A note on the data-driven capacity of P2P networks

Abstract—We consider two capacity problems,in P2P networks. In the first one, the nodes have an infinite amount of data to send and,the goal is to optimally,allocate their uplink,bandwidths such that the demands,of every peer in terms of receiving data rate are met. We solve this problem,through,a mapping,from,a node-weighted,graph,featuring two labels per node to a max,flow problem,on an edge-weighted bipartite graph. In the second prob- lem under consideration, the resource allocation is driven by the availability of the data resource,that the peers are interested in sharing. That is a node cannot,allocate its uplink resources unless it has data to transmit,first. The problem,of uplink,bandwidth allocation is then equivalent,to constructing,a set of directed