Evolutionary approaches to minimizing network coding resources

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1991-1999

  Kim, Minkyu ^a   Médard, Muriel ^a   Aggarwal, Varun ^b   O'Reilly, Una May ^b   Kim, Wonsik ^a   Ahn, Chang Wook ^c   Effros, Michelle ^d  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Gwangju Institute of Science and Technology (GIST)   (South Korea)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GENETIC ALGORITHMS; MULTICASTING; NETWORK MANAGEMENT; OPTIMIZATION;

ACYCLIC NETWORKS; COMBINING DISTRIBUTED RANDOM NETWORKS; NETWORK CODING RESOURCES;

ENCODING (SYMBOLS);

EID: 34548295771     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.231     Document Type: Conference Paper

References (22)

1. R. Ahlswede, N. Cai, S.-Y. R. Li, and R. W. Yeung, "Network information flow," IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1204-1216, 2000.
2. S.-Y. R. Li, R. W. Yeung, and N. Cai, "Linear network coding," IEEE Trans. Inf. Theory, vol. 49, no. 2, pp. 371-381, 2003.
3. M. B. Richey and R. G. Parker, "On multiple steiner subgraph problems," Networks, vol. 16, no. 4, pp. 423-438, 1986.
4. M. Langberg, A. Sprintson, and J. Bruck, "The encoding complexity of network coding," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2386-2397, 2006.
5. M. Kim, C. W. Ahn, M. Médard, and M. Effros, "On minimizing network coding resources: An evolutionary approach," in Proc. NetCod, 2006.
6. T. Ho, R. Koetter, M. Médard, D. R. Karger, and M. Effros, "The benefits of coding over routing in a randomized setting," in Proc. IEEE ISIT, 2003.
7. C. Fragouli and E. Soljanin, "Information flow decomposition for network coding," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 829-848, 2006.
8. K. Bhattad, N. Ratnakar, R. Koetter, and K. R. Narayanan, "Minimal network coding for multicast," in Proc. IEEE ISIT, 2005, pp. 1730-1734.
9. M. Mitchell, An Introduction to Genetic Algorithms. MIT Press, 1996.
10. R. Elbaum and M. Sidi, "Topological design of local-area networks using genetic algorithms," IEEE/ACM Trans. Netw., vol. 4, no. 5, pp. 766-778, 1996.
11. B. Dengiza, F. Altiparmak, and A. E. Smith, "Efficient optimization of all-terminal reliable networks, using an evolutionary approach," IEEE Trans. Rel., vol. 46, no. 1, pp. 18-26, 1997.
12. R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, 2003.
13. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
14. D. S. Lun, M. Médard, T. Ho, and R. Koetter, "Network coding with a cost criterion," MIT-LIDS, Tech. Rep. P-2584, 2004.
15. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller, "The gambler's ruin problem, genetic algorithms, and the sizing of populations," Evolutionary Computation, vol. 7, no. 3, pp. 231-253, 1999.
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 Trans. Inf. Theory, vol. 51, no. 6, pp. 1973-1982, 2005.
17. T. Ho, B. Leong, R. Koetter, and M. Médard, "Distributed asynchronous algorithms for multicast network coding," in Proc. NetCod, 2005.
18. T. Ho, M. Médard, J. Shi, M. Effros, and D. R. Karger, "On randomized network coding," in Proc. Annual Allerton Conference on Communication, Control, and Computing, 2003.
19. E. Erez and M. Feder, "Efficient network codes for cyclic networks," in Proc. ISIT, 2005.
20. G. Melançon and F. Philippe, "Generating connected acyclic digraphs uniformly at random," Inf. Process. Lett., vol. 90, no. 4, pp. 209-213, 2004.
21. M. Kim, V. Aggarwal, U.-M. O'Reilly, M. Médard, and W. Kim, "Genetic representations for evolutionary optimization of network coding resources," in Applications of Evolutionary Computing, 2007.
22. N. Spring, R. Mahajan, and D. Wetherall, "Measuring ISP topologies with rocketfuel," in Proc. ACM/SIGCOMM '02, 2002, pp. 133-145.