메뉴 건너뛰기




Volumn 37, Issue 3-4, 2001, Pages 407-423

Hop-by-hop quality of service routing

Author keywords

(T)SAMCRA; NP completeness; Quality of service; Routing

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; QUALITY OF SERVICE; TELECOMMUNICATION NETWORKS;

EID: 0035813472     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(01)00222-5     Document Type: Article
Times cited : (134)

References (26)
  • 14
    • 0002777817 scopus 로고
    • Approximation schemes for the restricted shortest path problem
    • (1992) Math. Oper. Res. , vol.17 , Issue.1 , pp. 36-42
    • Hassin, R.1
  • 16
    • 0021392471 scopus 로고
    • Algorithms for finding paths with multiple constraints
    • (1984) Networks , vol.14 , pp. 95-116
    • Jaffe, J.M.1
  • 23
    • 0032284732 scopus 로고    scopus 로고
    • A lower bound for the end-to-end delay in networks: Application to voice over IP
    • November 8-12, Sydney (Australia)
    • (1998) IEEE Globecom'98 , pp. 2508-2513
    • Van Mieghem, P.1


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