Network computing capacity for the reverse butterfly network

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 259-262

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

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUTTERFLY NETWORKS; LINEAR CODING; NETWORK COMPUTING;

INFORMATION THEORY;

EID: 70449511636     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205983     Document Type: Conference Paper

References (13)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow", IEEE Transactions on Information Theory, vol. 46, no. 4, pp. 1204-1216, July 2000.
2. R. Appuswamy, M. Franceschetti, N. Karamchandani, and K. Zeger, "Network coding for computing", Proceedings of the forty-sixth Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, Sept. 2008.
3. O. Ayaso, D. Shah, and M. Dahleh, "Lower Bounds on Information Rates for Distributed Computation via Noisy Channels", Proceedings of the forty-fifth Allerton Conference on Computation, Communication and Control, Monticello, IL, Sept. 2007.
4. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized Gossip Algorithms", IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2508-2530, June 2008.
5. J. Cannons, R. Dougherty, C. Freiling, and K. Zeger, "Network routing capacity", IEEE Transactions on Information Theory, vol. 52, no. 3, pp. 777-788, March 2006.
6. A. G. Dimakis, A. D. Sarwate, and M. J. Wainwright, "Geographic gossip: efficient aggregation for sensor networks", Proceedings of the fifth international conference on Information processing in sensor networks, Nashville, TN, April 2006, pp. 69-76.
7. A. Giridhar and P. R. Kumar, "Toward a theory of in-network computation in wireless sensor networks", IEEE Communications Magazine, vol. 44, no. 4, pp. 98-107, April 2006.
8. E. Kushilevitz and N. Nisan, Communication Complexity, Cambridge University Press, 1997.
9. A. Rasala Lehman and E. Lehman, "Complexity classification of network information flow problems", Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, Jan. 2004, pp. 142-150.
10. D. Mosk-Aoyama and D. Shah, "Fast Distributed Algorithms for Computing Separable Functions", IEEE Transactions on Information Theory, vol. 54, no. 7, pp. 2997-3007, July 2008.
11. A. Ramamoorthy, "Communicating the sum of sources over a network", Proceedings of the IEEE International Symposium on Information Theory, Toronto, Canada, July 2008, pp. 1646-1650.
12. A. C. Yao, "Some Complexity Questions Related to Distributed Computing", Proc. of eleventh ACM Symposium on Theory of Computing, Atlanta, GA, April 1979, pp. 209-213.
13. R. W. Yeung, A First Course in Information Theory, Springer, 2002.