arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1602.07112cs.NIcs.ITmath.IT
收藏

多路径流:基本限制和有效算法

Multipath streaming: fundamental limits and efficient algorithms

Richard Combes, Habib Sidi, Salah-Eddine Elayoubi

摘要:

我们调查流在多个链接。一个文件被分割成称为块的小单元,这些小单元可以根据某些策略在各个链路上被请求,并在一些随机延迟后被接收。在称为预缓冲时间的启动待用时间之后,以固定速度播放接收到的块。如果要播放的块尚未到达,则存在饥饿。我们提供了任何政策的饥饿概率的下限(基本限制)。我们进一步提出了简单的,订单最优的政策,不需要反馈。对于一般的延迟分布,我们提供了易于处理的上限饥饿概率的建议政策,允许选择适当的预缓冲时间。我们专注于我们的结果:(i)在分组级采用CSMA或机会调度的链路,(ii)与主用户共享的链路,(iii)在流级使用公平速率共享的链路。我们认为一个通用的模型,使我们的研究结果提供洞察媒体流的设计和性能(a)有线网络与源和目的地之间的几条路径,(b)无线网络具有频谱聚合和(c)多归属无线网络。

英文摘要:

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: (i) links that employ CSMA or opportunistic scheduling at the packet level, (ii) links shared with a primary user (iii) 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 performance of media streaming over (a) wired networks with several paths between the source and destination, (b) wireless networks featuring spectrum aggregation and (c) multi-homed wireless networks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑