Download now Free registration required
In unstructured P2P content distribution systems, the most important algorithms to ensure optimal flow of content along multiple dynamically created distribution trees are piece selection algorithms and load balancing algorithms. This paper models practical load balancing algorithms and derive a number of insights. Peer-To-peer (P2P) content distribution, whether streaming or file downloading, relies on one or more (explicit or implicit) distribution trees from the source to all the receivers (peers). By distributing the content via multiple trees, all peers can contribute to the process which is the secret of why P2P systems scale.
- Format: PDF
- Size: 747.4 KB