I-Swifter: Improving chunked network coding for peer-to-peer content distribution

Abstract

Network coding has been proposed as a promising approach for peer-to-peer content distribution in recent literature. Not only reducing the average download time, but also improving resilience to peer churn has been showed as the benefits brought by network coding. State-of-the-art network coding content distribution systems perform network coding within segments or chunks, in order to reduce computational overhead. In our previous work (Xu et al. 2008), we proposed to schedule segment requests at a local-rarest-first basic. Local-rarest-first segment scheduling, as we demonstrated, is superior to the random scheduling. In this paper, we make a further step towards improving chunked network coding content distribution systems. We propose a requests reducer that reduces the overhead in control traffic and an encoding vectors reducer that eliminates the transmission of encoding vectors. Our contributions are to save unnecessary requests from downstream peers, and to reduce encoding vectors payload when the upstream peer owns the complete requested segment. This paper presents a realistic implementation, named I-Swifter. And we also make a comparative study on various related implementations. Experimental results show that there is about 10–20% of encoding vectors can be saved in I-Swifter. Moreover, I-Swifter improves average and maximum download time, the server load as well.