Sciweavers

Share
TON
2002

Heuristic algorithms for multiconstrained quality-of-service routing

8 years 9 months ago
Heuristic algorithms for multiconstrained quality-of-service routing
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristics, the limited granularity heuristic and the limited path heuristic, are investigated. Both heuristics extend the Bellman
Xin Yuan
Added 23 Dec 2010
Updated 23 Dec 2010
Type Journal
Year 2002
Where TON
Authors Xin Yuan
Comments (0)
books