FFT-based Network Coding For Peer-To-Peer Content Delivery
Alexandre Soro, Jerome Lacan

TL;DR
This paper introduces an FFT-based structured P2P network that enhances content delivery efficiency, robustness, and capacity by leveraging FFT graph topology and network coding, suitable for dynamic large-scale networks.
Contribution
It presents a novel FFT-based P2P architecture that combines structured topology with network coding for improved content distribution and robustness.
Findings
Achieves optimal content recovery capacity.
Provides robustness against network dynamics.
Ensures efficient content delivery with minimal complexity.
Abstract
In this paper, we propose a structured peer-to-peer (P2P) distribution scheme based on Fast Fourier Transform (FFT) graphs. We build a peer-to-peer network that reproduces the FFT graph initially designed for hardware FFT codecs. This topology allows content delivery with a maximum diversity level for a minimum global complexity. The resulting FFTbased network is a structured architecture with an adapted network coding that brings flexibility upon content distribution and robustness upon the dynamic nature of the network. This structure can achieve optimal capacity in terms of content recovery while solving the problem of last remaining blocks, even for large networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Full-Duplex Wireless Communications · Caching and Content Delivery
