메뉴 건너뛰기




Volumn 10, Issue 1, 2002, Pages 102-114

Optimal partition of QoS requirements on unicast paths and multicast trees

Author keywords

Broadband networks; Convex costs; Multicast; QoS partitioning; QoS dependent costs; Routing; Unicast

Indexed keywords

ROUTING;

EID: 0036476668     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.986559     Document Type: Article
Times cited : (66)

References (26)
  • 10
    • 0002777817 scopus 로고
    • Approximation schemes for the restricted shortest path problem
    • Feb.
    • (1992) Math. Oper. Res. , vol.17 , Issue.1 , pp. 36-42
    • Hassin, R.1
  • 11
    • 0000860218 scopus 로고
    • Lower and upper bounds for the alloction problem and other nonlinear optimization problems
    • (1994) Math. Oper. Res. , vol.19 , Issue.2 , pp. 390-409
    • Hochbaum, D.S.1
  • 25
    • 0029388337 scopus 로고
    • Service disciplines for guaranteed performance service in packet-switching networks
    • Oct.
    • (1995) Proc. IEEE , vol.83 , pp. 1374-1399
    • Zhang, H.1


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