On the capacity of information networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 241-250

  Adler, Micah ^a   Harvey, Nicholas J A ^b   Jain, Kamal ^c   Kleinberg, Robert ^b   Lehman, April Rasala ^b  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION NETWORKS; INPUT/OUTPUT (I/O) COMPLEXITY; NETWORK CODING;

GRAPH THEORY; LINEAR ALGEBRA; MATHEMATICAL MODELS; NETWORKS (CIRCUITS); SIGNAL ENCODING; SPURIOUS SIGNAL NOISE; TURING MACHINES;

INFORMATION ANALYSIS;

EID: 33244467431     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109585     Document Type: Conference Paper

References (32)

1. M. Adler and T. Leighton. Compression using efficient multicasting. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC), May 2000.
2. A. Agarwal and M. Charikar. On the advantage of network coding for improving network throughput. In Proceedings of the IEEE Information Theory Workshop, Oct. 2004.
3. A. Aggarwal and J. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, pages 116-127, Sept. 1988.
4. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204-1216, July 2000.
5. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
6. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs. Journal of Computer and System Sciences, 45(2):204-232, Oct. 1992.
7. P. Beame, M. Saks, X. Sun, and E. Vee. Time-space trade-off lower bounds for randomized computation of decision problems. Journal of the ACM, 50(2):154-195, Mar. 2003.
8. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley, 1991.
9. R. Dougherty, C. Freiling, and K. Zeger. Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory, 51(8), Aug. 2005.
10. C. Dwork. Bounds on Fundamental Problems in Parallel and Distributed Computation. PhD thesis, Cornell University, 1984.
11. R. Floyd. Permuting information in idealized two-level storage. In R. Miller and J. Thatcher, editors, Complexity of Computer Calculations, pages 105-109. Plenum, 1972.
12. M. T. Hajiaghayi and H. Racke. An O(√n)-approximation algorithm for directed sparsest cut. Submitted Manuscript.
13. N. J. A. Harvey, D. R. Karger, and K. Murota. Deterministic network coding by matrix completion. In Proceedings of the 16th Annual Symposium on Discrete Algorithms (SODA), pages 489-498, Jan. 2005.
14. N. J. A. Harvey, R. D. Kleinberg, and A. R. Lehman. Comparing network coding with multicommodity flow for the k-pairs communication problem. Technical Report 964, MIT LCS, September 2004.
15. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros. The benefits of coding over routing in a randomized setting. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), June 2003.
16. S. Jaggi, P. Sanders, P. A. Chou, M. Effros, S. Egner, K. Jain, and L. Tolhuizen. Polynomial time algorithms for multicast network code construction. IEEE Transactions on Information Theory, 51(6), June 2005.
17. K. Jain, M. Mahdian, and M. Salavatipour. Packing Steiner trees. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 266-274, Jan. 2003.
18. K. Jain, V. Vazirani, R. W. Yeung, and G. Yuval. On the capacity of multiple unicast sessions in undirected graphs. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), Sept. 2005.
19. G. Kramer. Capacity results for the discrete memory-less network. IEEE Transactions on Information Theory, 49(1):4-21, Jan. 2003.
20. G. Kramer and S. Savari. Progressive d-separating edge set bounds on network coding rates. In Proceedings of the IEEE International Symposium on Information Theory (ISIT), Sept. 2005.
21. G. Kramer and S. A. Savari. On networks of two-way channels. In Proceedings of the DIMACS Workshop on Algebraic Coding Theory and Information Theory, Dec. 2003.
22. L. C. Lau. An approximate max-Steiner-tree-packing min-Steiner-cut theorem. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 61-70, 2004.
23. A. R. Lehman and E. Lehman. Complexity classification of network information flow problems. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 2004.
24. T. Leighton and S. Rao. Multicommodity max-flow mincut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6):787-832, Nov. 1999.
25. Z. Li and B. Li. Network coding in undirected networks. In Proceedings of the 38th Annual Conference on Information Sciences and Systems (CISS), Mar. 2004.
26. Z. Li and B. Li. Network coding: The case of multiple unicast sessions. In Proceedings of the 42nd Allerton Annual Conference on Communication, Control, and Computing, Sept. 2004.
27. Z. Li, B. Li, D. Jiang, and L. C. Lau. On achieving throughput with network coding. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), Mar. 2005.
28. N. Pippenger and M. J. Fischer. Relations among complexity measures. Journal of the ACM, 26(2):361-381, Apr. 1979.
29. S. Riis. Linear versus non-linear boolean functions in network flow. In Proceedings of the 38th Annual Conference on Information Sciences and Systems (CISS), Mar. 2004.
30. M. Saks, A. Samorodnitsky, and L. Zosin. A lower bound on the integrality gap for minimum multicut in directed networks. Combinatorica, 24(3):525-530, 2004.
31. L. Song, R. Yeung, and N. Cai. Zero-error network coding for acyclic networks. IEEE Transactions on Information Theory, 49:3129-3139, Dec. 2003.
32. Z. Zhang and R. W. Yeung. On characterization of entropy function via information inequalities. IEEE Transactions on Information Theory, 44(4), July 1998.