作者: Ebad Ahmed , Aaron B. Wagner
关键词: Data compression 、 Peer-to-peer 、 Theoretical computer science 、 Computer science 、 Decoding methods 、 Source code 、 Erasure 、 Robustness (computer science)
摘要: We study the tradeoff between delay and partial reconstruction in peer-to-peer networks, i.e., number of messages a peer must obtain to reconstruct given fraction file. present coding scheme based on erasure compression Slepian-Wolf binning, which peers generate coded their current knowledge Assuming symmetric peers, we show that provides Pareto optimal reconstruction, characterize. In process proving result, establish an improved outer bound rate region general multi-terminal source problem. further case asymmetric is not optimal.