메뉴 건너뛰기




Volumn 40, Issue 12, 2002, Pages 50-55

An overview of constraint-based path selection algorithms for QoS routing

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MULTIMEDIA SYSTEMS; NETWORK PROTOCOLS; QUALITY OF SERVICE;

EID: 0036904559     PISSN: 01636804     EISSN: None     Source Type: Journal    
DOI: 10.1109/MCOM.2002.1106159     Document Type: Article
Times cited : (272)

References (11)
  • 2
    • 0002777817 scopus 로고
    • Approximation schemes for the restricted shortest path problem
    • R. Hassin, "Approximation Schemes for the Restricted Shortest Path Problem," Math. of Ops. Res., vol. 17, no. 1, 1992, pp. 36-42.
    • (1992) Math. of Ops. Res. , vol.17 , Issue.1 , pp. 36-42
    • Hassin, R.1
  • 4
    • 0021392471 scopus 로고
    • Algorithms for finding paths with multiple constraints
    • J.M. Jaffe, "Algorithms for Finding Paths with Multiple Constraints," Networks, vol. 14, 1984, pp. 95-116.
    • (1984) Networks , vol.14 , pp. 95-116
    • Jaffe, J.M.1
  • 5
    • 0033908221 scopus 로고    scopus 로고
    • TAMCRA: A tunable accuracy multiple constraints routing algorithm
    • H. De Neve and P. Van Mieghem, "TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm," Comp. Commun., vol. 23, 2000, pp. 667-79.
    • (2000) Comp. Commun. , vol.23 , pp. 667-679
    • De Neve, H.1    Van Mieghem, P.2
  • 6
    • 0035813472 scopus 로고    scopus 로고
    • Hop-by-hop quality of service routing
    • Oct.
    • P. Van Mieghem, H. De Neve and F.A. Kuipers, "Hop-by-hop Quality of Service Routing," Comp. Nets., vol. 37, no. 3-4, Oct. 2001, pp. 407-23.
    • (2001) Comp. Nets. , vol.37 , Issue.3-4 , pp. 407-423
    • Van Mieghem, P.1    De Neve, H.2    Kuipers, F.A.3
  • 7
    • 0031618385 scopus 로고    scopus 로고
    • On finding multi-constrained paths
    • IEEE
    • S. Chen and K. Nahrstedt. "On Finding Multi-Constrained Paths," Proc ICC '98, vol. 2, IEEE, 1998, pp. 874-79.
    • (1998) Proc ICC '98 , vol.2 , pp. 874-879
    • Chen, S.1    Nahrstedt, K.2
  • 8
    • 0035400767 scopus 로고    scopus 로고
    • A randomized algorithm for finding a path subject to multiple QoS constraints
    • T. Korkmaz and M. Krunz, "A Randomized Algorithm for Finding a Path Subject to Multiple QoS Constraints," Comp. Nets., vol. 36, no. 2-3, 2001, pp. 251-68.
    • (2001) Comp. Nets. , vol.36 , Issue.2-3 , pp. 251-268
    • Korkmaz, T.1    Krunz, M.2
  • 9
    • 0035019901 scopus 로고    scopus 로고
    • Multi-constrained optimal path selection
    • Anchorage, AK, Apr. IEEE
    • T. Korkmaz and M. Krunz, "Multi-constrained Optimal Path Selection," Proc. INFOCOM 2001, vol 2, Anchorage, AK, Apr. 2001, IEEE, pp. 834-43.
    • (2001) Proc. INFOCOM 2001 , vol.2 , pp. 834-843
    • Korkmaz, T.1    Krunz, M.2
  • 10
    • 0036554087 scopus 로고    scopus 로고
    • Heuristic algorithms for multiconstrained quality-of-service routing
    • X. Yuan, "Heuristic Algorithms for Multiconstrained Quality-of-Service Routing," IEEE/ACM Trans, Net., vol. 10, no. 2, 2002, pp. 244-56.
    • (2002) IEEE/ACM Trans, Net. , vol.10 , Issue.2 , pp. 244-256
    • Yuan, X.1
  • 11
    • 0035019899 scopus 로고    scopus 로고
    • A*Prune: An algorithm for finding k shortest paths subject to multiple constraints
    • Anchorage, AK, Apr., IEEE
    • G. Liu and K.G. Ramakrishnan, "A*Prune: An Algorithm for Finding k Shortest Paths Subject to Multiple Constraints," Proc. INFOCOM 2001, Anchorage, AK, Apr. 2001, IEEE, pp. 743-49.
    • (2001) Proc. INFOCOM 2001 , pp. 743-749
    • Liu, G.1    Ramakrishnan, K.G.2


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