On Distributed Distortion Optimization for Correlated Sources

We consider lossy data compression in capacity-constrained networks with correlated sources. We develop, using dual decomposition, a distributed algorithm that maximizes an aggregate utility measure defined in terms of the distortion levels of the sources. No coordination among sources is required; each source adjusts its distortion level according to distortion prices fed back by the sinks. The algorithm is developed for the case of squared error distortion and high resolution coding where the rate distortion region is known, and is easily extended to consider achievable regions that can be expressed in a related form. Our distributed optimization framework applies to unicast and multicast with and without network coding. Numerical example shows relatively fast convergence, allowing the algorithm to be used in time-varying networks.

[1]  David Tse,et al.  Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities , 1998, IEEE Trans. Inf. Theory.

[2]  Baltasar Beferull-Lozano,et al.  Networked Slepian-Wolf: theory, algorithms, and scaling laws , 2005, IEEE Transactions on Information Theory.

[3]  Harish Viswanathan,et al.  Dynamic Algorithms for Multicast With Intra-Session Network Coding , 2009, IEEE Transactions on Information Theory.

[4]  Pramod Viswanath,et al.  Rate Region of the Quadratic Gaussian Two-Terminal Source-Coding Problem , 2005, ArXiv.

[5]  Aaron D. Wyner,et al.  The rate-distortion function for source coding with side information at the decoder , 1976, IEEE Trans. Inf. Theory.

[6]  J. Wolfowitz.  The rate distortion function for source coding with side information at the decoder , 1979 .

[7]  Baltasar Beferull-Lozano,et al.  Lossy network correlated data gathering with high-resolution coding , 2005, IEEE Transactions on Information Theory.

[8]  Muriel Médard,et al.  Minimum-Cost Subgraphs for Joint Distributed Source and Network Coding , 2006 .

[9]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

[10]  Aditya Ramamoorthy,et al.  Separating distributed source coding from network coding , 2006, IEEE Transactions on Information Theory.

[11]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[12]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[13]  Steven McCanne,et al.  Low-Complexity Video Coding for Receiver-Driven Layered Multicast , 1997, IEEE J. Sel. Areas Commun..

[14]  Giuseppe Longo,et al.  The information theory approach to communications , 1977 .

[15]  A. Robert Calderbank,et al.  Layering As Optimization Decomposition , 2006 .

[16]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[17]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[18]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[19]  Tracey Ho,et al.  Rate Control for Multicast with Network Coding , 2006 .

[20]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.

[21]  Yunnan Wu,et al.  Distributed utility maximization for network coding based multicasting: a shortest path approach , 2006, IEEE Journal on Selected Areas in Communications.

[22]  Pramod Viswanath,et al.  Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem , 2006, ISIT.

[23]  Zixiang Xiong,et al.  Compression of binary sources with side information at the decoder using LDPC codes , 2002, IEEE Communications Letters.

[24]  Toby Berger,et al.  Multiterminal Source Coding with High Resolution , 1999, IEEE Trans. Inf. Theory.