Optimal Delay-Reconstruction Tradeoffs in Peer-to-Peer Networks

作者: Ebad Ahmed , Aaron B. Wagner

DOI: 10.1109/JSAC.2011.110515

关键词: Data compressionPeer-to-peerTheoretical computer scienceComputer scienceDecoding methodsSource codeErasureRobustness (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.

参考文章(35)
S.S. Pradhan, R. Puri, K. Ramchandran, n-channel symmetric multiple descriptions - part I: (n, k) source-channel erasure codes IEEE Transactions on Information Theory. ,vol. 50, pp. 47- 61 ,(2004) , 10.1109/TIT.2003.821998
Petar Maymounkov, David Mazières, Rateless Codes and Big Downloads international workshop on peer-to-peer systems. pp. 247- 255 ,(2003) , 10.1007/978-3-540-45172-3_23
M. Izal, Guillaume Urvoy-Keller, Ernst W. Biersack, P. A. Felber, A. Al Hamra, L. Garcés-Erice, Dissecting BitTorrent: Five Months in a Torrent’s Lifetime Lecture Notes in Computer Science. pp. 1- 11 ,(2004) , 10.1007/978-3-540-24668-8_1
Ebad Ahmed, Aaron B. Wagner, Binary erasure multiple descriptions: Worst-case distortion international symposium on information theory. pp. 55- 59 ,(2009) , 10.1109/ISIT.2009.5205730
Chuan Wu, Baochun Li, rStream Proceedings of the 13th annual ACM international conference on Multimedia - MULTIMEDIA '05. pp. 307- 310 ,(2005) , 10.1145/1101149.1101211
L. Ozarow, On a Source-Coding Problem with Two Channels and Three Receivers Bell System Technical Journal. ,vol. 59, pp. 1909- 1921 ,(1980) , 10.1002/J.1538-7305.1980.TB03344.X
Ebad Ahmed, Aaron B. Wagner, Erasure Multiple Descriptions IEEE Transactions on Information Theory. ,vol. 58, pp. 1328- 1344 ,(2012) , 10.1109/TIT.2011.2177749