메뉴 건너뛰기




Volumn 2001-January, Issue , 2001, Pages 395-400

An efficient approximate algorithm for delay-cost-constrained QoS routing

Author keywords

Delay; Routing

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS;

EID: 84950246952     PISSN: 10952055     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.2001.956296     Document Type: Conference Paper
Times cited : (13)

References (13)
  • 1
    • 0031618385 scopus 로고    scopus 로고
    • On finding multi-constrained paths
    • Atlanta, Georgia, June 7-11
    • S. Chen and K. Nahrstedt, "On finding multi-constrained paths," ICC'98, pp.874-879, Atlanta, Georgia, June 7-11, 1998.
    • (1998) ICC'98 , pp. 874-879
    • Chen, S.1    Nahrstedt, K.2
  • 2
    • 0032206931 scopus 로고    scopus 로고
    • An overview of quality of service routing for next-generation high-speed networks: Problems and solutions
    • Nov./Dec.
    • S. Chen and K. Nahrstedt, "An overview of quality of service routing for next-generation high-speed networks: problems and solutions," IEEE Network, pp.64-79, Nov./Dec. 1998.
    • (1998) IEEE Network , pp. 64-79
    • Chen, S.1    Nahrstedt, K.2
  • 3
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • E. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol.1, pp.269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.1
  • 4
    • 84950279266 scopus 로고    scopus 로고
    • Fast algorithms for delay-constrained least-cost unicast routing
    • submitted
    • G. Feng and C. Douligeris, "Fast algorithms for delay-constrained least-cost unicast routing", submitted to Computer Networks, available at http://www.students.miami.edu/gfeng.
    • Computer Networks
    • Feng, G.1    Douligeris, C.2
  • 6
    • 0021392471 scopus 로고
    • Algorithms for finding paths with multiple constraints
    • J.M. Jaffe, "Algorithms for finding paths with multiple constraints," Networks, 14:95-116, 1984.
    • (1984) Networks , vol.14 , pp. 95-116
    • Jaffe, J.M.1
  • 7
    • 0002777817 scopus 로고
    • Approximation scheme for the restricted shortest path problem
    • Feb.
    • R. Hassin, "Approximation scheme for the restricted shortest path problem," Mathematics of Operation Research, 17(1): 36-42, Feb. 1992.
    • (1992) Mathematics of Operation Research , vol.17 , Issue.1 , pp. 36-42
    • Hassin, R.1
  • 8
    • 0032686313 scopus 로고    scopus 로고
    • Optimal partition of QoS requirements on unicast paths and multicast trees
    • New York, Mar 21-25
    • D. H. Lorenz and A. Orda,"Optimal partition of QoS requirements on unicast paths and multicast trees," INFOCOM'99, vol.1, pp. 246-253 ,New York, Mar 21-25, 1999.
    • (1999) INFOCOM'99 , vol.1 , pp. 246-253
    • Lorenz, D.H.1    Orda, A.2
  • 9
    • 0030263992 scopus 로고    scopus 로고
    • Efficient solutions to multicast routing in communication networks
    • K. Makki, N. Pissinou and O. Frieder, "Efficient solutions to multicast routing in communication networks," Mobile networks and Applications, vol. 1, pp. 221-232, 1996.
    • (1996) Mobile Networks and Applications , vol.1 , pp. 221-232
    • Makki, K.1    Pissinou, N.2    Frieder, O.3
  • 10
    • 0033889581 scopus 로고    scopus 로고
    • QoS routing: The precomputation perspective
    • Israel, March 26-30
    • A. Orda and A. Sprintson, "QoS routing: The precomputation perspective," INFOCOM'2000, vol.1, pp.128-13, Israel, March 26-30, 2000.
    • (2000) INFOCOM'2000 , vol.1 , pp. 128-213
    • Orda, A.1    Sprintson, A.2
  • 11
    • 0000742351 scopus 로고    scopus 로고
    • Quality-of-Service routing for supporting multimedia applications
    • Sept.
    • Z. Wang and J. Crowcroft, "Quality-of-Service routing for supporting multimedia applications," IEEE JSAC, 14(7): 1288-1234, Sept. 1996.
    • (1996) IEEE JSAC , vol.14 , Issue.7 , pp. 1288-11234
    • Wang, Z.1    Crowcroft, J.2
  • 12
    • 0024123493 scopus 로고
    • Routing of multipoint connections
    • Dec.
    • B.M. Waxman, "Routing of multipoint connections," IEEE JSAC, 6(9): 1617-1622, Dec. 1988.
    • (1988) IEEE JSAC , vol.6 , Issue.9 , pp. 1617-1622
    • Waxman, B.M.1


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