Multi-session function computation and multicasting in undirected graphs

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 4, 2013, Pages 702-713

  Kannan, Sreeram ^a   Viswanath, Pramod ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

capacity; computation trees; Function computation; multicasting; multiple unicast; network coding; sensor networks; Steiner packing

Indexed keywords

CAPACITY; COMPUTATION TREES; FUNCTION COMPUTATIONS; STEINER; UNICAST;

APPROXIMATION ALGORITHMS; COMMUNICATION; DECISION TREES; NETWORK CODING; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SENSOR NETWORKS; SENSOR NODES;

MULTICASTING;

EID: 84875632788     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.130408     Document Type: Article

References (41)

1. S. Kannan, C. Suh, and P. Viswanath, "Multi-terminal function computation in undirected graphs," submitted to ISIT 2012.
2. P. N. Klein, S. A. Plotkin, S. Rao, and E. Tardos, "Approximation Algorithms for Steiner and Directed Multicuts," J. Algorithms vol. 22, no.2, pp. 241-269, 1997. (Pubitemid 127451232)
3. V. Nagarajan and R. Ravi, "Approximation Algorithms for requirement cut on graphs," Algorithmica vol. 56, no.2, pp.198-213, 2010.
4. A. Gupta, V. Nagarajan and R. Ravi, "An improved approximation algorithms for requirement cut," Operations Research Letters vol. 38, pp.322-325, 2010.
5. J. Fackaroenphol, S. Rao and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," J. Computer and System Sciences vol. 69, no. 3, pp.485-497, 2004.
6. C. Chekuri "Approximation Algorithms" Course lecture notes Available online: http://www.cs.illinois.edu/class/sp11/cs598csc/
7. D. P. Williamson and D. B. Shmoys, "The design of approximation algorithms" Cambridge University Press 2011.
8. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, "Introduction to algorithms" MIT Press 2001.
9. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network coding for computing: Cut-set bounds", IEEE Trans. Inf. Theory, vol. 57, no.2, pp. 1015-1030, Feb. 2011.
10. H. Kowshik and P. R. Kumar, "Optimal Function Computation in Directed and Undirected Graphs," Available online: http://arxiv.org/abs/ 1105.0240
11. A. Giridhar and P. R. Kumar, "Computing and communicating functions over sensor networks," IEEE J. Sel. Areas Commun., vol. 23, no. 4, pp. 755-764, Apr. 2005. (Pubitemid 40519630)
12. F. 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, 1999.
13. Z. Li and B. Li. "Network Coding: The Case of Multiple Unicast Sessions," Proc. 42nd Allerton Conference, Monticello, IL, 2004.
14. W. T. Tutte. "On the Problem of Decomposing a Graph Into n Connected Factors," J. London Math. Soc., vol. 36, pp. 221230, 1961.
15. C. St. J. A. Nash-Williams, "Edge-disjoint Spanning Trees of Finite Graphs," J. London Math. Soc., vol. 36, pp. 445450, 1961.
16. A. Frank, "Edge-connection of Graphs, Digraphs, and Hypergraphs," Tech.Rep., Enervary Research Group on Combinatorial Optimization, Budapest, Hungary, http://www.cs.elte.hu/egres, September 2000.
17. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Linear Codes, Target Function Classes, and Network Computing Capacity", Available online: http://arxiv.org/abs/1102.4825
18. C. Suh, N. Goela, and M. Gastpar, "Computation in Multicast Networks: Function Alignment and Converse Theorems," Available online: http://arxiv.org/abs/1209.3358
19. A. C. Yao, "Some complexity questions related to distributive computing," in Proc. eleventh annual ACM Symposium on Theory of Computing, 1979, pp. 209-213.
20. E. Kushilevitz and N. Nisan, Communication Complexity. Cambridge University Press, 1997.
21. A. Orlitsky and J. R. Roche. Coding for computing. IEEE Trans. Inf. Theory, 47:903-917, 2001. (Pubitemid 32425425)
22. N. Ma, P. Ishwar, and P. Gupta, "Information-theoretic bounds for multiround function computation in collocated networks," in Proc. IEEE International Symposium on Information Theory, 2009, pp. 2306-2310.
23. 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.
24. J. Chuzhoy and S. Khanna. "Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems," JACM, vol. 56, no. 2, 2009.
25. V. Doshi, D. Shah, and M. Medard, "Source coding with distortion through graph coloring," Proc. IEEE International Symposium on Information Theory, 2007, pp. 1501-1505.
26. O. Ayaso, D. Shah, and M. Dahleh, "Lower bounds on information rates for distributed computation via noisy channels," in Proc. fortyfifth Allerton Conference on Computation, Communication and Control, 2007.
27. B. Nazer and M. Gastpar, "Computing over multiple-access channels," IEEE Trans. Inf. Theory, vol. 53, pp. 3498-3516, Oct. 2007.
28. U. Niesen, B. Nazer and P. Whitting. Computation Alignment: Capacity Approximation without Noise Accumulation. Available Online, http://arxiv.org/ abs/1108.6312
29. L. Ying, R. Srikant, and G. E. Dullerud. Distributed symmetric function computation in noisy wireless sensor networks. IEEE Trans. Inf. Theory, 53(12):4826-4833, December 2007.
30. C. Dutta, Y. Kanoria, D. Manjunath, and J. Radhakrishnan. A tight lower bound for parity in noisy communication networks. In Proc. 20th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1056-1065, January 2008.
31. M. Charikar, T. Cheung, Z. Dai, A. Goel, S. Guha, and M. Li, "Approximation Algorithms for Directed Steiner Problems" J. Algorithms, vol. 33, pp. 73-91, 1999. (Pubitemid 129608043)
32. A. Agarwal and M. Charikar, "On the advantage of Network Coding for Improving Network Throughput," Proc. Information Theory Workshop, 2004.
33. B. K. Rai, B. K. Dey, and S. Shenvi, "Some bounds on the capacity of communicating the sum of sources," in ITW 2010, Cairo, 2010.
34. A. Ramamoorthy, "Communicating the sum of sources over a network," in Proc. IEEE International Symposium on Information Theory, 2008, pp. 1646-1650.
35. M. Langberg and A. Ramamoorthy, "Communicating the sum of sources in a 3-sources/3-terminals network," in Proc. IEEE International Symposium on Information Theory, 2009, pp. 2121-2125.
36. B. K. Rai and B. K. Dey, "Feasible alphabets for communicating the sum of sources over a network," in Proc. IEEE International Symposium on Information Theory, 2009, pp. 1353-1357.
37. B. K. Rai, and B. K. Dey, "On Network Coding for Sum-Networks," IEEE Trans. Inf. Theory, vol. 58, no. 1, pp. 50-63, 2012.
38. S. Subramanian, P. Gupta, and S. Shakkottai, "Scaling bounds for function computation over large networks," in Proc. IEEE International Symposium on Information Theory, 2007, pp. 136-140.
39. V. Shah, B. Dey, and D. Manjunath, "Network Flows for Functions, " Proc. ISIT 2011, St. Petersburg, Russia, Aug. 2011.
40. R. Ahlswede and Ning Cai. On communication complexity of vectorvalued functions. IEEE Trans. Inf. Theory, 40:2062-2067, 1994.
41. A. Anandkumar, M. Wang, L. Tong, and A. Swami. Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference. Proc. IEEE INFOCOM, Rio De Janeiro, Brazil, Apr. 2009.