HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Multipath Streaming Fundamental Limits and Efficient Algorithms

Richard Combes 1 Habib Sidi 2 Salah Elayoubi 3
1 L2S - Laboratoire des signaux et systèmes
2 DYOGENE - Dynamics of Geometric Networks
DI-ENS - Département d'informatique - ENS Paris, CNRS - Centre National de la Recherche Scientifique : UMR 8548, Inria de Paris
3 Orange Labs [Issy les Moulineaux]
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)).
Document type :
Conference papers
Complete list of metadata
https://hal-centralesupelec.archives-ouvertes.fr/hal-02395031
Contributor : Delphine Le Piolet Connect in order to contact the contributor
Submitted on : Thursday, December 5, 2019 - 10:58:43 AM
Last modification on : Thursday, March 17, 2022 - 10:08:54 AM

Identifiers

Collections

CENTRALESUPELEC | SUP_LSS | SUP_TELECOMS | INRIA | CNRS | UNIV-PARIS-SACLAY | TDS-MACS | ENS-PARIS | PSL | GS-COMPUTER-SCIENCE | GS-ENGINEERING | INRIA2

Citation

Richard Combes, Habib Sidi, Salah 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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

24