메뉴 건너뛰기




Volumn 2, Issue , 1998, Pages 874-879

On finding multi-constrained paths

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING;

EID: 0031618385     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.1998.685137     Document Type: Conference Paper
Times cited : (291)

References (13)
  • 5
    • 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
  • 6
    • 0002017288 scopus 로고    scopus 로고
    • Quality-of-service routing with performance guarantees
    • May
    • Q. Ma and P. Steenkiste. Quality-of-service routing with performance guarantees. IWQoS'97, May 1997.
    • (1997) IWQoS'97
    • Ma, Q.1    Steenkiste, P.2
  • 7
    • 0003078221 scopus 로고    scopus 로고
    • Routing high-bandwidth traffic in max-min fair share networks
    • August
    • Q. Ma, P. Steenkiste, and H. Zhang. Routing high-bandwidth traffic in max-min fair share networks. Sig-com'96, August 1996.
    • (1996) Sig-com'96
    • Ma, Q.1    Steenkiste, P.2    Zhang, H.3
  • 9
    • 4243168141 scopus 로고
    • Dynamic management of guaranteed performance multimedia connections
    • C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267-283, 1994.
    • (1994) Multimedia Systems Journal , vol.1 , pp. 267-283
    • Parris, C.1    Zhang, H.2    Ferrari, D.3
  • 10
    • 0029358479 scopus 로고
    • Competitive routing of virtual circuits in atm networks
    • August
    • S. Plotkin. Competitive routing of virtual circuits in atm networks. IEEE JSAC, 13:1128-1136, August 1995.
    • (1995) IEEE JSAC , vol.13 , pp. 1128-1136
    • Plotkin, S.1
  • 11
    • 0031334639 scopus 로고    scopus 로고
    • A distributed algorithm for delay-constrained unicast routing
    • Japan, March
    • H. F. Salama, D. S. Reeves, and Y. Viniotis. A distributed algorithm for delay-constrained unicast routing. Infocom'97, Japan, March 1997.
    • (1997) Infocom'97
    • Salama, H.F.1    Reeves, D.S.2    Viniotis, Y.3
  • 12
    • 0042876986 scopus 로고    scopus 로고
    • A new distributed routing algorithm with end-to-end delay guarantee
    • May
    • Quan Sun and Horst Langendorfer. A new distributed routing algorithm with end-to-end delay guarantee. IWQoS'97, May 1997.
    • (1997) IWQoS'97
    • Sun, Q.1    Langendorfer, H.2
  • 13
    • 0000742352 scopus 로고    scopus 로고
    • Qos routing for supporting resource reservation
    • September
    • Z. Wang and Jon Crowcroft. Qos routing for supporting resource reservation. IEEE JSAC, September 1996.
    • (1996) IEEE JSAC
    • Wang, Z.1    Crowcroft, J.2


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