Rainbow network flow with network coding

Proceedings - 2008 4th Workshop on Network Coding, Theory, and Applications, NetCod 2008

Volumn , Issue , 2008, Pages

  Shao, Mingkai ^a   Wu, Xiaolin ^a   Sarshar, Nima ^b  

^a MCMASTER UNIVERSITY   (Canada)

^b UNIVERSITY OF REGINA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; HEURISTIC PROGRAMMING; INFORMATION THEORY; NUCLEAR PROPULSION; PROGRAMMING THEORY; RADIO BROADCASTING; SOLUTIONS;

BROADCAST PROBLEM; FLOW PATHS; HEURISTIC SOLUTIONS; INTERMEDIATE NODES; MULTIPLE DESCRIPTION; NETWORK CODING; NETWORK FLOWS; NETWORK THROUGHPUT; NP-HARD; OBJECTIVE FUNCTION; RATE DISTORTIONS; SIGNAL COMPRESSIONS;

BROADCASTING;

EID: 49749146440     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/NETCOD.2008.4476189     Document Type: Conference Paper

References (11)

1. V. K. Goyal, "Multiple description coding: compression meets the network," IEEE Signal Process. Mag., vol. 18, no. 5, pp. 74-93, September 2001.
2. B. Ma and X. Wu, "Maximum network flow of multiple description codes," in Proceedings of NetCod 2005, April 2005.
3. X. Wu, B. Ma, and N. Sarshar, "Rainbow network problems and multiple description coding," in Proc. of International Symposium on Information Theory, September 2005, pp. 268-272.
4. R. Ahlswede, N. Cai, S. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
5. R. W. Yeung, S. R. Li, N. Cai, and Z. Zhang, Network Coding Theory, now Publishers, 2005.
6. N. Sundaram, P. Ramanathan, and S. Banerjee, "Multirate media stream using network coding," in Proceedings of Fourty-Third Annual Allerton Conference on Communication, Control, and Computing, September 2005.
7. L. Chen, T. Ho, S. H. Low, M. Chiang, and J. C. Doyle, "Optimization based rate control for multicast with network coding," in Proceedings of INFOCOM 2007, May 2007, pp. 1163-1171.
8. P. Sanders, S. Egner, and L. Tolhuizen, "Polynomial time algorithms for network information flow," in Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, June 2003, pp. 286-294.
9. N. Sarshar and X. Wu, "Rate-distortion optimized network communication," in Proceedings of INFOCOM 2007, May 2007, pp. 1595-1603.
10. P. Raghavan and C. D. Tompson, "Randomized rounding: a technique for provably good algorithms and algorithmic proofs," Combinatorica, vol. 7, 1987.
11. W. Hoeffding, "Probability inequalities for sums of bounded random variables," Journal of the American Statistical Association, vol. 58, no. 301, pp. 13-30, March 1963.