.png){kind=icon}
返回
Multipath Streaming: Fundamental Limits and Efficient Algorithms
.png){kind=icon}
OA
AI
DOI：10.1109/JSAC.2016.2633065.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We investigate streaming over multiple links. A file is split into small units called chunks that may be requested on the various links according to some policy and received after some random delay. After a start-up time called pre-buffering time, received chunks are played at a fixed speed. There is starvation if the chunk to be played has not yet arrived. We provide lower bounds (fundamental limits) on the starvation probability of any policy. We further propose simple, order-optimal policies that require no feedback. For general delay distributions, we provide tractable upper bounds for the starvation probability of the proposed policies, allowing to select the pre-buffering time appropriately. We specialize our results to: 1) links that employ Carrier Sense Multiple Access (CSMA) or opportunistic scheduling at the packet level; 2) links shared with a primary user; and 3) links that use fair rate sharing at the flow level. We consider a generic model, so that our results give insight into the design and the performance of media streaming over: 1) wired networks with several paths between the source and the destination; 2) wireless networks featuring spectrum aggregation; and 3) multi-homed wireless networks.
Keyword:
Streaming media
communication networks
wireless communication
quality of service
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
17.2
论文数:
6.4K
被引数:
3.1W
机构
引用论文
.png){kind=icon}
查看更多内容