Skip to main content
Log in

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

  • Published:
Peer-to-Peer Networking and Applications Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Xu J, Zhao J, Wang X, Xue X (2008) Swifter: Chunked network coding for peer-to-peer content distribution. In: Proc. IEEE int. conf. on commun., May

  2. Yang J, Ma H, Song W, Cui J, Zhou C (2006) Crawling the eDonkey network. In: Proc. int. conf. on grid and cooperative computing workshops

  3. Peterson RS, Sirer EG (2009) Antfarm: efficient content distribution with managed swarms. In: Proc. of the 6th USENIX symposium on networked systems design and implementation (NSDI’09), Berkeley, CA

  4. Qiu D, Srikant R (2004) Modeling and performance analysis of BitTorrent-like peer-to-peer networks. In: Proc. of the 2004 conference on applications, technologies, architectures, and protocols for computer communications (ACM SIGCOMM ’04), New York, NY

  5. Pouwelse J, Garbacki P, Epema D, Sips H (2005) The bittorrent P2P file-sharing system: measurements and analysis. Peer-to-Peer Systems IV, Lect Notes Comput Sci 3640:205–216

    Google Scholar 

  6. Ahlswede R, Cai N, Li SR, Yeung RW (2000) Network information flow. IEEE Trans Inf Theory 46(4):1204–1216

    Article  MathSciNet  MATH  Google Scholar 

  7. Niu D, Li BC (2007) On the resilience-complexity tradeoff of network coding in dynamic P2P networks. In: Proc. int. workshop on quality of service (IWQoS)

  8. Wang M, Li B (2006) How practical is network coding. In: Proc. int. workshop on quality of service (IWQoS), June

  9. Chou PA, Wu Y, Jain K (2003) Practical network coding. In: Proc. int. allerton conf. on commun., control, and computing

  10. Gkantsidis C, Miller J, Rodriguez P (2006) Anatomy of a P2P content distribution system with network coding. In: Proc. int. workshop on peer-to-peer systems (IPTPS)

  11. Bharambe AR, Herley C, Padmanabhan VN (2006) Analysing and improving bittorrent performance. In: Proc. IEEE INFOCOM conf., April

  12. Byers J, Considine J, Mitzenmacher M, Rost S (2002) Informed content delivery across adaptive overlay networks. In: Proc. ACM SIGCOMM conf., August

  13. Li SR, Yeung RW, Cai N (2003) Linear network coding. IEEE Trans Inf Theory 49:371

    Article  MathSciNet  MATH  Google Scholar 

  14. Ho T, Koetter R, Medard M, Karger D, Effros M (2003) The benefits of coding over routing in a randomized setting. In: Proc. int. symposium on inf. theory (ISIT)

  15. Gkantsidis C, Rodriguez P (2005) Network coding for large scale context distribution. In: Proc. IEEE INFOCOM conf., March

  16. Ma G, Xu Y, Lin M, Xuan Y (2007) A content distribution system based on sparse linear network coding. In: Proc. workshop on network coding, theory, and applications (NETCOD), January

  17. Shojania H, Li B (2007) Parallelized progressive network coding with hardware acceleration. In: Proc. int. workshop on quality of service (IWQoS), June

  18. Maymounkov P, Harvey NJA, Lun DS (2006) Methods for efficient network coding. In: Proc. int. allerton conf. on commun., control, and computing

  19. Cohen B (2003) Incentives build robustness in BitTorrent. In: Proc. workshop on economics of peer-to-peer systems, June

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xin Wang.

Additional information

This work is supported in part by 863 program of China under Grant No. 2009AA01A348, National Key S&T Project under Grant 2010ZX03003-003-03, and Shanghai Municipal R&D Foundation under Grant No. 09511501200.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, J., Wang, X., Zhao, J. et al. I-Swifter: Improving chunked network coding for peer-to-peer content distribution. Peer-to-Peer Netw. Appl. 5, 30–39 (2012). https://doi.org/10.1007/s12083-011-0105-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12083-011-0105-7

Keywords

Navigation