An efficient algorithm for finding a pat
โ
Turgay Korkmaz; Marwan Krunz; Spyros Tragoudas
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 616 KB
One of the key issues in providing end-to-end quality-of-service (QoS) guarantees in packet networks is how to determine a feasible path that satisยฎes a number of QoS constraints. For two or more additive constraints, the problem of ยฎnding a feasible path is NP-complete that cannot be exactly solved