Multipath Streaming Fundamental Limits and Efficient Algorithms

Richard Combes (1) , Habib Sidi (2) , Salah Eddine Elayoubi (3)

1 L2S - Laboratoire des signaux et systèmes
2 DYOGENE - Dynamics of Geometric Networks
3 Orange Labs [Issy les Moulineaux]

We investigate streaming over multiple links. We provide lower bounds on the starvation probability of any policy and simple, order-optimal policies with matching and tractable upper bounds ((1), (2)).

Domains: Automatic

Richard Combes, Habib Sidi, Salah Eddine Elayoubi. Multipath Streaming Fundamental Limits and Efficient Algorithms. 13th ACM SIGMETRICS/IFIP Performance Joint International Conference on Measurement and Modeling of Computer Science (ACM SIGMETRICS/IFIP), Jun 2016, Antibes, France. ⟨10.1145/2896377.2901485⟩. ⟨hal-02395031⟩