메뉴 건너뛰기




Volumn 17, Issue 3, 2001, Pages 507-524

Constructing delay-bounded multicast trees in computer networks

Author keywords

Delay bounded multicast; Distributed algorithm; Multicast routing; Steiner tree; Tree cost

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MULTICASTING; NETWORK PROTOCOLS; RANDOM PROCESSES; TREES (MATHEMATICS);

EID: 0035329275     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (5)

References (32)
  • 10
  • 15
    • 84987034438 scopus 로고
    • Steiner problem in networks: A survey
    • (1987) Networks , vol.17 , pp. 129-167
    • Winter, P.1


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