An efficient algorithm for finding a path subject to two additive constraints

Performance Evaluation Review

Volumn 28, Issue 1, 2000, Pages 318-327

  Korkmaz, Turgay ^a   Krunz, Marwan ^a   Tragoudas, Spyros ^b  

^a University of Arizona   (United States)

^b Southern Illinois University Carbondale   (United States)

Author keywords

Multiple constrained path selection; QoS routing; Scalable routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); CONSTRAINT THEORY; HEURISTIC METHODS; JITTER; QUALITY OF SERVICE; TELECOMMUNICATION TRAFFIC;

DIJKSTRAS SHORTEST PATH ALGORITHM; MULTIPLE CONSTRAINED PATH SELECTION; RESTRICTED SHORTEST PATH; SCALABLE ROUTING;

PACKET NETWORKS;

EID: 0034442313     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/345063.339427     Document Type: Conference Paper

References (38)