메뉴 건너뛰기




Volumn , Issue , 2011, Pages

QoS routing algorithms using fully polynomial time approximation scheme

Author keywords

[No Author keywords available]

Indexed keywords

EXTENDED VERSIONS; FULLY POLYNOMIAL TIME APPROXIMATION SCHEMES; QOS ROUTING; QOS ROUTING ALGORITHMS;

EID: 79960657819     PISSN: 1548615X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IWQOS.2011.5931329     Document Type: Conference Paper
Times cited : (11)

References (9)
  • 1
    • 71749102174 scopus 로고    scopus 로고
    • MOEAQ: A QoS-Aware Multicast Routing Algorithm for MANET
    • Mar.
    • J. Huang and Y. Liu, "MOEAQ: A QoS-Aware Multicast Routing Algorithm for MANET," Exp. Sys. with App., vol. 37, no. 2, pp. 1391- 1399, Mar. 2010.
    • (2010) Exp. Sys. with App. , vol.37 , Issue.2 , pp. 1391-1399
    • Huang, J.1    Liu, Y.2
  • 2
    • 0036904559 scopus 로고    scopus 로고
    • An Overview of Constraint-Based Path Selection Algorithms for QoS Routing
    • Dec.
    • F.A. Kuipers, P.V. Mieghem, T. Korkmaz and M. Krunz, "An Overview of Constraint-Based Path Selection Algorithms for QoS Routing," IEEE Com. Mag., vol. 40, no. 12, pp. 50-55, Dec. 2002.
    • (2002) IEEE Com. Mag. , vol.40 , Issue.12 , pp. 50-55
    • Kuipers, F.A.1    Mieghem, P.V.2    Korkmaz, T.3    Krunz, M.4
  • 3
    • 0023207978 scopus 로고
    • Approximation of Pareto optima in multiple-objective, shortest path problem
    • Jan.-Feb.
    • A.Warburton, "Approximation of Pareto optima in multiple-objective, shortest path problem," Oper. Res., vol. 35, no. 1, pp. 70-79, Jan.-Feb. 1987.
    • (1987) Oper. Res. , vol.35 , Issue.1 , pp. 70-79
    • Warburton, A.1
  • 4
    • 0002777817 scopus 로고
    • Approximation schemes for the restricted shortest path problem
    • Feb.
    • R. Hassin, "Approximation schemes for the restricted shortest path problem," Math. Oper. Res., vol. 17, no. 1, pp. 36-42, Feb. 1992.
    • (1992) Math. Oper. Res. , vol.17 , Issue.1 , pp. 36-42
    • Hassin, R.1
  • 5
    • 0035364530 scopus 로고    scopus 로고
    • A simple efficient approximation scheme for the restricted shortest path problem
    • Jun.
    • D.H. Lorenz and D. Raz, "A simple efficient approximation scheme for the restricted shortest path problem," Oper. Res. Lett., vol. 28, no. 5, pp. 213-219, Jun. 2001.
    • (2001) Oper. Res. Lett. , vol.28 , Issue.5 , pp. 213-219
    • Lorenz, D.H.1    Raz, D.2
  • 6
    • 0037105930 scopus 로고    scopus 로고
    • An improved FPTAS for restricted shortest path
    • Sept.
    • F. Ergun, R. Sinha, and L. Zhang, "An improved FPTAS for restricted shortest path," Inf. Process. Lett., vol. 83, no. 5, pp. 287-291, Sept. 2002.
    • (2002) Inf. Process. Lett. , vol.83 , Issue.5 , pp. 287-291
    • Ergun, F.1    Sinha, R.2    Zhang, L.3
  • 7
    • 33947538745 scopus 로고    scopus 로고
    • Finding a path subject to many additive QoS constraints
    • Feb.
    • G. Xue, A. Sen, W. Zhang, J. Tang and K. Thulasiraman, "Finding a path subject to many additive QoS constraints," IEEE/ACM Trans. Netw., vol. 15, no. 1, pp. 201-211, Feb. 2007.
    • (2007) IEEE/ACM Trans. Netw. , vol.15 , Issue.1 , pp. 201-211
    • Xue, G.1    Sen, A.2    Zhang, W.3    Tang, J.4    Thulasiraman, K.5
  • 8
    • 45749119528 scopus 로고    scopus 로고
    • Polynomial time approximation algorithms for multi-constrained QoS routing
    • Jun.
    • G. Xue, W. Zhang, J. Tang and K. Thulasiraman, "Polynomial time approximation algorithms for multi-constrained QoS routing," IEEE/ACM Trans. Netw., vol. 16, no. 3, pp. 656-669, Jun. 2008.
    • (2008) IEEE/ACM Trans. Netw. , vol.16 , Issue.3 , pp. 656-669
    • Xue, G.1    Zhang, W.2    Tang, J.3    Thulasiraman, K.4


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