Algorithms and Stability Analysis for Content Distribution Over Multiple Multicast Trees
The paper investigates theoretical issues in applying the universal swarming technique to efficient content distribution. In a swarming session, a file is distributed to all the receivers by having all the nodes in the session exchange file chunks. By universal swarming, not only all the nodes in the session, but also some nodes outside the session may participate in the chunk exchange to improve the distribution performance. The authors present a universal swarming model where the chunks are distributed along different Steiner trees rooted at the source and covering all the receivers. They assume chunks arrive dynamically at the sources and focus on finding stable universal swarming algorithms.