메뉴 건너뛰기




Volumn 24, Issue 7-8, 2001, Pages 685-692

Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm

Author keywords

Genetic algorithm; Multicast routing; NP complete problem; Quality of service

Indexed keywords

BANDWIDTH; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GENETIC ALGORITHMS; HEURISTIC METHODS; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION SERVICES; TREES (MATHEMATICS);

EID: 0035312536     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(00)00273-5     Document Type: Article
Times cited : (134)

References (26)
  • 19
    • 21844491158 scopus 로고
    • Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm
    • (1995) Networks , vol.26 , pp. 173-185
    • Esbensen, H.1
  • 21
    • 0003873510 scopus 로고    scopus 로고
    • A genetic algorithm for delay-constrained minimum-cost multicasting
    • IBR, TU Braunschweig, Butenweg, 74/75, 38106 Braunschweig, Germany
    • (1999) Technical Report
    • Sun, Q.1


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