Systematic procedure for improving continuity and latency on a P2P streaming protocol

This work proposes a new piece selection strategy for improving latency and continuity in a P2P streaming network. Different piece selection strategies based on a simple and symmetrical model for sharing are considered. It is well known the scalability properties of rarest first and low values of latency of greedy. In this work these techniques have been revised, and a new family of strategies is proposed. The richness of this family is expressed in the approximation strategy property, which shows that the shape of every feasible strategy can be approximated by one member of this family proposed. It is introduced a permutation finder algorithm, which looks for strategies inside this family that achieve a tradeoff between continuity and latency, not found in previous related works.