Efficient Peer-to-Peer Interactive VoD Streaming using Interleaving Network Coding

msra

引用 23|浏览7
暂无评分
摘要
Although random access operations are desirable for peer-to-peer(P2P) on-demand video streaming, they are difficult to efficiently achieve, due to the asynchronous interactive behaviors of users and the dynamic nature of peers. In this paper, we propose an interleaving network coding distribution (INCD) scheme that can efficiently handle the interactive operations for P2P systems. In INCD, videos are divided into segments which are then further divided into blocks. These blocks are then encoded into independent encoding blocks that are distributed to the local storage of different peers. With INCD, a new client only needs to connect to a sufficient number of parent peers in order to view the whole video and rarely needs to find new parents when performing random access operations. Whereas current existing methods must search for specific parent peers containing interested segments with very high searching cost, INCD uses the properties of network coding to cache equivalent content on most peers, so that each parent peer can replace a left parent peer to serve child peers and thus reduce search cost significantly. Experimental results show that the proposed scheme achieves low startup and jumping searching delay, and short connecting to a new parent peer delay.
更多
查看译文
关键词
network coding,interactive operations,video-on-demand,peer-to-peer
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要