Scalable Information Systems. 4th International ICST Conference, INFOSCALE 2009, Hong Kong, June 10-11, 2009, Revised Selected Papers

Research Article

Tuning Performance of P2P Mesh Streaming System Using a Network Evolution Approach

Download357 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-10485-5_10,
        author={Rui Wang and Depei Qian and Danfeng Zhu and Qinglin Zhu and Zhongzhi Luan},
        title={Tuning Performance of P2P Mesh Streaming System Using a Network Evolution Approach},
        proceedings={Scalable Information Systems. 4th International ICST Conference, INFOSCALE 2009, Hong Kong, June 10-11, 2009, Revised Selected Papers},
        proceedings_a={INFOSCALE},
        year={2012},
        month={5},
        keywords={P2P Streaming Mesh Redundant Coding Churn},
        doi={10.1007/978-3-642-10485-5_10}
    }
    
  • Rui Wang
    Depei Qian
    Danfeng Zhu
    Qinglin Zhu
    Zhongzhi Luan
    Year: 2012
    Tuning Performance of P2P Mesh Streaming System Using a Network Evolution Approach
    INFOSCALE
    Springer
    DOI: 10.1007/978-3-642-10485-5_10
Rui Wang1,*, Depei Qian1,*, Danfeng Zhu1,*, Qinglin Zhu1,*, Zhongzhi Luan1,*
  • 1: Beihang University
*Contact email: rui.wang@jsi.buaa.edu.cn, depei.qian@jsi.buaa.edu.cn, danfeng.zhu@jsi.buaa.edu.cn, qinglin.zhu@jsi.buaa.edu.cn, zhongzhi.luan@jsi.buaa.edu.cn

Abstract

Resilience and startup delay are the most important performance metrics to evaluate the P2P streaming systems. To simultaneously improve the two metrics, we propose several mechanisms at different system evolution stages. At the first stage, media server encodes the stream into multiple sub-streams of the same length. Redundancy is introduced by using Reed-Solomon (RS) coding before distributing the sub-streams to different successors. Each peer in the network establishes a cooperative relationship with others to obtain all required sub-streams. At the stage of new peer arrival, a parent selection algorithm with relatively lower complexity is proposed which takes full advantage of redundant coding. After the peer builds up streaming transmission, it replaces some parents with a latency-based decision mechanism. In case of node failure, a swap-in-turn repairing algorithm between different sub-stream sources is proposed to ensure the high continuity of steaming transmission. Simulation results show that 1) the redundant coding and the parent replace algorithm in case of node failure can effectively reduce interruption of data streams; 2) the codes with higher redundant degree can adapt to more dynamic scenario. Meanwhile, the codes with redundancy does not significantly decrease the effective transmission ratio when network is dynamic; 3) transmission achieves higher performance when the number of substreams is between 8 and 16; and 4) the parent switching mechanism can significantly decrease the startup latency for a big proportion of peers.