|
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;
BELLMAN-FORD ALGORITHMS;
HEURISTIC SCHEMES;
HIGH PROBABILITY;
POLYNOMIAL-TIME;
QOS CONSTRAINTS;
QUALITY OF SERVICE CONSTRAINTS;
QUALITY OF SERVICE ROUTING;
SIMULATION STUDIES;
QUALITY OF SERVICE;
|
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)
|