ReStream - A Replication Algorithm for Reliable and Scalable Multimedia Streaming

Multimedia consumption over the Internet is emerging as one of the largest sink of network resources, making scalable and reliable streaming increasingly challenging. To address this challenge, we propose ReStream, an adaptive replication algorithm that relies on replication to achieve reliable and scalable streaming in resource-constrained environments. Our algorithm dynamically adapts replica placement to maximize the number of consumers under latency and bandwidth constraints, while minimizing the number of replicas. In addition, ReStream supports partitioning, i.e., replicas can be located anywhere in the network and do not necessarily form a connected graph. This allows ReStream to yield the same performance in consumption models where consumers tend to be geographically co-located, as well as in consumption models where consumers placement is totally random.