메뉴 건너뛰기




Volumn 15, Issue 5, 2004, Pages 660-665

Fast low-cost shortest path tree algorithm

Author keywords

MST (minimum spanning tree); Multicast; SPT (shortest path tree); Steiner tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; OPTIMIZATION; TREES (MATHEMATICS);

EID: 3442880267     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (13)

References (8)
  • 2
    • 0034850502 scopus 로고    scopus 로고
    • A fast delay-constrained multicast routing algorithm
    • IEEE Communications Society, (ed.), Los Alamitos: IEEE Press
    • Zhang BX, Kruntz MM, Chen CJ. A fast delay-constrained multicast routing algorithm. In: IEEE Communications Society, ed. Proc. of the 2001 IEEE Int'l Conf. on Communications, Vol 9. Los Alamitos: IEEE Press, 2000. 2676-2680.
    • (2000) Proc. of the 2001 IEEE Int'l Conf. on Communications , vol.9 , pp. 2676-2680
    • Zhang, B.X.1    Kruntz, M.M.2    Chen, C.J.3
  • 3
    • 3442888125 scopus 로고    scopus 로고
    • A fast routing algorithm for delay-constrained low-cost multicast
    • Chinese source
    • Yang M, Xie XR. A fast routing algorithm for delay-constrained low-cost multicast. Journal of Computer Research and Development, 2000, 37(6): 726-730 (in Chinese with English abstract).
    • (2000) Journal of Computer Research and Development , vol.37 , Issue.6 , pp. 726-730
    • Yang, M.1    Xie, X.R.2
  • 4
    • 3442899212 scopus 로고    scopus 로고
    • Strategy of constructing minimum cost multicast routing tree with delay and delay variation bounds
    • Chinese source
    • Wang MZ, Xie JY, Zhang JY. Strategy of constructing minimum cost multicast routing tree with delay and delay variation bounds. Chinese Journal of Computers, 2002, 25(5): 534-541 (in Chinese with English abstract).
    • (2002) Chinese Journal of Computers , vol.25 , Issue.5 , pp. 534-541
    • Wang, M.Z.1    Xie, J.Y.2    Zhang, J.Y.3
  • 6
    • 0036285369 scopus 로고    scopus 로고
    • A destination-driven shortest path tree algorithm
    • IEEE Communications Society (ed.), Los Alamitos: IEEE Press
    • Zhang BX, Mouftah HT. A destination-driven shortest path tree algorithm. In: IEEE Communications Society, ed. Proc. of the 2002 IEEE Int'l Conf. on Communications, Vol 4. Los Alamitos: IEEE Press, 2002. 2258-2262.
    • (2002) Proc. of the 2002 IEEE Int'l Conf. on Communications , vol.4 , pp. 2258-2262
    • Zhang, B.X.1    Mouftah, H.T.2


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