Multipath Streaming Fundamental Limits and Efficient Algorithms

Richard Combes; Habib Sidi; Salah Eddine Elayoubi

doi:10.1145/2896377.2901485

Conference papers

Multipath Streaming Fundamental Limits and Efficient Algorithms

Richard Combes ¹ Habib Sidi ² Salah Eddine Elayoubi ³

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

Domain :

Engineering Sciences [physics] / Automatic

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 : Tuesday, June 14, 2022 - 10:40:46 AM

Multipath Streaming Fundamental Limits and Efficient Algorithms

Identifiers

Collections

Citation

Export

Metrics

25

Multipath Streaming Fundamental Limits and Efficient Algorithms

Identifiers

Collections

Citation

Export

Share

Metrics

25