메뉴 건너뛰기




Volumn , Issue , 1999, Pages 304-310

On the extended Bellman-Ford algorithm to solve two-constrained quality of service routing problems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; HEURISTIC ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; ROUTING ALGORITHMS;

EID: 84949996008     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCCN.1999.805535     Document Type: Conference Paper
Times cited : (29)

References (9)
  • 4
    • 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
  • 5
    • 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
  • 6
    • 0031334639 scopus 로고    scopus 로고
    • A distributed algorithm for delay-constrained unicast routing
    • Japan, April
    • H. F. Salama, D. S. Reeves and Y. Viniotis, "A Distributed Algorithm for Delay-Constrained Unicast Routing." IEEE INFOCOM'97, Japan, April 1997.
    • (1997) IEEE INFOCOM'97
    • Salama, H.F.1    Reeves, D.S.2    Viniotis, Y.3
  • 7
    • 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가 분석하여 추출한 것입니다.