Peer-to-Peer Distribution on Asymmetric Channels

We address the problem of incrementally constructing a peer-to-peer network distributing a content coming from a unique source by means of asymmetric channels. Criteria and algorithms to minimize either the source output bandwidth or the maximum delay suffered by peers are devised and characterized as far as performance and network features are concerned. We can also prove that, though we rely on a regular connectivity based on tiers, the performance of our algorithms is negligibly different from optimum.