Multipath Streaming Fundamental Limits and Efficient Algorithms - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Multipath Streaming Fundamental Limits and Efficient Algorithms

(1) , (2) , (3)
1
2
3

Abstract

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)).
Not file

Dates and versions

hal-02395031 , version 1 (05-12-2019)

Identifiers

Cite

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⟩
25 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More