Network coding for computing: Cut-set bounds

IEEE Transactions on Information Theory

Volumn 57, Issue 2, 2011, Pages 1015-1030

  Appuswamy, Rathinakumar ^a   Franceschetti, Massimo ^a   Karamchandani, Nikhil ^a   Zeger, Kenneth ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Capacity; cut set bound; function computation; information theory; network coding; throughput

Indexed keywords

ACHIEVABLE RATE; ACYCLIC NETWORKS; AVERAGE NUMBERS; CAPACITY; COMPUTING CAPACITY; CUT-SET BOUND; LOWER BOUNDS; MIN-CUT; NETWORK CODING; NETWORK COMPUTING; NETWORK USAGE; RECEIVER NODES; SOURCE NODES; STEINER TREE PACKING; SYMMETRIC FUNCTIONS; TARGET FUNCTIONS; TREE NETWORK; UPPER BOUND;

INFORMATION THEORY;

COMPUTATION THEORY;

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

References (50)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 1204-1216, Jul. 2000.
2. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network computing capacity for the reverse butterfly network," in Proc. IEEE Int. Symp. Information Theory, 2009, pp. 259-262.
3. O.Ayaso, D. Shah, and M. Dahleh, "Lower bounds on information rates for distributed computation via noisy channels," in Proc. 45th Allerton Conf. Computation, Communication and Control, 2007.
4. O. Ayaso, D. Shah, and M. Dahleh, "Counting bits for distributed function computation," in Proc. IEEE Int. Symp. Information Theory, 2008, pp. 652-656.
5. F. Benezit, A. G. Dimakis, P. Thiran, and M.Vetterli, "Gossip along the way: Order-optimal consensus through randomized path averaging," in Proc. 45th Allerton Conf. Computation, Communication and Control, 2007.
6. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2508-2530, Jun. 2006.
7. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 777-788, Mar. 2006.
8. P. Cuff, H. Su, and A. E. Gamal, "Cascade multiterminal source coding," in Proc. IEEE Int. Symp. Information Theory, 2009, pp. 1199-1203.
9. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: Efficient aggregation for sensor networks," in Proc. 5th Int. Conf. Information Processing in Sensor Networks, 2006, pp. 69-76.
10. V. Doshi, D. Shah, and M. Médard, "Source coding with distortion through graph coloring," in Proc. IEEE Int. Symp. Information Theory, 2007, pp. 1501-1505.
11. V. Doshi, D. Shah, M. Médard, and S. Jaggi, "Graph coloring and conditional graph entropy," in Proc. 40th Asilomar Conf. Signals, Systems and Computers, 2006, pp. 2137-2141.
12. V. Doshi, D. Shah, M. Médard, and S. Jaggi, "Distributed functional compression through graph coloring," in Proc. Data Compression Conf., 2007, pp. 93-102.
13. R. Dougherty, C. Freiling, and K. Zeger, "Unachievability of network coding capacity," IEEE Trans. Inf. Theory & IEEE/ACM Trans. Netw. (Joint Issue), vol. 52, no. 6, pp. 2365-2372, Jun. 2006.
14. C. Dutta, Y. Kanoria, D. Manjunath, and J. Radhakrishnan, "A tight lower bound for parity in noisy communication networks," in Proc. 19th Annu. ACM-SIAM Symp. Discrete Algorithms, 2008, pp. 1056-1065.
15. H. Feng, M. Effros, and S. Savari, "Functional source coding for networks with receiver side information," in Proc. 42nd Allerton Conf. Computation, Communication and Control, 2004, pp. 1419-1427.
16. R. G. Gallager, "Finding parity in a simple broadcast network," IEEE Trans. Inf. Theory, vol. 34, no. , pp. 176-180, Mar. 1988.
17. A. El Gamal, "Reliable communication of highly distributed information," in Open Prob. in Commun. and Comput., T. M. Cover and B. Gopinath, Eds. New York: Springer-Verlag, 1987, pp. 60-62.
18. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE J. Select. Areas Commun., vol. 23, no. 4, pp. 755-764, Apr. 2005.
19. N. Goyal, G. Kindler, and M. Saks, "Lower bounds for the noisy broadcast problem," SIAM J. Comput., vol. 37, no. 6, pp. 1806-1841, Mar. 2008.
20. P. Gupta and P. R. Kumar, "The capacity of wireless networks," IEEE Trans. Inf. Theory, vol. 46, no. 3, pp. 388-404, Mar. 2000.
21. G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed. Oxford, U.K.: Oxford University Press, 1979.
22. N. J. A. Harvey, R. Kleinberg, and A. Rasala Lehman, "On the capacity of information networks," IEEE Trans. Inf. Theory&IEEE/ACM Trans. Netw. (Joint Issue), vol. 52, no. 6, pp. 2345-2364, Jun. 2006. (Pubitemid 43898896)
23. N. J. A. Harvey, R. D. Kleinberg, and A. Rasala Lehman, "Comparing network coding with multicommodity flow for the k-pairs communication problem," M.I.T. LCS, Tech. Rep. 964, 2004.
24. W. Hoeffding, "Probability inequalities for sums of bounded random variables," J. Amer. Statist. Assoc., vol. 58, no. 301, pp. 13-30, Mar. 1963.
25. K. Jain, M. Mahdian, and M. R. Salavatipour, "Packing steiner trees," in Proc. 14th Ann. ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 266-274.
26. N. Karamchandani, R. Appuswamy, and M. Franceschetti, "Distributed computation of symmetric functions with binary inputs," in Proc. IEEE Information Theory Workshop, 2009, pp. 76-80.
27. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. 44th Ann. IEEE Symp. Foundations of Computer Science, 2003, pp. 482-491.
28. J. Körner and K. Marton, "How to encode the modulo-two sum of binary sources," IEEE Trans. Inf. Theory, vol. IT-25, pp. 29-221, Mar. 1979.
29. H. Kowshik and P. R. Kumar, "Zero-error function computation in sensor networks," in Proc. IEEE Conf. Decision and Control, 2009, pp. 3787-3792.
30. E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge, U.K.: Cambridge University Press, 1997.
31. M. Langberg and A. Ramamoorthy, "Communicating the sum of sources in a 3-sources/3-terminals network," in Proc. IEEE Int. Symp. Information Theory, 2009, pp. 2121-2125.
32. A. Rasala Lehman and E. Lehman, "Complexity classification of network information flow problems," in Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms, 2003, pp. 142-150.
33. T. Leighton and S. Rao, "Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms," J. ACM, vol. 46, no. 6, pp. 787-832, Nov. 1999.
34. N. Ma and P. Ishwar, "Two-terminal distributed source coding with alternating messages for function computation," in Proc. IEEE Int. Symp. Information Theory, 2008, pp. 51-55.
35. N. Ma, P. Ishwar, and P. Gupta, "Information-theoretic bounds for multiround function computation in collocated networks," in Proc. IEEE Int. Symp. Information Theory, 2009, pp. 2306-2310.
36. D. Mosk-Aoyama and D. Shah, "Fast distributed algorithms for computing separable functions," IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 2997-3007, Jul. 2008.
37. B. Nazer and M. Gastpar, "Computing over multiple-access channels," IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3498-3516, Oct. 2007.
38. C. K. Ngai and R. W. Yeung, "Network coding gain of combination networks," in Proc. IEEE Information Theory Workshop, 2004, pp. 283-287.
39. A. Orlitsky and J. R. Roche, "Coding for computing," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 903-917, Mar. 2001.
40. B. K. Rai and B. K. Dey, "Feasible alphabets for communicating the sum of sources over a network," in Proc. IEEE Int. Symp. Information Theory, 2009, pp. 1353-1357.
41. B. K. Rai, B. K. Dey, and S. Shenvi, "Some bounds on the capacity of communicating the sum of sources," in Proc. ITW 2010, Cairo, Egypt, 2010.
42. A. Ramamoorthy, "Communicating the sum of sources over a network," in Proc. IEEE Int. Symp. Information Theory, 2008, pp. 1646-1650.
43. S. Subramanian, P. Gupta, and S. Shakkottai, "Scaling bounds for function computation over large networks," in Proc. IEEE Int. Symp. Information Theory, 2007, pp. 136-140.
44. V. V. Vazirani, Approximation Algorithms, 1st ed. New York: Springer, 2004.
45. D. B. West, Introduction to Graph Theory. Upper Saddle River, NJ: Prentice-Hall, 2001.
46. H. Witsenhausen, "The zero-error side information problem and chromatic numbers," IEEE Trans. Inf. Theory, vol. IT-22, pp. 592-593, Sep. 1976.
47. H. Yamamoto, "Wyner-Ziv theory for a general function of the correlated sources," IEEE Trans. Inf. Theory, vol. IT-28, pp. 803-807, Sep. 1982.
48. A. C. Yao, "Some complexity questions related to distributive computing," in Proc. 11th Annu. ACM Symp. Theory of Computing, 1979, pp. 209-213.
49. R. W. Yeung, A First Course in Information Theory. : Springer, 2002.
50. L. Ying, R. Srikant, and G. E. Dullerud, "Distributed symmetric function computation in noisy wireless sensor networks," IEEE Trans. Inf. Theory, vol. 53, no. 12, pp. 4826-4833, Dec. 2007.