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.
Index Terms
- Multipath Streaming: Fundamental Limits and Efficient Algorithms
Recommendations
Multipath Streaming: Fundamental Limits and Efficient Algorithms
Performance evaluation reviewWe 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.
Time Lower Bounds for Nonadaptive Turnstile Streaming Algorithms
STOC '15: Proceedings of the forty-seventh annual ACM symposium on Theory of ComputingWe say a turnstile streaming algorithm is {\em non-adaptive} if, during updates, the memory cells written and read depend only on the index being updated and random coins tossed at the beginning of the stream (and not on the memory contents of the ...
Using DASH Assisting Network Elements for Optimizing Video Streaming Quality
MM '17: Proceedings of the 25th ACM international conference on MultimediaOn-demand video streaming is a popular application which accounts for a large share of today's Internet traffic. Dynamic Adaptive Streaming over HTTP (DASH) is the major streaming technology used by large content providers. However, this technology ...
Comments