메뉴 건너뛰기




Volumn 3124, Issue , 2004, Pages 1107-1113

A multicast routing algorithm using multiobjective optimization

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; FORESTRY; MULTICASTING; MULTIOBJECTIVE OPTIMIZATION; NETWORK ROUTING; OPTIMIZATION; PARETO PRINCIPLE; ROUTING ALGORITHMS; TREES (MATHEMATICS);

EID: 33750704037     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27824-5_144     Document Type: Article
Times cited : (8)

References (9)
  • 2
    • 0027612181 scopus 로고
    • Multicast routing in multimedia communication
    • V. Kompella, and A. Gupta, "Multicast routing in multimedia communication," IEEE/ACM Transactions on Networking, Vol. 1 No. 3, 1993, pp. 286-291.
    • (1993) IEEE/ACM Transactions on Networking , vol.1 , Issue.3 , pp. 286-291
    • Kompella, V.1    Gupta, A.2
  • 3
    • 0032027696 scopus 로고    scopus 로고
    • Source-based delay bounded multicasting in multimedia networks
    • C.P. Ravikumar, and R. Bajpai, "Source-based delay bounded multicasting in multimedia networks," Computer Communications, Vol. 21, 1998, pp. 126-132.
    • (1998) Computer Communications , vol.21 , pp. 126-132
    • Ravikumar, C.P.1    Bajpai, R.2
  • 4
    • 0035312536 scopus 로고    scopus 로고
    • Bandwidth-delay-constraint least-cost multicast routing based on heuristic genetic algorithm
    • W. Zhengying, S. Bingxin, and Z. Erdun, "Bandwidth-delay-constraint least-cost multicast routing based on heuristic genetic algorithm," Computer Communications, Vol. 24, 2001, pp. 685-692.
    • (2001) Computer Communications , vol.24 , pp. 685-692
    • Zhengying, W.1    Bingxin, S.2    Erdun, Z.3
  • 6
    • 0033318858 scopus 로고    scopus 로고
    • Multiobjective Evolutionary Algorithms: A comparative Case Study and the Strength Pareto Approach
    • E. Zitzler, and L. Thiele, "Multiobjective Evolutionary Algorithms: A comparative Case Study and the Strength Pareto Approach," IEEE Trans. Evolutionary Computation, Vol. 3, No. 4, 1999, pp. 257-271.
    • (1999) IEEE Trans. Evolutionary Computation , vol.3 , Issue.4 , pp. 257-271
    • Zitzler, E.1    Thiele, L.2
  • 9
    • 0000663732 scopus 로고
    • Finding the k shortest loopless path in a network
    • J. Yen, "Finding the k shortest loopless path in a network," Management Science, 17:712-716, 1971.
    • (1971) Management Science , vol.17 , pp. 712-716
    • Yen, J.1


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