Date Added: Nov 2011
The authors consider lossy data compression in capacity-constrained networks with correlated sources. They derive, 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 can be easily extended to consider achievable regions that can be expressed in a related form.