Multipath Streaming: Fundamental Limits And Efficient Algorithms

Abstract

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.