Rainbow network flow of multiple description codes

IEEE Transactions on Information Theory

Volumn 54, Issue 10, 2008, Pages 4565-4574

  Wu, Xiaolin ^a   Ma, Bin ^b,c   Sarshar, Nima ^d  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

^d UNIVERSITY OF REGINA   (Canada)

Author keywords

Color; Complexity; Encoding; Maximum network flow; Multiple description coding (MDC); Network routing; Network topology; Optimization; Routing; Servers; Source coding

Indexed keywords

EID: 54749100505     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.929006     Document Type: Article

References (18)

1. A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, "Priority encoding transmission," IEEE Trans. Inf. Theory, vol. 42, no. 6, pp. 1737-1744, Sep. 1996.
2. J. W. Byers, M. Luby, and M. Mitzenmacher, "Accessing multiple mirror sites in parallel: Using tornado codes to speed up downloads," in Proc. IEEE Infocom, New York, NY, Mar. 1999, pp. 275-283.
3. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," in Proc. ACM SIGCOMM, Vancouver, BC, Sep. 1998, pp. 56-67.
4. Y. Chu, S. G. Rao, S. Seshan, and H. Zhang, "A case for end system multicast," IEEE J. Sel. Areas Commun., vol. 20, no. 8, pp. 1456-1471, Oct. 2002.
5. A. Goldberg and R. Tarjan, "A new approach to the maximum-flow problem," J. ACM, vol. 35, no. 4, pp. 921-940, 1988.
6. V. Goyal, "Multiple description coding: Compression meets the network," IEEE Signal Process. Mag., vol. 18, pp. 74-93, 2001.
7. B. Hohlt, L. Doherty, and E. Brewer, "Flexible power scheduling for sensor networks," in Proc. Information Processing in Sensor Networks Apr. 2004, pp. 205-214.
8. R. Karp, "On the computational complexity of combinatorial problems," Networks, vol. 5, pp. 45-68, 1975.
9. V. King, S. Rao, and R. Tarjan, "Faster deterministic maximum flow algorithm," in Proc. Symp. Discrete Algorithms, Orlando, FL, Jan. 1992, p. 11.
10. J. M. Kleinberg, "Single-source unsplittable flow," in Proc. 37th IEEE Symp. Foundations of Computer Science, 1996, pp. 68-77.
11. M. Luby, M. Mitzenmacher, A. Shokrollahi, D. A. Spielman, and V. Stemann, "Practical erasure resilient codes," in Proc. 29th ACM Symp. Theory of Computing (STOC), El Paso, TX, 1997, pp. 150-159.
12. R. Miller and J. Thatcher, Eds., Complexity of Computations. New York: Plenum, 1972.
13. L. H. Ozarow, "On a source coding problem with two channels and three receivers," Bell Syst. Tech. J., vol. 59, no. 10, 1980.
14. C. Papadimitriou and M. Yannakakis, "Optimization, approximation, and complexity classes," J. Comp. Syst. Sci., vol. 43, pp. 425-440, 1991.
15. N. Sarshar and X. Wu, "A practical approach to joint network source coding," in Proc. Data Compression Conf., Snow Bird, UT, Mar. 2006, pp. 93-102.
16. N. Sarshar and X. Wu, "Rate-distortion optimized network communication," in Proc. IEEE Infocom, Anchorage, AK, May 2007, pp. 1595-1603.
17. M. Shao, X. Wu, and N. Sarshar, "Rainbow network flow with network coding," in Proc. Network Coding Workshop, Hong Kong, Jan. 2008.
18. J. Vygen, "Np-completeness of some edge-disjoint paths problems," Discr. Appl. Math., vol. 61, no. 1, pp. 83-90, 1995.