메뉴 건너뛰기




Volumn , Issue , 2007, Pages

On the coding-link cost tradeoff in multicast network coding

Author keywords

[No Author keywords available]

Indexed keywords

EVOLUTIONARY APPROACHES; LINK COSTS; LINK USAGE; MULTI-OBJECTIVE GENETIC ALGORITHM (MOGA); MULTICAST; MULTICAST NETWORKS; NETWORK CODING; NP COMPLETE PROBLEMS; NP-HARD; RESOURCE OPTIMIZATION; SELECTION MECHANISMS; SPECIFIC CHARACTERISTICS;

EID: 47949089643     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2007.4454941     Document Type: Conference Paper
Times cited : (19)

References (12)
  • 1
    • 25844504259 scopus 로고    scopus 로고
    • Achieving minimum-cost multicast: A decentralized approach based on network coding
    • D. Lun, N. Ratnakar, R. Koetter, M. Médard, E. Ahmed, and H. Lee, "Achieving minimum-cost multicast: a decentralized approach based on network coding," in Proc. IEEE Infocom, 2005, pp. 1607-1617.
    • (2005) Proc. IEEE Infocom , pp. 1607-1617
    • Lun, D.1    Ratnakar, N.2    Koetter, R.3    Médard, M.4    Ahmed, E.5    Lee, H.6
  • 3
    • 34548087410 scopus 로고    scopus 로고
    • On minimizing network coding resources: An evolutionary approach
    • M. Kim, C. W. Ahn, M. Médard, and M. Effros, "On minimizing network coding resources: An evolutionary approach," in Proc. NetCod, 2006.
    • (2006) Proc. NetCod
    • Kim, M.1    Ahn, C.W.2    Médard, M.3    Effros, M.4
  • 4
    • 0036530772 scopus 로고    scopus 로고
    • A fast and elitist multiobjective genetic algorithm: NSGA-II
    • K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, "A fast and elitist multiobjective genetic algorithm: NSGA-II," IEEE Irons. Evol. Comput., vol. 6, no. 2, pp. 182-197, 2002.
    • (2002) IEEE Irons. Evol. Comput , vol.6 , Issue.2 , pp. 182-197
    • Deb, K.1    Pratap, A.2    Agarwal, S.3    Meyarivan, T.4
  • 6
    • 0030211409 scopus 로고    scopus 로고
    • Multicast tree generation in networks with asymmetric links
    • S. Ramanathan, "Multicast tree generation in networks with asymmetric links," IEEE/ACM Trans. Networking, vol. 4, no. 4, pp. 558-568, 1996.
    • (1996) IEEE/ACM Trans. Networking , vol.4 , Issue.4 , pp. 558-568
    • Ramanathan, S.1
  • 8
    • 47949088453 scopus 로고    scopus 로고
    • Genetic representations for evolutionary minimization of network coding resources
    • M. Kim, V. Aggarwal, U.-M. O'Reilly, and M. Medard, "Genetic representations for evolutionary minimization of network coding resources," in Proc. EvoWorkshops, 2007.
    • (2007) Proc. EvoWorkshops
    • Kim, M.1    Aggarwal, V.2    O'Reilly, U.-M.3    Medard, M.4
  • 9
    • 0033185794 scopus 로고    scopus 로고
    • The gambler's ruin problem, genetic algorithms, and the sizing of populations
    • 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.
    • (1999) Evolutionary Computation , vol.7 , Issue.3 , pp. 231-253
    • Harik, G.1    Cantú-Paz, E.2    Goldberg, D.E.3    Miller, B.L.4
  • 11
    • 1842736912 scopus 로고    scopus 로고
    • Generating connected acyclic digraphs uniformly at random
    • G. Melançon and F. Philippe, "Generating connected acyclic digraphs uniformly at random," Inf. Process. Lett., vol. 90, no. 4, pp. 209-213, 2004.
    • (2004) Inf. Process. Lett , vol.90 , Issue.4 , pp. 209-213
    • Melançon, G.1    Philippe, F.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.