Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

TON
2002

favoriteEmaildiscussreport

83views more TON 2002»

Heuristic algorithms for multiconstrained quality-of-service routing

13 years 4 months ago

Heuristic algorithms for multiconstrained quality-of-service routing

Download www.lcs.poli.usp.br

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

Real-time Traffic

Heuristic | Independent Qos Constraints | QoS Constraints | TON 2002 |

claim paper

Related Content

» Joint Duty Cycle Scheduling Resource Allocation and Multiconstrained QoS Routing Algorithm

» A Heuristic Algorithm for the Multiconstrained Multicast Tree

» On the Performance of Heuristic H MCOP for MultiConstrained OptimalPath QoS Routing

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	2002
Where	TON
Authors	Xin Yuan

Comments (0)